Generalized max-min rate allocation: Theory and a simple implementation

Yiwei Thomas Hou, Shivendra Panwar, Henry Tzeng

Research output: Contribution to journalArticle

Abstract

An important concept in the available bit rate (ABR) service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each flow. Due to the MCR and PCR requirements, the well-known max-min rate allocation policy no longer suffices to determine the rate allocation for each flow since it does not support either MCR or PCR. In this paper, we present a generalized max-min (GMM) rate allocation policy, which supports both the MCR and PCR requirements for each flow. Furthermore, a simple distributed algorithm using the ABR flow control protocol is developed to achieve the GMM rate allocation in a distributed network environment. The effectiveness of this distributed algorithm is demonstrated by simulation results.

Original languageEnglish (US)
Pages (from-to)277-286
Number of pages10
JournalJournal of Communications and Networks
Volume2
Issue number3
StatePublished - Sep 2000

Fingerprint

Parallel algorithms
Flow control
Network protocols

Keywords

  • Available bit rate
  • Flow control
  • Max-min rate allocation
  • Minimum rate
  • Peak rate

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Generalized max-min rate allocation : Theory and a simple implementation. / Hou, Yiwei Thomas; Panwar, Shivendra; Tzeng, Henry.

In: Journal of Communications and Networks, Vol. 2, No. 3, 09.2000, p. 277-286.

Research output: Contribution to journalArticle

@article{7c473624f9f743738d574ee4ddeafccb,
title = "Generalized max-min rate allocation: Theory and a simple implementation",
abstract = "An important concept in the available bit rate (ABR) service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each flow. Due to the MCR and PCR requirements, the well-known max-min rate allocation policy no longer suffices to determine the rate allocation for each flow since it does not support either MCR or PCR. In this paper, we present a generalized max-min (GMM) rate allocation policy, which supports both the MCR and PCR requirements for each flow. Furthermore, a simple distributed algorithm using the ABR flow control protocol is developed to achieve the GMM rate allocation in a distributed network environment. The effectiveness of this distributed algorithm is demonstrated by simulation results.",
keywords = "Available bit rate, Flow control, Max-min rate allocation, Minimum rate, Peak rate",
author = "Hou, {Yiwei Thomas} and Shivendra Panwar and Henry Tzeng",
year = "2000",
month = "9",
language = "English (US)",
volume = "2",
pages = "277--286",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "3",

}

TY - JOUR

T1 - Generalized max-min rate allocation

T2 - Theory and a simple implementation

AU - Hou, Yiwei Thomas

AU - Panwar, Shivendra

AU - Tzeng, Henry

PY - 2000/9

Y1 - 2000/9

N2 - An important concept in the available bit rate (ABR) service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each flow. Due to the MCR and PCR requirements, the well-known max-min rate allocation policy no longer suffices to determine the rate allocation for each flow since it does not support either MCR or PCR. In this paper, we present a generalized max-min (GMM) rate allocation policy, which supports both the MCR and PCR requirements for each flow. Furthermore, a simple distributed algorithm using the ABR flow control protocol is developed to achieve the GMM rate allocation in a distributed network environment. The effectiveness of this distributed algorithm is demonstrated by simulation results.

AB - An important concept in the available bit rate (ABR) service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each flow. Due to the MCR and PCR requirements, the well-known max-min rate allocation policy no longer suffices to determine the rate allocation for each flow since it does not support either MCR or PCR. In this paper, we present a generalized max-min (GMM) rate allocation policy, which supports both the MCR and PCR requirements for each flow. Furthermore, a simple distributed algorithm using the ABR flow control protocol is developed to achieve the GMM rate allocation in a distributed network environment. The effectiveness of this distributed algorithm is demonstrated by simulation results.

KW - Available bit rate

KW - Flow control

KW - Max-min rate allocation

KW - Minimum rate

KW - Peak rate

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

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

M3 - Article

VL - 2

SP - 277

EP - 286

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 3

ER -