Fast, fair, and frugal bandwidth allocation in ATM networks

Yair Bartal; Martin Farach-Colton; Shibu Yooseph; Lisa Zhang

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 conference › Paper › peer-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 language	English
Pages	92-101
Number of pages	10
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: 17 Jan 1999 → 19 Jan 1999

Conference

Conference	Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
City	Baltimore, MD, USA
Period	17/01/99 → 19/01/99

Cite this

@conference{33ca88e207f44ac4a2a5786b60218d23,

title = "Fast, fair, and frugal bandwidth allocation in ATM networks",

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.",

author = "Yair Bartal and Martin Farach-Colton and Shibu Yooseph and Lisa Zhang",

year = "1999",

language = "אנגלית",

pages = "92--101",

note = "Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 17-01-1999 Through 19-01-1999",

}

TY - CONF

T1 - Fast, fair, and frugal bandwidth allocation in ATM networks

AU - Bartal, Yair

AU - Farach-Colton, Martin

AU - Yooseph, Shibu

AU - Zhang, Lisa

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0032785025

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0032785025

SP - 92

EP - 101

T2 - Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 17 January 1999 through 19 January 1999

ER -

Fast, fair, and frugal bandwidth allocation in ATM networks

Abstract

Conference

Other files and links

Fingerprint

Cite this