|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Ka-Cheong Leung, Victor O.K. Li, "Generalized Load Sharing for Packet-Switching Networks II: Flow-Based Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 703-712, July, 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/TPDS.2006.91, author = {Ka-Cheong Leung and Victor O.K. Li}, title = {Generalized Load Sharing for Packet-Switching Networks II: Flow-Based Algorithms}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {7}, issn = {1045-9219}, year = {2006}, pages = {703-712}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.91}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Generalized Load Sharing for Packet-Switching Networks II: Flow-Based Algorithms IS - 7 SN - 1045-9219 SP703 EP712 EPD - 703-712 A1 - Ka-Cheong Leung, A1 - Victor O.K. Li, PY - 2006 KW - Computer communications KW - dispersity routing KW - high speed networks KW - inverse multiplexing KW - load sharing KW - multipath routing KW - multiprotocol label switching KW - network striping KW - performance modeling KW - traffic dispersion KW - traffic engineering. VL - 17 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—In this paper, we extend the load sharing framework to study how to effectively perform flow-based traffic splitting in multipath communication networks. The generalized load sharing (GLS) model is employed to conceptualize how traffic is split ideally on a set of active paths. A simple flow-based weighted fair routing (WFR) algorithm, called call-by-call WFR (CWFR), has been developed to imitate GLS so that all packets belonging to a single flow are sent on the same path. We have investigated how to couple the proposed basic packet-by-packet WFR (PWFR) and CWFR algorithms so as to permit a traffic splitter to handle both connection-oriented and connectionless traffic simultaneously. Our simulation studies, based on a collection of Internet backbone traces, reveal that WFR outperforms two other traffic splitting algorithms, namely, generalized round robin routing (GRR), and probabilistic routing (PRR). These promising results form a basis for designing future adaptive constraint-based multipath routing protocols.
[1] 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.
[2] C. Casetti, J. Kurose, and D. Towsley, “An Adaptive Algorithm for Measurement-Based Admission Control in Integrated Services Packet Networks,” Computer Comm., vol. 23, nos. 14-15, pp. 1363-1376, Aug. 2000.
[3] S. Jamin, P.B. Danzig, S.J. Shenker, and L. Zhang, “A Measurement-Based Admission Control Algorithm for Integrated Service Packet Networks,” IEEE/ACM Trans. Networking, vol. 5, no. 1, pp. 56-70, Feb. 1997.
[4] 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.
[5] 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.
[6] K.C. Leung and V.O.K. Li, “Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 7, pp. 694-702, July 2006.
[7] C. Villamizar, “OSPF Optimized Multipath (OSPF-OMP),” Internet Draft, Internet Eng. Task Force, Work in Progress, Aug. 1999.
[8] S. Vutukury and J.J. Garcia-Luna-Aceves, “A Scalable Architecture for Providing Deterministic Guarantees,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, pp. 91-96, Oct. 1999.
[9] S. Vutukury and J.J. Garcia-Luna-Aceves, “A Traffic Engineering Approach Based on Minimum-Delay Routing,” Proc. IEEE Int'l Conf. Computer Comm. and Networks, pp. 42-47, Oct. 2000.