Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism

Yiwei Thomas Hou, Henry H Y Tzeng, Shivendra Panwar

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

Abstract

We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized max-min (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the available bit rate (ABR) flow control mechanism. We give a proof that our distributed protocol converges to the GMM rate allocation through distributed and asynchronous iterations under any network configuration and any set of link distances.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages1366-1375
Number of pages10
Volume3
StatePublished - 1998
EventProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA
Duration: Mar 29 1998Apr 2 1998

Other

OtherProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3)
CitySan Francisco, CA, USA
Period3/29/984/2/98

Fingerprint

Flow control

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Hou, Y. T., Tzeng, H. H. Y., & Panwar, S. (1998). Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism. In Proceedings - IEEE INFOCOM (Vol. 3, pp. 1366-1375). IEEE.

Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism. / Hou, Yiwei Thomas; Tzeng, Henry H Y; Panwar, Shivendra.

Proceedings - IEEE INFOCOM. Vol. 3 IEEE, 1998. p. 1366-1375.

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

Hou, YT, Tzeng, HHY & Panwar, S 1998, Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism. in Proceedings - IEEE INFOCOM. vol. 3, IEEE, pp. 1366-1375, Proceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3), San Francisco, CA, USA, 3/29/98.
Hou YT, Tzeng HHY, Panwar S. Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism. In Proceedings - IEEE INFOCOM. Vol. 3. IEEE. 1998. p. 1366-1375
Hou, Yiwei Thomas ; Tzeng, Henry H Y ; Panwar, Shivendra. / Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism. Proceedings - IEEE INFOCOM. Vol. 3 IEEE, 1998. pp. 1366-1375
@inproceedings{3b5aad9eb00e4afabffeb9d25302f8a5,
title = "Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism",
abstract = "We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized max-min (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the available bit rate (ABR) flow control mechanism. We give a proof that our distributed protocol converges to the GMM rate allocation through distributed and asynchronous iterations under any network configuration and any set of link distances.",
author = "Hou, {Yiwei Thomas} and Tzeng, {Henry H Y} and Shivendra Panwar",
year = "1998",
language = "English (US)",
volume = "3",
pages = "1366--1375",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - GEN

T1 - Generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism

AU - Hou, Yiwei Thomas

AU - Tzeng, Henry H Y

AU - Panwar, Shivendra

PY - 1998

Y1 - 1998

N2 - We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized max-min (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the available bit rate (ABR) flow control mechanism. We give a proof that our distributed protocol converges to the GMM rate allocation through distributed and asynchronous iterations under any network configuration and any set of link distances.

AB - We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized max-min (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the available bit rate (ABR) flow control mechanism. We give a proof that our distributed protocol converges to the GMM rate allocation through distributed and asynchronous iterations under any network configuration and any set of link distances.

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

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

M3 - Conference contribution

VL - 3

SP - 1366

EP - 1375

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -