Load Balancing in IP/MPLS Networks: A Survey

Singh, Ravindra Kumar; Chaudhari, Narendra S.; Saxena, Kanak

doi:10.4236/cn.2012.42020

Cited by 5 publications

(1 citation statement)

References 33 publications

(27 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The IP-based multipath routing needs to extend the existing routing algorithms (RIP, OSPF, or BGP) for multipath support, which cannot take full advantage of multiple paths that frequently exist in Internet Service Provider Network [16]. Although the MPLS-based multipath routing [17][18] is proposed as a powerful technology supporting load balancing recently, the sophisticated operations are performed by the Multi-Protocol Label Switching (MPLS) Traffic-Engineering (TE) technology, which focuses on the IP-layer network. However, legacy networks mainly employ shortest-path-based routing protocols such as Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS).…”

Section: Related Workmentioning

confidence: 99%

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

Liao¹,

Tian²,

Wang³

et al. 2014

KSII TIIS

View full text Add to dashboard Cite

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

show abstract

Section: Related Workmentioning

confidence: 99%

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

Liao¹,

Tian²,

Wang³

et al. 2014

KSII TIIS

View full text Add to dashboard Cite

show abstract

Multiobjective routing in multiservice MPLS networks with traffic splitting — A network flow approach

Girão‐Silva

Craveirinha

Clímaco

et al. 2015

J. Syst. Sci. Syst. Eng.

View full text Add to dashboard Cite

A multiobjective routing model for Multiprotocol Label Switching networks with multiple service types and traffic splitting is presented in this paper. The routing problem is formulated as a multiobjective mixed-integer program, where the considered objectives are the minimization of the bandwidth routing cost and the minimization of the load cost in the network links with a constraint on the maximal splitting of traffic trunks. Two different exact methods are developed for solving the formulated problem, one based on the classical constraint method and another based on a modified constraint method. A very extensive experimental study, with results on network performance measures in various reference test networks and in randomly generated networks, is also presented and its results are discussed.

show abstract