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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationProceedings - IEEE INFOCOM
Pages1650-1659
Number of pages10
Volume3
DOIs
Publication statusPublished - 2002
Externally publishedYes
EventIEEE Infocom 2002 - New York, NY, United States
Duration: Jun 23 2002Jun 27 2002

Other

OtherIEEE Infocom 2002
CountryUnited States
CityNew York, NY
Period6/23/026/27/02

    Fingerprint

Keywords

  • Flow control
  • Quality of service
  • Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Zhang, M., Wang, R., Peterson, L. L., & Krishnamurthy, A. (2002). Probabilistic packet scheduling: Achieving proportional share bandwidth allocation for TCP flows. In Proceedings - IEEE INFOCOM (Vol. 3, pp. 1650-1659) https://doi.org/10.1109/INFCOM.2002.1019418