Title :
A constrained multipath traffic engineering scheme for MPLS networks
Author :
Lee, Youngseok ; Seok, Yongho ; Choi, Yanghee ; Kim, Changhoon
Author_Institution :
Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea
Abstract :
A traffic engineering problem consists of setting up paths between the edge nodes of the network to meet traffic demands while optimizing the network performance. It is known that total traffic throughput in a network, hence the resource utilization, can be maximized if the traffic demand is split over multiple paths. However, the problem formulation and practical algorithms, which calculate the paths and the traffic split ratio taking the route constraints or policies into consideration, have not been much touched. This paper proposes practical algorithms that find near optimal paths satisfying the given traffic demand under constraints such as maximum hop count, and preferred or not-preferred node/link list. The mixed integer programming formulation also calculates the traffic split ratio for the multiple paths. The problems are solved with the split ratio of continuous or discrete values. However, the split ratio solved with discrete values (0.1, 0.2 etc.) are more suitable for easy implementation at the network nodes. The proposed algorithms are applied to the multiprotocol label switching (MPLS) that permits explicit path setup. The paths and split ratio are calculated off-line, and passed to MPLS edge routers for explicit label-switched path (LSP) setup. The proposed schemes are tested in a large-scale fictitious backbone network. The experiment results show that the proposed algorithms are fast and superior to the conventional shortest path algorithm in terms of maximum link utilization, total traffic volume, and number of required LSPs.
Keywords :
Internet; integer programming; telecommunication network routing; telecommunication switching; telecommunication traffic; Internet; LSP setup; MPLS edge routers; MPLS networks; constrained multipath traffic engineering scheme; label-switched path setup; maximum hop count; mixed integer programming formulation; multiple paths; multiprotocol label switching; network nodes; network performance; node/link list; path setup; policies; resource utilization; route constraints; traffic demand; traffic split ratio; traffic throughput; Bandwidth; Computer science; IP networks; Linear programming; Multiprotocol label switching; Resource management; Routing protocols; Telecommunication traffic; Testing; Throughput;
Conference_Titel :
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN :
0-7803-7400-2
DOI :
10.1109/ICC.2002.997280