PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 1998IEEE/ACM Transactions on Networking885 citations

Explicit allocation of best-effort packet delivery service

View Full Paper
DCDavid D. ClarkWFWenjia Fang

Key Points

Key points are not available for this paper at this time.

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 protocol (TCP) traffic to achieve certain targeted sending rates.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Clark et al. (1998) studied this question.

synapsesocial.com/papers/6a21ea8b90e08a953957eb0ehttps://doi.org/10.1109/90.720870
Ask AI
Helpful
Bookmark
Share
View Full Paper