By Topic

A Study of Fair Bandwidth Sharing with AIMD-Based Multipath Congestion Control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dizhi Zhou ; Univ. of New Brunswick, Fredericton, NB, Canada ; Wei Song ; Yu Cheng

The multi-homed capability offers a good opportunity to explore multipath transmission. To ensure fair bandwidth sharing between multipath flows and legacy single-path flows, congestion control is an essential mechanism at the transport layer to regulate traffic flows for bandwidth consumption. However, in a multipath scenario, the congestion control algorithm of the dominant transport control protocol (TCP) may result in too aggressive behavior. In this paper, we consider the generic congestion control principle of additive increase and multiplicative decrease (AIMD) and investigate two AIMD-based multipath congestion control solutions. We derive the conditions for AIMD parameters to ensure TCP-friendliness and satisfy two constraints for fair bandwidth sharing between multipath and single-path flows. Simulation results demonstrate that the AIMD-based multipath solutions well achieve the fairness goals.

Published in:

Wireless Communications Letters, IEEE  (Volume:2 ,  Issue: 3 )