Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Quality-of-service in packet networks: basic mechanisms and directions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
On achievable service differentiation with token bucket marking for TCP
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
Rate allocation and buffer management for differentiated services
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
On Creating Proportional Loss-Rate Differentiation: Predictability and Performance
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Dynamic Class Selection: From Relative Differentiation to Absolute QoS
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A QoS architecture for quantitative service differentiation
IEEE Communications Magazine
Proportional differentiation: a scalable QoS approach
IEEE Communications Magazine
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
On the convolution of Pareto and gamma distributions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Competitive FIFO Buffer Management for Weighted Packets
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
A new design for end-to-end proportional loss differentiation in IP networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic management strategy for delay-tolerant networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
Today's Internet carries traffic from a broad range of applications with different requirements. This has stressed its original, one-class, best-effort model, and has been a major driver of the many efforts aimed at introducing QoS. These efforts have, however, been met with only limited success, in part because the complexity they add is often at odds with the scalability requirements of the Internet. This has motivated many investigations for solutions that offer a better trade-off between service differentiation and complexity. This paper shares similar goals and proposes a simple scheme, Bounded Random Drop (BRD), that supports multiple service classes and is implemented using a single FIFO queue and a basic random dropping mechanism. BRD focuses on loss differentiation, as although losses and delay are both important, the steady rise of Internet link speeds is progressively limiting the impact of delay differentiation. It offers strong loss differentiation capabilities, and does not require traffic profiles or admission controls. BRD guarantees each class losses that, when feasible, are no worse than a specified bound, while enforcing differentiation only when required to meet those bounds. The performance of BRD is investigated for a broad range of traffic mixes and shown to consistently achieve its design goals.