Explicit Allocation of Best-Effort Packet Delivery Service

DMCA

Explicit Allocation of Best-Effort Packet Delivery Service (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by David D. Clark, et al.

Citations:

464 - 2 self

BibTeX

@MISC{Clark98explicitallocation,
    author = {David D. Clark and et al.},
    title = {Explicit Allocation of Best-Effort Packet Delivery Service},
    year = {1998}
}

OpenURL

Abstract

This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” framework—extensions to the Internet protocols and algorithms—can allocate bandwidth to different users in a controlled and predictable way during network congestion. The framework supports two complementary ways of controlling the bandwidth allocation: sender-based and receiver-based. In today’s heterogeneous and commercial Internet the framework can serve as a basis for charging for usage and for more efficiently utilizing the network resources. We focus on algorithms for essential components of the framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers. We present simulation results to illustrate the effectiveness of the combined algorithms in controlling transmission control protocol (TCP) traffic to achieve certain targeted sending rates.

Keyphrases

explicit allocation best-effort packet delivery service network congestion bulk-data transfer network resource different level internet protocol differential dropping algorithm tagging algorithm allocatedcapacity framework extension certain targeted sending rate essential component network router bandwidth allocation transmission control protocol profile meter present simulation result different user best-effort service allocated-capacity framework complementary way combined algorithm commercial internet predictable way

DMCA