Achieving Max-Min Fairness by Decentralization for the ABR Traffic Control in ATM Networks

スポンサーリンク

概要

• 論文の詳細を見る

• 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-rain fairness and develop an efficient algorithm with theoretical justification to determine the optimal rate vector.

• 社団法人電子情報通信学会の論文
• 2001-08-01

著者

• Rhee S

  Kwangwoon Univ. Seoul Kor

• Rhee Seung

  School Of Electronics Engineering Kwangwoon University

• KONSTANTOPOULOS Takis

  ECE Department, University of Texas

• Konstantopoulos Takis

  Ece Department University Of Texas

• RHEE Seung

  School of Electronic Engineering, Kwangwoon University

関連論文

• Dynamic Capacity Resizing for Fair Bandwidth Sharing in Virtual Private Networks (Network)
• Simulation-Based Analysis of DoS Attacks in Wireless Ad Hoc Networks(Application Information Security)
• Achieving Max-Min Fairness by Decentralization for the ABR Traffic Control in ATM Networks

スポンサーリンク