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

Ming Zhang, Randolph Wang, Larry Peterson, Arvind Krishnamurthy

Research output: Contribution to journalArticle

15 Scopus citations

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 accomodates flows that cross multiple currency domains.

Original languageEnglish (US)
Article number55
Pages (from-to)1650-1659
Number of pages10
JournalProceedings - IEEE INFOCOM
Volume3
DOIs
StatePublished - Jan 1 2002

Keywords

  • Flow control
  • Quality of service
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Probabilistic packet scheduling: Achieving proportional share bandwidth allocation for TCP flows'. Together they form a unique fingerprint.

  • Cite this