Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Adaptive packet marking for maintaining end-to-end throughput in a differentiated-services internet
IEEE/ACM Transactions on Networking (TON)
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Adaptive proportional delay differentiated services: characterization and performance evaluation
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
How to Make Assured Service More Assured
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Weighted fair bandwidth sharing using SCALE technique
Computer Communications
| Hi-index | 0.00 |
Differentiated service (DiffServ) networks have been proposed to assure the achievable minimum bandwidth to aggregate flows. However, analyses in the literature show that the current DiffServ networks are biased in favor of an aggregate flow that has a smaller committed information rate (CIR) when aggregate flows with different CIRs share a bottleneck link. In order to mitigate this unfairness problem, we propose an adaptive marking scheme which provides the relative bandwidth assurance in proportion to the CIRs of the aggregates. By introducing a virtual target rate (VTR) and adjusting it depending on the provision level of the network, each aggregate can obtain its fair share of the bandwidth, regardless of traffic load. This scheme is based on a feedback approach. It utilizes only two-bit feedback information conveyed in the packet header and can be implemented in a distributed manner. Furthermore, the proposed scheme does not require calculating fair shares of aggregates or any additional signaling protocol. Using steady state analysis and extensive simulations, we show that the scheme can provide aggregate flows with their fair shares of bandwidth, which is proportional to the CIRs, under various network conditions.