Traffic Routing Problem on MPLS Network with Unicast Connections
- Authors: Luzgachev MV1, Samouylov KE1
-
Affiliations:
- Peoples Friendship University of Russia
- Issue: No 1 (2009)
- Pages: 23-33
- Section: Articles
- URL: https://journals.rudn.ru/miph/article/view/8464
Cite item
Full Text
Abstract
The Multiprotocol Label Switching (MPLS) technology is a solution to build multiservice network transport layer. When such networks are operated quality provisioning with optimal usage of network resources problems appear. In this paper traffic routing problem on MPLS network with unicast connections is formulated when network parameters are given. The network parameters are structure, bandwidth requirements, routing costs, delays and packet loss probabilities. The problem is formulated in terms of graph theory and multiobjective optimization. Numerical example calculated using simplex and weighted sum methods is also shown.
About the authors
M V Luzgachev
Peoples Friendship University of RussiaКафедра систем телекоммуникаций; Российский университет дружбы народов; Peoples Friendship University of Russia
K E Samouylov
Peoples Friendship University of RussiaКафедра систем телекоммуникаций; Российский университет дружбы народов; Peoples Friendship University of Russia