Abstract
An important concept in the available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection (VC). Because of the MCR and PCR requirements, the well-known max-min fairness policy no longer suffices to determine rate allocation in the ABR service model. We introduce a network bandwidth assignment policy, MCRadd, which supports both the MCR and PCR requirements for each ABR virtual connection. A centralized algorithm is presented to compute network-wide bandwidth allocation to achieve this policy. Furthermore, an explicit-rate (ER) based ABR switch algorithm is developed to achieve the MCRadd policy in the distributed ABR environment and its convergence proof is also given. The performance of our ABR algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the ATM Forum.
Original language | English (US) |
---|---|
Pages | 20-27 |
Number of pages | 8 |
State | Published - 1997 |
Event | Proceedings of the 1997 IEEE International Conference on Multimedia Computing and Systems, ICMCS - Ottawa, Ont, Can Duration: Jun 3 1997 → Jun 6 1997 |
Other
Other | Proceedings of the 1997 IEEE International Conference on Multimedia Computing and Systems, ICMCS |
---|---|
City | Ottawa, Ont, Can |
Period | 6/3/97 → 6/6/97 |
ASJC Scopus subject areas
- General Computer Science
- General Engineering