Explicit allocation of best-effort packet delivery service

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.

[1]  Andrew B. Whinston,et al.  Priority pricing of integrated services networks , 1997 .

[2]  Sally Floyd,et al.  Issues of TCP with SACK , 1996 .

[3]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[4]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[5]  Israel Cidon,et al.  Congestion control for high speed packet switched networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[6]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[7]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[8]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[9]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[10]  David Clark,et al.  Internet cost allocation and pricing , 1997 .

[11]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[12]  Jeffrey K. MacKie-Mason,et al.  Economic FAQs About the Internet , 1994 .

[13]  Janey C. Hoe Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM '96.

[14]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[15]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[16]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[17]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[18]  Janey C. Hoe Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM 1996.