Weighted max-min fair rate allocation for available bit rate service

Y. T. Hou, H. H.Y. Tzeng, S. S. Panwar

Research output: Contribution to conferencePaper

Abstract

An important concept in the ABR service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each connection. Because of the MCR and PCR constraints, the classical max-min policy no longer suffices to determine rate allocation since it does not support either the MCR or the PCR. To support the MCR/PCR constraints for each connection, we present the Weighted Max-Min (WMM) policy, with the 'weight' of each connection being its MCR requirement (we assume a nonzero MCR for each ABR connection). Furthermore, an explicit-rate (ER) based ABR switch algorithm is developed to achieve the WMM policy in the distributed network environment. Our ABR algorithm is proven to converge to the WMM policy through distributed and asynchronous iterations. The performance of our ABR algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the ATM Forum.

Original languageEnglish (US)
Pages492-497
Number of pages6
StatePublished - 1997
EventProceedings of the 1997 IEEE Global Telecommunications Mini-Conference - Phoenix, AZ, USA
Duration: Nov 3 1997Nov 8 1997

Other

OtherProceedings of the 1997 IEEE Global Telecommunications Mini-Conference
CityPhoenix, AZ, USA
Period11/3/9711/8/97

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'Weighted max-min fair rate allocation for available bit rate service'. Together they form a unique fingerprint.

  • Cite this

    Hou, Y. T., Tzeng, H. H. Y., & Panwar, S. S. (1997). Weighted max-min fair rate allocation for available bit rate service. 492-497. Paper presented at Proceedings of the 1997 IEEE Global Telecommunications Mini-Conference, Phoenix, AZ, USA, .