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

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationIEEE International Conference on Communications
PublisherIEEE
Pages1411-1416
Number of pages6
Volume3
StatePublished - 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

Frequency allocation
Automatic teller machines
Heuristic algorithms
Local area networks
Topology
Bandwidth

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hou, Y. T., Tzeng, H. H. Y., Panwar, S., & Kumar, V. P. (1997). Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations. In IEEE International Conference on Communications (Vol. 3, pp. 1411-1416). IEEE.

Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations. / Hou, Yiwei Thomas; Tzeng, Henry H Y; Panwar, Shivendra; Kumar, Vijay P.

IEEE International Conference on Communications. Vol. 3 IEEE, 1997. p. 1411-1416.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hou, YT, Tzeng, HHY, Panwar, S & Kumar, VP 1997, Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations. in IEEE International Conference on Communications. vol. 3, IEEE, pp. 1411-1416, Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3), Montreal, Can, 6/8/97.
Hou YT, Tzeng HHY, Panwar S, Kumar VP. Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations. In IEEE International Conference on Communications. Vol. 3. IEEE. 1997. p. 1411-1416
Hou, Yiwei Thomas ; Tzeng, Henry H Y ; Panwar, Shivendra ; Kumar, Vijay P. / Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations. IEEE International Conference on Communications. Vol. 3 IEEE, 1997. pp. 1411-1416
@inproceedings{b1873794e5b74bef914783643cdf2e01,
title = "Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations",
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.",
author = "Hou, {Yiwei Thomas} and Tzeng, {Henry H Y} and Shivendra Panwar and Kumar, {Vijay P.}",
year = "1997",
language = "English (US)",
volume = "3",
pages = "1411--1416",
booktitle = "IEEE International Conference on Communications",
publisher = "IEEE",

}

TY - GEN

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

AU - Hou, Yiwei Thomas

AU - Tzeng, Henry H Y

AU - Panwar, Shivendra

AU - Kumar, Vijay P.

PY - 1997

Y1 - 1997

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

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

UR - http://www.scopus.com/inward/record.url?scp=0030703789&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030703789&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3

SP - 1411

EP - 1416

BT - IEEE International Conference on Communications

PB - IEEE

ER -