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 (US) |
|---|---|
| Pages | 92-101 |
| Number of pages | 10 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: Jan 17 1999 → Jan 19 1999 |
Other
| Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Baltimore, MD, USA |
| Period | 1/17/99 → 1/19/99 |
ASJC Scopus subject areas
- Software
- General Mathematics