Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations

Yiwei Thomas Hou, Henry H.Y. Tzeng, Shivendra S. Panwar, Vijay P. Kumar

Research output: Contribution to conferencePaper

Abstract

A novel concept in available bit rate (ABE) service model as defined by the ATM Forum is the minimum cell rate (MCR) bandwidth guarantee for each connection. In this paper, we present a network bandwidth allocation policy to support each ABR connection's MCR requirement, as well as its peak cell rate (PCR) constraint. Furthermore, we develop two explicit-rate (ER) based ABR algorithms consistent with the ATM Forum ABR traffic management framework to achieve this rate allocation policy. The first ABR implementation is a simple heuristic algorithm which does not require per-VC accounting. It requires minimal implementation complexity and offers satisfactory performance in a LAN environment. The second ABR implementation employs per-VC accounting and is proven to converge to our rate allocation policy for any network topology and any set of link distances.

Original languageEnglish (US)
Pages1411-1416
Number of pages6
StatePublished - Jan 1 1997
EventProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can
Duration: Jun 8 1997Jun 12 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3)
CityMontreal, Can
Period6/8/976/12/97

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Hou, Y. T., Tzeng, H. H. Y., Panwar, S. S., & Kumar, V. P. (1997). Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations. 1411-1416. Paper presented at Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3), Montreal, Can, .