TY - GEN
T1 - Proportional bandwidth allocation in diffServ networks
AU - Park, Eun Chan
AU - Choi, Chong Ho
PY - 2004
Y1 - 2004
N2 - By analyzing the steady state throughput of TCP flows in differentiated service (DiffServ) networks, we show that current DiffServ networks are biased in favor of those flows that have a smaller target rate, which results in unfair bandwidth allocation. In order to solve this unfairness problem, we propose an adaptive marking scheme, which allocates bandwidth in a manner which is proportional to the target rates of the aggregate TCP flows in the DiffServ network. This scheme adjusts the target rate according to the congestion level of the network, so that the aggregate flow can obtain its fair share of the bandwidth. Since it utilizes edge-to-edge feedback information without measuring or keeping any per-flow state, this scheme is scalable and does not require any additional signaling protocol or any significant changes to the current TCP/IP protocol. It can be implemented in a distributed manner using only two-bit feedback information, which is carried in the TCP acknowledgement. Using extensive simulations, we show that the proposed scheme can provide each aggregate flow with its fair share of the bandwidth, which is proportional to the target rate, under various network conditions.
AB - By analyzing the steady state throughput of TCP flows in differentiated service (DiffServ) networks, we show that current DiffServ networks are biased in favor of those flows that have a smaller target rate, which results in unfair bandwidth allocation. In order to solve this unfairness problem, we propose an adaptive marking scheme, which allocates bandwidth in a manner which is proportional to the target rates of the aggregate TCP flows in the DiffServ network. This scheme adjusts the target rate according to the congestion level of the network, so that the aggregate flow can obtain its fair share of the bandwidth. Since it utilizes edge-to-edge feedback information without measuring or keeping any per-flow state, this scheme is scalable and does not require any additional signaling protocol or any significant changes to the current TCP/IP protocol. It can be implemented in a distributed manner using only two-bit feedback information, which is carried in the TCP acknowledgement. Using extensive simulations, we show that the proposed scheme can provide each aggregate flow with its fair share of the bandwidth, which is proportional to the target rate, under various network conditions.
KW - Diffserv networks
KW - Fairness
KW - Proportional bandwidth allocation
KW - Quality of service
KW - Scalability
UR - http://www.scopus.com/inward/record.url?scp=8344249413&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2004.1354612
DO - 10.1109/INFCOM.2004.1354612
M3 - Conference contribution
AN - SCOPUS:8344249413
SN - 0780383559
T3 - Proceedings - IEEE INFOCOM
SP - 2038
EP - 2049
BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 7 March 2004 through 11 March 2004
ER -