On the fast-convergence of delay-based load balancing over multipaths for dynamic traffic environments

Multipath routing enables the source exploit multiple available paths to transfer data to destination. This technique has drawn much attention by efficiently utilizing the bandwidths, preserving packets order and so on. However, these load balancing schemes are not for the delay-related issue and thus unsuited for the real-time applications. To deal with the delay-sensitive features, a load balancing scheme named Effective Delay-Controlled Load Distribution (E-DCLD) has been proposed to lower the end-to-end delay and the associating packet reordering possibility. Nevertheless, to compute the optimal load for each path, this scheme uses gradually approaching method that needs extra convergence rounds, and performs unsatisfactory especially when path status is unstable. In this paper, we propose a Convex optimization-Based Method (CBM) to effectively figure out the best load ratio for each path based on the model of E-DCLD. The proposed method could count out the result at once and overcome the low convergence rate problem of the original solution. Experimental results demonstrate that our solution could significantly decrease the end-to-end packet delay and total packet delay.

[1]  Y. Ebihara Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Alex Zinin,et al.  Cisco IP Routing: Packet Forwarding and Intra-Domain Routing Protocols , 2001 .

[3]  Anura P. Jayasumana,et al.  Reordering of Packets due to Multipath Forwarding - An Analysis , 2006, 2006 IEEE International Conference on Communications.

[4]  Nei Kato,et al.  Effective Delay-Controlled Load Distribution over Multipath Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[5]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[6]  David Thaler,et al.  Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.

[7]  Nei Kato,et al.  On the performance analysis of traffic splitting on load imbalancing and packet reordering of bursty traffic , 2009, 2009 IEEE International Conference on Network Infrastructure and Digital Content.

[8]  Kang G. Shin,et al.  Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Christian E. Hopps,et al.  Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.

[10]  Nei Kato,et al.  Load Distribution with Queuing Delay Bound over Multipath Networks: Rate Control Using Stochastic Delay Prediction , 2008 .

[11]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[12]  Ellen W. Zegura,et al.  Performance of hashing-based schemes for Internet load balancing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Pawel Gburzynski,et al.  Load balancing for parallel forwarding , 2005, IEEE/ACM Transactions on Networking.

[14]  Curtis Villamizar,et al.  OSPF Optimized Multipath (OSPF-OMP) , 1999 .

[15]  尤达亚玛卡尔·斯瑞尼瓦桑,et al.  Dynamic load balancing without packet reordering , 2012 .

[16]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[17]  George Varghese,et al.  A Reliable and Scalable Striping Protocol , 1996, SIGCOMM.

[18]  Samuel T. Chanson,et al.  Hydrodynamic Load Balancing , 1999, IEEE Trans. Parallel Distributed Syst..

[19]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture" RFC 3031 , 2001 .