Achieving Max-Min Fairness by Decentralization for the ABR Traffic Control in ATM Networks
Summary :
The available bit rate (ABR) is an ATM service category that provides an economical support of connections having vague requirements. An ABR session may specify its peak cell rate (PCR) and minimum cell rate (MCR), and available bandwidth is allocated to competing sessions based on the max-min policy. In this paper, we investigate the ABR traffic control from a different point of view: Based on the decentralized bandwidth allocation model studied in [9], we prove that the max-min rate vector is the equilibrium of a certain system of noncooperative optimizations. This interpretation suggests a new framework for ABR traffic control that allows the max-min optimality to be achieved and maintained by end-systems, and not by network switches. Moreover, in the discussion, we consider the constrained version of max-min fairness and develop an efficient algorithm with theoretical justification to determine the optimal rate vector.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E84-B No.8 pp.2249-2255
- Publication Date
- 2001/08/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seung Hyong RHEE, Takis KONSTANTOPOULOS, "Achieving Max-Min Fairness by Decentralization for the ABR Traffic Control in ATM Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 8, pp. 2249-2255, August 2001, doi: .
Abstract: The available bit rate (ABR) is an ATM service category that provides an economical support of connections having vague requirements. An ABR session may specify its peak cell rate (PCR) and minimum cell rate (MCR), and available bandwidth is allocated to competing sessions based on the max-min policy. In this paper, we investigate the ABR traffic control from a different point of view: Based on the decentralized bandwidth allocation model studied in [9], we prove that the max-min rate vector is the equilibrium of a certain system of noncooperative optimizations. This interpretation suggests a new framework for ABR traffic control that allows the max-min optimality to be achieved and maintained by end-systems, and not by network switches. Moreover, in the discussion, we consider the constrained version of max-min fairness and develop an efficient algorithm with theoretical justification to determine the optimal rate vector.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_8_2249/_p
Copy
@ARTICLE{e84-b_8_2249,
author={Seung Hyong RHEE, Takis KONSTANTOPOULOS, },
journal={IEICE TRANSACTIONS on Communications},
title={Achieving Max-Min Fairness by Decentralization for the ABR Traffic Control in ATM Networks},
year={2001},
volume={E84-B},
number={8},
pages={2249-2255},
abstract={The available bit rate (ABR) is an ATM service category that provides an economical support of connections having vague requirements. An ABR session may specify its peak cell rate (PCR) and minimum cell rate (MCR), and available bandwidth is allocated to competing sessions based on the max-min policy. In this paper, we investigate the ABR traffic control from a different point of view: Based on the decentralized bandwidth allocation model studied in [9], we prove that the max-min rate vector is the equilibrium of a certain system of noncooperative optimizations. This interpretation suggests a new framework for ABR traffic control that allows the max-min optimality to be achieved and maintained by end-systems, and not by network switches. Moreover, in the discussion, we consider the constrained version of max-min fairness and develop an efficient algorithm with theoretical justification to determine the optimal rate vector.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Achieving Max-Min Fairness by Decentralization for the ABR Traffic Control in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2249
EP - 2255
AU - Seung Hyong RHEE
AU - Takis KONSTANTOPOULOS
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2001
AB - The available bit rate (ABR) is an ATM service category that provides an economical support of connections having vague requirements. An ABR session may specify its peak cell rate (PCR) and minimum cell rate (MCR), and available bandwidth is allocated to competing sessions based on the max-min policy. In this paper, we investigate the ABR traffic control from a different point of view: Based on the decentralized bandwidth allocation model studied in [9], we prove that the max-min rate vector is the equilibrium of a certain system of noncooperative optimizations. This interpretation suggests a new framework for ABR traffic control that allows the max-min optimality to be achieved and maintained by end-systems, and not by network switches. Moreover, in the discussion, we consider the constrained version of max-min fairness and develop an efficient algorithm with theoretical justification to determine the optimal rate vector.
ER -
English
