Explicit Allocation of Best-Effort Packet Delivery Service (1998)
Cached
Download Links
- [cs.wisc.edu]
- [www.cs.cmu.edu]
- [www.cs.wisc.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 358 - 2 self |
BibTeX
@MISC{Clark98explicitallocation,
author = {David D. Clark and et al.},
title = {Explicit Allocation of Best-Effort Packet Delivery Service},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
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.
