Lower than best effort: a design and implementation

Citation
K. Carlberg et al., Lower than best effort: a design and implementation, COMP COM R, 31(2), 2001, pp. 244
Citations number
16
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
SIGCOMM computer communication review
ISSN journal
01464833 → ACNP
Volume
31
Issue
2
Year of publication
2001
Supplement
S
Database
ISI
SICI code
0146-4833(200104)31:2<244:LTBEAD>2.0.ZU;2-A
Abstract
In recent years, the Internet architecture has been augmented so that Bette r-than-Best-Effort (BBE) services, in the form of reserved resources for sp ecific flows, can be provided by the network. To date, this has been realiz ed through two different and sequentially developed efforts, The first is k nown as Integrated Services and focuses on specific bounds on bandwidth and /or delay for specific flows. The Differentiated Service model was later in troduced, which presented a more aggregated and local perspective regarding the forwarding of traffic. A direction that is missing in today's work on service models is a defined schema used to purposely degrade certain traffi c to various levels below that of Best Effort. In a sense, a new direction that provides a balancing effect in the deployment of BBE service. This is particularly evident with continual and parallel short transaction flows (l ike that used for web applications) over low bandwidth links that are not s ubject to any backoff penalty incurred by congestion because state does not persist. In a more indirect perspective, our model correlates degraded ser vice with the application of usage and security policies administrative dec isions that can operate in tandem or disjointly from conditions of the netw ork. This paper attempts to address these and other issues and presents the design and implementation of such a new degraded service model and queuing mechanism used to support it.