Least Square Approach to Multi-Path Maxmin Rate Allocation

Author

Tsai, Dan-Han ; Liau, Thomas C. ; Tsai, Wei K.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA

Volume

1

fYear

2006

fDate

Sept. 2006

Firstpage

1

Lastpage

6

Abstract

The maxmin fair bandwidth allocation has been proposed as a flow control mechanism for managing the data traffic in connection-oriented networks. This paper devises a fast convergence algorithm based on the least square approach to solve multi-level multi-path maxmin problems. We prove that the least square result obtained by our method converges to the optimal solution which is multi-level multi-path maxmin. Our approach is the only known algorithm that can achieve lexicographical separation among the many maxmin levels

Keywords

bandwidth allocation; convergence of numerical methods; least squares approximations; minimax techniques; telecommunication congestion control; telecommunication network management; telecommunication traffic; bandwidth allocation; connection-oriented networks; convergence algorithm; data traffic; flow control mechanism; least square approach; lexicographical separation; multipath maxmin rate allocation; Bandwidth; Channel allocation; Communication system traffic control; Least squares methods; Telecommunication traffic; Virtual colonoscopy; flow control; maxmin; multiple paths;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 2006. ICON '06. 14th IEEE International Conference on

Conference_Location

Singapore

ISSN

1556-6463

Print_ISBN

0-7803-9746-0

Type

conf

DOI

10.1109/ICON.2006.302571

Filename

4087671