This Article 
 Bibliographic References 
 Add to: 
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm
July 2006 (vol. 17 no. 7)
pp. 694-702

Abstract—In this paper, we propose a framework to study how to effectively perform loadsharing in multipath communication networks. A generalized load sharing (GLS) model has been developed to conceptualize how traffic is split ideally on a set of active paths. A simple traffic splitting algorithm, called packet-by-packet weighted fair routing (PWFR), has been developed to approximate GLS with the given routing weight vector by transmitting each packet as a whole. We have developed some performance bounds for PWFR and found that PWFR is a deterministically fair traffic splitting algorithm. This attractive property is useful in the provision of service with guaranteed performance when multiple paths can be used simultaneously to transmit packets which belong to the same flow. Our simulation studies, based on a collection of Internet backbone traces, reveal that PWFR outperforms two other traffic splitting algorithms, namely, packet-by-packet generalized round robin routing (PGRR), and packet-by-packet probabilistic routing (PPRR).

[1] H. Adiseshu, G. Varghese, and G. Parulkar, “An Architecture for Packet-Striping Protocols,” ACM Trans. Computer Systems, vol. 17, no. 4, pp. 249-287, Nov. 1999.
[2] Inverse Multiplexing for ATM (IMA) Specification Version 1.1, ATM Forum Technical Committee, Mar. 1999.
[3] J.C.R. Bennett and H. Zhang, “${\rm WF^2Q}$ : Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM '96, vol. 1, pp. 120-128, Mar. 1996.
[4] Z. Cao, Z. Wang, and E. Zegura, “Performance of Hashing-Based Schemes for Internet Load Balancing” Proc. IEEE INFOCOM, vol. 1, pp. 332-341, Mar. 2000.
[5] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” Internetworking: Research and Experience, vol. 1, no. 1, pp. 3-26, Sept. 1990.
[6] IEEE Standard 802.3-2002, IEEE CS, Mar. 2002.
[7] K.-C. Leung and V.O.K. Li., “A Resequencing Model for High Speed Networks,” Proc. IEEE Int'l Conf. Comm., vol. 2, pp. 1239-1243, June 1999.
[8] K.-C. Leung and V.O.K. Li, “Generalized Load Sharing for Packet-Switching Networks” Proc. IEEE Int'l Conf. Network Protocols, pp. 305-314, Nov. 2000.
[9] A. Orda, “Routing with End-to-End QoS Guarantees in Broadband Networks,” IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 365-374, June 1999.
[10] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[11] K. Sklower, B. Lloyd, G. McGregor, D. Carr, and T. Coradetti, The PPP Multilink Protocol (MP), Request for Comments, RFC 1990, Network Working Group, Internet Eng. Task Force, Aug. 1996.
[12] H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks, Proc. IEEE, vol. 83, no. 10, pp. 1374-1396, Oct. 1995.

Index Terms:
Computer communications, dispersity routing, high speed networks, inverse multiplexing, load sharing, multipath routing, multiprotocol label switching, network striping, performance modeling, traffic dispersion, traffic engineering.
Ka-Cheong Leung, Victor O.K. Li, "Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 694-702, July 2006, doi:10.1109/TPDS.2006.90
Usage of this product signifies your acceptance of the Terms of Use.