Comparison of load-balancing approaches for multipath connectivity

Authors:
Antti Mäkelä;Sebastian Siikavirta;Jukka Manner
Affiliations:
Aalto University, Department of Communication and Networking, Finland;Aalto University, Department of Communication and Networking, Finland;Aalto University, Department of Communication and Networking, Finland
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2012

Citing 8
Cited 1

Challenges and Solutions to Adaptive Computing and Seamless Mobility over Heterogeneous Wireless Networks

Wireless Personal Communications: An International Journal
TCP tunnels: avoiding congestion collapse

LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm

IEEE Transactions on Parallel and Distributed Systems
Concept for providing guaranteed service level over an array of unguaranteed commodity connections

Proceedings of the 2010 ACM Symposium on Applied Computing
Shortest path bridging: efficient control of larger ethernet networks

IEEE Communications Magazine
Bundling Consumer Connections -- A Performance Analysis

WAINA '11 Proceedings of the 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications
Performance of an economical, redundant system for intranet connectivity

ISCC '11 Proceedings of the 2011 IEEE Symposium on Computers and Communications
Mobility-aware middleware for self-organizing heterogeneous networks with multihop multipath connectivity

IEEE Wireless Communications

A new high performance approach: merging optimal multicast sessions for supporting multisource routing

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

During past years, the so-called resource pooling principle in data networks has been studied more carefully. For example, the recent work on routing on the Internet over multiple paths and Multipath TCP both seek to make the best possible use of multiple connecting paths between two end points. In deployments where multiple users could share multiple paths, one of the very first questions that comes to mind is, should we schedule packets from the users on a per-flow or per-packet basis? In this paper we study networking scenarios in which several networks are connected to each other via multiple paths. We seek to understand how a multi-homed router should schedule packets and packet flows out towards other networks. Our primary interests are to study path utilization and analyze the bandwidth fairness of various approaches using different traffic loads.