Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback

Yiwei Thomas Hou, Henry H Y Tzeng, Shivendra Panwar

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

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 languageEnglish (US)
Title of host publicationInternational Conference on Multimedia Computing and Systems -Proceedings
PublisherIEEE
Pages20-27
Number of pages8
StatePublished - 1997
EventProceedings of the 1997 IEEE International Conference on Multimedia Computing and Systems, ICMCS - Ottawa, Ont, Can
Duration: Jun 3 1997Jun 6 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Multimedia Computing and Systems, ICMCS
CityOttawa, Ont, Can
Period6/3/976/6/97

Fingerprint

Feedback
Automatic teller machines
Frequency allocation
Switches
Bandwidth

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Hou, Y. T., Tzeng, H. H. Y., & Panwar, S. (1997). Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback. In International Conference on Multimedia Computing and Systems -Proceedings (pp. 20-27). IEEE.

Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback. / Hou, Yiwei Thomas; Tzeng, Henry H Y; Panwar, Shivendra.

International Conference on Multimedia Computing and Systems -Proceedings. IEEE, 1997. p. 20-27.

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

Hou, YT, Tzeng, HHY & Panwar, S 1997, Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback. in International Conference on Multimedia Computing and Systems -Proceedings. IEEE, pp. 20-27, Proceedings of the 1997 IEEE International Conference on Multimedia Computing and Systems, ICMCS, Ottawa, Ont, Can, 6/3/97.
Hou YT, Tzeng HHY, Panwar S. Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback. In International Conference on Multimedia Computing and Systems -Proceedings. IEEE. 1997. p. 20-27
Hou, Yiwei Thomas ; Tzeng, Henry H Y ; Panwar, Shivendra. / Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback. International Conference on Multimedia Computing and Systems -Proceedings. IEEE, 1997. pp. 20-27
@inproceedings{5561b79e32c942bdadcdd180c1ba6e0b,
title = "Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback",
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.",
author = "Hou, {Yiwei Thomas} and Tzeng, {Henry H Y} and Shivendra Panwar",
year = "1997",
language = "English (US)",
pages = "20--27",
booktitle = "International Conference on Multimedia Computing and Systems -Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback

AU - Hou, Yiwei Thomas

AU - Tzeng, Henry H Y

AU - Panwar, Shivendra

PY - 1997

Y1 - 1997

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

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

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

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

M3 - Conference contribution

SP - 20

EP - 27

BT - International Conference on Multimedia Computing and Systems -Proceedings

PB - IEEE

ER -