Sequence-preserving adaptive load balancers

Load balancing in packet-switched networks is a task of ever-growing importance. Network traffic properties, such as the Zipf-like flow length distribution and bursty transmission patterns, and requirements on packet ordering or stable flow mapping, make it a particularly difficult and complex task, needing adaptive heuristic solutions. In this paper, we present two main contributions: Firstly, we evaluate and compare two recently proposed algorithmic heuristics that attempt to adaptively balance load among the destination units. The evaluation on real life traces confirms the previously conjectured impact of the Zipf-like flow length distribution and traffic burstiness. Furthermore, we identify the distinction between the goals of preserving either the sequence order of packets, or the flow- to-destination mapping, showing different strengths of each algorithm. Secondly, we demonstrate a novel hybrid scheme that combines best of the flow-based and burst-based load balancing techniques and excels in both of the key metrics of flow remapping and packet reordering.

[1]  Jean-Yves Le Boudec,et al.  Adaptive Load Sharing for Network Processors , 2002, IEEE/ACM Transactions on Networking.

[2]  M. Laor,et al.  The effect of packet reordering in a backbone link on application throughput , 2002, IEEE Netw..

[3]  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).

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

[5]  Marcel Waldvogel,et al.  Creating advanced functions on network processors: experience and perspectives , 2003 .

[6]  Keith W. Ross,et al.  Hash routing for collections of shared Web caches , 1997, IEEE Netw..

[7]  Gero Dittmann,et al.  Network Processor Load Balancing for High-Speed Links , 2000 .

[8]  Anees Shaikh,et al.  Load-sensitive routing of long-lived IP flows , 1999, SIGCOMM '99.

[9]  Craig Partridge,et al.  Packet reordering is not pathological network behavior , 1999, TNET.

[10]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[11]  Pawel Gburzynski,et al.  A scalable load balancer for forwarding internet traffic , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).

[12]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[13]  Richard G. Baraniuk,et al.  Connection-level analysis and modeling of network traffic , 2001, IMW '01.

[14]  Andrew W. Moore,et al.  Architecture of a network monitor , 2003 .

[15]  David Thaler,et al.  Using name-based mappings to increase hit rates , 1998, TNET.

[16]  H. Jonathan Chao,et al.  Internet traffic load balancing using dynamic hashing with flow volume , 2002, SPIE ITCom.

[17]  Jeffrey R. Spirn,et al.  Program Behavior: Models and Measurements , 1977 .

[18]  Pawel Gburzynski,et al.  Traffic locality characteristics in a parallel forwarding system , 2003, Int. J. Commun. Syst..

[19]  Douglas Comer,et al.  Network Systems Design Using Network Processors , 2003 .

[20]  Srikanth Kandula,et al.  Harnessing TCP ’ s Burstiness with Flowlet Switching , 2004 .

[21]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

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