Probabilistic packet scheduling: achieving proportional share bandwidth allocation for TCP flows

Author

Zhang, Ming ; Wang, Randolph ; Peterson, Larry ; Krishnamurthy, Arvind

Author_Institution

Dept. of Comput. Sci., Princeton Univ., NJ, USA

Volume

3

fYear

2002

fDate

2002

Firstpage

1650

Abstract

This paper describes and evaluates a probabilistic packet scheduling (PPS) algorithm for providing different levels of service to TCP flows. With our approach, each router defines a local currency in terms of tickets and assigns tickets to its inputs based on contractual agreements with its upstream routers. A flow is tagged with tickets to represent the relative share of bandwidth it should receive at each link. When multiple flows share the same bottleneck, the bandwidth that each flow obtains is proportional to the relative tickets assigned to that flow. Simulations show that PPS does a better job of proportionally allocating bandwidth than DiffServ and weighted CSFQ. In addition, PPS accommodates flows that cross multiple currency domains.

Keywords

bandwidth allocation; computer network management; packet switching; probability; quality of service; queueing theory; scheduling; telecommunication congestion control; telecommunication network routing; telecommunication traffic; transport protocols; TCP flows; contractual agreements; levels of service; local currency; multiple currency domains; probabilistic packet scheduling; proportional share bandwidth allocation; queuing; router; ticket assignment; Bandwidth; Channel allocation; Computer science; Diffserv networks; Engineering profession; Exchange rates; Forward contracts; Intserv networks; Scalability; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

ISSN

0743-166X

Print_ISBN

0-7803-7476-2

Type

conf

DOI

10.1109/INFCOM.2002.1019418

Filename

1019418