Explicit Allocation of Best-Effort Packet Delivery Service

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

by David D. Clark, et al.

Citations:

358 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	Explicit Allocation of Best-Effort Packet Delivery Service	SVM HeaderParse 0.2
AUTHOR NAME	David D. Clark, et al.	user correction
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.	user correction
YEAR	1998	user correction
CITATIONS	21 found	ParsCit 1.0