Fast, fair, and frugal bandwidth allocation in ATM networks

Yair Bartal*, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

8 Scopus citations

Abstract

A frugal resource management (RM) cell protocol for available bit rate (ABR) that matches the convergence time of the fastest known non-frugal control for asynchronous transfer mode (ATM) networks is presented. Protocols that converge in a linear number of maximum roundtrip times require RM cell processing that is linear in the number of sessions at a switch. A second type of ABR traffic is the minimum cell rate (MCR) type, where every session can specify a minimum amount of bandwidth. The maximum fair allocation should then respect these MCR requests. In line with this, a first frugal RM cell protocol for MCR is given which achieves a quadratic convergence rate.

Original languageEnglish
Pages92-101
Number of pages10
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: 17 Jan 199919 Jan 1999

Conference

ConferenceProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period17/01/9919/01/99

Fingerprint

Dive into the research topics of 'Fast, fair, and frugal bandwidth allocation in ATM networks'. Together they form a unique fingerprint.

Cite this