Generalized load sharing for packet-switching networks

We propose a framework to study how to effectively perform load sharing 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 weighted fair routing (WFR), has been developed at two different granularity levels, namely, the packet level, and the call level, to approximate GLS with the given routing weight vector. The packet-by-packet WFR (PWFR) mimics GLS by transmitting each packet as a whole whereas the call-by-call WFR (CWFR) imitates GLS so that all packets belonging to a single flow are sent on the same path. We have developed some performance bounds for PWFR and formed 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 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 multipoint path routing protocols.

[1]  P.H. Fredette.  The past, present, and future of inverse multiplexing , 1994, IEEE Communications Magazine.

[2]  Nicholas F. Maxemchuk,et al.  Dispersity routing on ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[3]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

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

[5]  Victor O. K. Li,et al.  DIVERSITY TRANSMISSIONS IN A COMMUNICATION NETWORK WITH UNRELIABLE COMPONENTS. , 1987 .

[6]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[7]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[8]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .

[9]  J. Duncanson,et al.  Inverse multiplexing , 1994, IEEE Communications Magazine.

[10]  Eva Gustafsson.  Traffic dispersion in ATM networks , 1997 .

[11]  Jonathan M. Smith,et al.  Striping within the network subsystem , 1995, IEEE Netw..

[12]  Soung Chang Liew,et al.  Parallel Communications for ATM Network Control and Management , 1997, Perform. Evaluation.

[13]  Nicholas F. Maxemchuk,et al.  Dispersity Routing in High-Speed Networks , 1993, Comput. Networks ISDN Syst..

[14]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[15]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[16]  Dispersity Routing,et al.  Dispersity Routing , .

[17]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[18]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[19]  Lars Dittmann,et al.  String Mode-A New Concept for Performance Improvement of ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[20]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[21]  Ariel Orda.  Routing with end-to-end QoS guarantees in broadband networks , 1999, TNET.

[22]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[23]  Victor O. K. Li,et al.  Flow assignment and packet scheduling for multipath networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[24]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[25]  George Varghese,et al.  An architecture for packet-striping protocols , 1999, TOCS.

[26]  Sape J. Mullender.  Distributed multimedia systems , 1992, Future Gener. Comput. Syst..

[27]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[28]  Shivendra S. Panwar,et al.  On a resequencing model for high speed networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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