A load balancing scheme for congestion control in MPLS networks

In this paper we develop a load balancing scheme for networks based on the MPLS framework. The proposed algorithm (DYLBA - dynamic load balancing algorithm) implements a local search technique where the basic move is the modification of the route for a single label switched path. Experiments under a dynamic traffic scenario show a reduced rejection probability especially with long-lived connection requests, thus providing a better use of resources when compared to existing constraint-based routing schemes for traffic engineering in MPLS networks.

[1]  Jadranka Skorin-Kapov,et al.  On minimum congestion routing in rearrangeable multihop lightwave networks , 1995, J. Heuristics.

[2]  Alpár Jüttner,et al.  On-demand optimization of label switched paths in MPLS networks , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[3]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[4]  Chris Phillips,et al.  Dynamic congestion control mechanisms for MPLS networks , 2001, SPIE Optics East.

[5]  Mauro Brunato,et al.  Dynamic Load Balancing in WDM Networks , 2002 .

[6]  Bijan Jabbari,et al.  Internet traffic engineering using multi-protocol label switching (MPLS) , 2002, Comput. Networks.

[7]  Bin Wang,et al.  A new bandwidth guaranteed routing algorithm for MPLS traffic engineering , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[8]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[9]  Load Balancing in WDM Networks through Adaptive Routing Table Changes , 2002, NETWORKING.

[10]  Raouf Boutaba,et al.  DORA: Efficient Routing for MPLS Traffic Engineering , 2002, Journal of Network and Systems Management.