Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE/ACM TRANSACTIONS ON NETWORKlNG, VOL. 6, NO. 4, AUGUST 1998 Explicit Allocation of Best-Effort
 

Summary: IEEE/ACM TRANSACTIONS ON NETWORKlNG, VOL. 6, NO. 4, AUGUST 1998
Explicit Allocation of Best-Effort
Packet Delivery Service
David D. Clark, Fellow, IEEE, and Wenjia Fang
Abstract- This paper presents the "allocated-capacity"
framework for providing different levels of best-effort
service in times of network congestion. The "allocated-
capacity" 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

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences