Virtual-Flow Multipath Algorithms for MPLS. (13th August 2007)

• Record Type: Journal Article
• Authors: Pompili, Dario; Scoglio, Caterina; Shoniregun, Charles A.
• Is Part Of: International journal of internet technology and secured transactions. Volume 1:Number 1/2(2007)
• Page Start: 1
• Page End: 19
• Publication Date: 2007-08-13
• Subjects: MPLS -- multiprotocol label switching -- IP traffic engineering -- multi-commodity network flow problem -- quality of service -- QoS -- virtual flow multipath algorithms -- routing efficiency -- internet protocol networks -- traffic load -- network congestion -- simulation -- networking; Internet -- Security measures -- Periodicals; Computer security -- Periodicals; Information systems management -- Security measures -- Periodicals; Computer networks -- Security measures -- Periodicals; Information technology -- Security measures -- Periodicals; 005.805
• Languages: English
• ISSNs: 1748-569X

Abstract

Multiprotocol Label Switching (MPLS) can improve the routing efficiency of Internet Protocol (IP) networks through its intrinsic Traffic Engineering (TE) capabilities. In this paper, a centralised and a distributed virtual-flow routing algorithms are proposed, which aggregate IP flows entering the MPLS domain and optimally partition them among virtual flows that are routed on multiple paths. The routing algorithms dynamically select multiple Label Switched Paths (LSPs), taking into account the available bandwidth of links in the network to balance the traffic load and avoid network congestion. The multipath routing problem is formulated as a Multicommodity Network Flow (MCNF) problem, and is solved by implementing online the Dantzig?Wolfe decomposition method. The proposed multipath algorithms are shown through simulations to outperform single-path routing solutions, such as the Constraint Shortest Path First (CSPF) and the Bandwidth-Based Shortest Path (BSPR) routing algorithms.