An architecture for packet-striping protocols
ACM Transactions on Computer Systems (TOCS)
Generalized load sharing for packet-switching networks
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Generalized Load Sharing for Packet-Switching Networks II: Flow-Based Algorithms
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Generalized load sharing for homogeneous networks of distributed environment
Journal of Computer Systems, Networks, and Communications
Fair bandwidth sharing and delay differentiation: Joint packet scheduling with buffer management
Computer Communications
A resequencing model for high-speed packet-switching networks
Computer Communications
Generalized load sharing for distributed operating systems
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
A dynamic traffic distribution strategy for multipath routing
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Dual Mobile-IP tunnels for video stream splitting and merging in wireless handoffs
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
Comparison of load-balancing approaches for multipath connectivity
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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).