TY - GEN
T1 - Congestion control using efficient explicit feedback
AU - Qazi, Ihsan Ayyub
AU - Znati, Taieb
AU - Andrew, Lachlan L.H.
PY - 2009
Y1 - 2009
N2 - This paper proposes a framework for congestion control, called Binary Marking Congestion Control (BMCC) for high bandwidth-delay product networks. The basic components of BMCC are i) a packet marking scheme for obtaining high resolution congestion estimates using the existing bits available in the IP header for Explicit Congestion Notification (ECN) and ii) a set of load-dependent control laws that use these congestion estimates to achieve efficient and fair bandwidth allocations on high bandwidth-delay product networks, while maintaining a low persistent queue length and negligible packet loss rate. We present analytical models that predict and provide insights into the convergence properties of the protocol. Using extensive packet-level simulations, we assess the efficacy of BMCC and perform comparisons with several proposed schemes. BMCC outperforms VCP, MLCP, XCP, SACK+RED/ECN and in some cases RCP, in terms of average flow completion times for typical Internet flow sizes.
AB - This paper proposes a framework for congestion control, called Binary Marking Congestion Control (BMCC) for high bandwidth-delay product networks. The basic components of BMCC are i) a packet marking scheme for obtaining high resolution congestion estimates using the existing bits available in the IP header for Explicit Congestion Notification (ECN) and ii) a set of load-dependent control laws that use these congestion estimates to achieve efficient and fair bandwidth allocations on high bandwidth-delay product networks, while maintaining a low persistent queue length and negligible packet loss rate. We present analytical models that predict and provide insights into the convergence properties of the protocol. Using extensive packet-level simulations, we assess the efficacy of BMCC and perform comparisons with several proposed schemes. BMCC outperforms VCP, MLCP, XCP, SACK+RED/ECN and in some cases RCP, in terms of average flow completion times for typical Internet flow sizes.
UR - http://www.scopus.com/inward/record.url?scp=70349673283&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349673283&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2009.5061901
DO - 10.1109/INFCOM.2009.5061901
M3 - Conference contribution
AN - SCOPUS:70349673283
SN - 9781424435135
T3 - Proceedings - IEEE INFOCOM
SP - 10
EP - 18
BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009
Y2 - 19 April 2009 through 25 April 2009
ER -