Explicit allocation of best-effort packet delivery service
by David D. Clark, Wenjia Fang
url show details
Details
type: | misc | pages: | 362--373 | year: | 1998 | institution: | Department of Computer Science, Princeton University | volume: | 6 | month: | aug | number: | 4 | journal: | IEEE/ACM Transactions on Networking | 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 sup ports two complimentary 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, an more efficiently utilizing the network resources. | annote: | This paper presents the {"}allocated-capacity{"} framework for providing different levels of best-effort service in times of congestion. The basic idea is that all packets that enter the network are tagged as either {"}in{"} or {"}out{"}, and routers then drop {"}out{"} packets with a higher probability than {"}in{"} packets. |
|
|
You need to log in to add tags and post comments.