Combined Use of Prioritized AIMD and Flow-Based Traffic Splitting for Robust TCP Load Balancing

In this paper, we propose an AIMD-based TCP load balancing architecture in a backbone network where TCP flows are split between two explicitly routed paths, namely the primary and the secondary paths. We propose that primary paths have strict priority over the secondary paths with respect to packet forwarding and both paths are rate-controlled using ECN marking in the core and AIMD rate adjustment at the ingress nodes. We call this technique “prioritized AIMD”. The buffers maintained at the ingress nodes for the two alternative paths help us predict the delay difference between the two paths which forms the basis for deciding on which path to forward a new-coming flow. We provide a simulation study for a large mesh network to demonstrate the efficiency of the proposed approach in terms of the average per-flow goodput and byte blocking rates.

[1]  Srihari Nelakuditi,et al.  A localized adaptive proportioning approach to QoS routing , 2002 .

[2]  Zygmunt J. Haas,et al.  Multipath routing in mobile ad hoc networks or how to route in the presence of frequent topology changes , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[3]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[4]  Sara Oueslati,et al.  Impact of "Trunk Reservation" on Elastic Flow Routing , 2000, NETWORKING.

[5]  Sajal K. Das,et al.  Improving quality-of-service in ad hoc wireless networks with adaptive multi-path routing , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[6]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[8]  Nail Akar,et al.  AIMD-based online MPLS traffic engineering for TCP flows via distributed multi-path routing , 2004, Ann. des Télécommunications.

[9]  Christophe Diot,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM 2002.

[10]  Yanghee Choi,et al.  An Adaptive Flow-Level Load Control Scheme for Multipath Forwarding , 2001, ICN.

[11]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

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

[14]  Sally Floyd,et al.  Why we don't know how to simulate the Internet , 1997, WSC '97.

[15]  Erol Gelenbe,et al.  Measurement and performance of a cognitive packet network , 2001, Comput. Networks.

[16]  Leonidas Georgiadis,et al.  Lexicographically optimal balanced networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Guillaume Urvoy-Keller,et al.  Analysis of LAS scheduling for job size distributions with high variance , 2003, SIGMETRICS '03.

[19]  Curtis Villamizar,et al.  MPLS Optimized Multipath (MPLS--OMP) , 1999 .

[20]  Liang Guo,et al.  The war between mice and elephants , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

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

[22]  Erol Gelenbe,et al.  Design and performance of cognitive packet networks , 2001, Perform. Evaluation.

[23]  Erol Gelenbe,et al.  Towards Networks with Cognitive Packets , 2001 .

[24]  Vinod Vokkarane,et al.  Dynamic congestion-based load balanced routing in optical burst-switched networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[25]  Erol Gelenbe,et al.  An End-to-End Approach to the Resequencing Problem , 1984, JACM.

[26]  Ying-Dar Lin,et al.  QoS routing granularity in MPLS networks , 2002, IEEE Commun. Mag..

[27]  E. Karasan,et al.  A reordering-free multipath traffic engineering architecture for DiffServ-MPLS networks , 2003, Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764).

[28]  Randy Brown,et al.  Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem , 1988, CACM.

[29]  Somprakash Bandyopadhyay,et al.  Improving End-to-End Delay through Load Balancing with Multipath Routing in Ad Hoc Wireless Networks Using Directional Antenna , 2003, IWDC.

[30]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[31]  Jianping Wang,et al.  Traffic Engineering with AIMD in MPLS Networks , 2002, Protocols for High-Speed Networks.

[32]  S. Kalyanaraman,et al.  Traffic Engineering Techniques and Algorithms for the Internet , 2002 .

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

[34]  Peter Reichl,et al.  Adaptive Multipath Routing Based on Local Distribution of Link Load Information , 2003, QofIS.

[35]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[36]  Srihari Nelakuditi,et al.  Adaptive proportional routing: a localized QoS routing approach , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[37]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[38]  Farid Farahmand,et al.  Practical Priority Contention Resolution for Slotted Optical Burst Switching Networks , 2003 .

[39]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[40]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[41]  Saewoong Bahk,et al.  Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network , 1992, SIGCOMM 1992.

[42]  Erol Gelenbe,et al.  Cognitive packet networks: QoS and performance , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

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