Design Methods for Utility Max-Min Fair Share Networks

Hiroyuki YOKOYAMA; Hajime NAKAMURA; Shinichi NOMOTO

Design Methods for Utility Max-Min Fair Share Networks

Hiroyuki YOKOYAMA, Hajime NAKAMURA, Shinichi NOMOTO

Full Text Views

0

Share
Cite this

Summary :

This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.10 pp.2922-2930

Publication Date: 2004/10/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Hiroyuki YOKOYAMA, Hajime NAKAMURA, Shinichi NOMOTO, "Design Methods for Utility Max-Min Fair Share Networks" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 10, pp. 2922-2930, October 2004, doi: .
Abstract: This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_10_2922/_p

Copy

@ARTICLE{e87-b_10_2922,
author={Hiroyuki YOKOYAMA, Hajime NAKAMURA, Shinichi NOMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={Design Methods for Utility Max-Min Fair Share Networks},
year={2004},
volume={E87-B},
number={10},
pages={2922-2930},
abstract={This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Design Methods for Utility Max-Min Fair Share Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2922
EP - 2930
AU - Hiroyuki YOKOYAMA
AU - Hajime NAKAMURA
AU - Shinichi NOMOTO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2004
AB - This paper proposes a bandwidth allocation algorithm and a demand accommodation algorithm guaranteeing utility max-min fairness under bandwidth constraints. We prove that the proposed algorithms can fairly split network resources among connections and achieve call admission control considering the fairness among different types of applications. We then formulate three different network design problems to maximize the total utility of all customers, the number of users accommodated in the network, and the average utility of the customers accommodated in the network. To solve the problems, we extend the conventional network design algorithms considering utility max-min fair share, and numerically evaluate and compare their performance. Finally, we summarize the best algorithms to design the utility max-min fair share networks considering the operation policy of network providers.
ER -