Departmental Papers (ESE)

Document Type

Journal Article

Date of this Version

July 2006

Comments

Postprint version. Forthcoming in Computer Networks,
Publisher URL: http://www.elsevier.com/wps/find/journaldescription.cws_home/505606/description#description

Abstract

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.

Keywords

QoS, Queue Management, Diff-Serv

Share

COinS
 

Date Posted: 25 July 2006

This document has been peer reviewed.