Max-min fair rate allocation for VCP in multi-bottleneck networks Online publication date: Wed, 08-Apr-2015
by Huixiang Zhang; Chunlei Chen; Hairui Zhou; Guanzhong Dai
International Journal of Internet Protocol Technology (IJIPT), Vol. 8, No. 4, 2014
Abstract: Variable-structure congestion Control Protocol (VCP) leverages the existing two Explicit Congestion Notification (ECN) bits for network congestion feedback and achieves comparable performance to eXplicit congestion Control Protocol (XCP). VCP utilises the encoded load factor-based feedback scheme to deliver congestion signals. In multi-bottleneck networks, all bottleneck links on the transmission path would contribute to the aggregate congestion signal, and VCP fails to achieve max-min fairness. To address this problem, a new metric called overload period is introduced to measure the congestion level of links, and the overload period-based feedback scheme is proposed to make sure that each VCP flow's rate is controlled only by the link with minimum overload period encountered on the transmission path. It is proved that the link with minimum overload period is the flow's bottleneck, and the max-min fair rate allocation is achieved in multi-bottleneck networks. The overload period-based feedback scheme is validated using NS2 simulations.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook