QoS Aware and Fair Resource Allocation Scheme in Transport Networks

Author

Bárász, Mihály ; Fekete, Zaolt ; Jüttner, Alpár ; Makai, Márton ; Szabó, Jácint

Author_Institution

Dept. of Oper. Res., Eotvos Univ., Budapest

Volume

3

fYear

2006

fDate

38869

Firstpage

239

Lastpage

242

Abstract

This paper presents a QoS aware fair routing and bandwidth management method for transport networks. We consider a variant of the maximum concurrent multicommodity flow problem where only paths of bounded length are allowed to carry flow. We show two possible approaches to the problem. First, we give a column generation method, where the Bellman-Ford algorithm provides the path of bounded length with minimum reduced cost. Then we present an epsi-approximation scheme to the problem, applying the method of Garg and Konemann with new ideas for speedup. Finally the computational experience is presented

Keywords

bandwidth allocation; quality of service; telecommunication network management; telecommunication network routing; Bellman-Ford algorithm; QoS aware fair routing; bandwidth management method; column generation method; epsi-approximation scheme; fair resource allocation scheme; maximum concurrent multicommodity flow problem; transport networks; Approximation algorithms; Bandwidth; Delay effects; Operations research; Polynomials; Resource management; Routing; Switches; Telecommunication traffic; Traffic control; QoS; approximation method; bandwidth management; faire routing; multicommodity flow;

fLanguage

English

Publisher

ieee

Conference_Titel

Transparent Optical Networks, 2006 International Conference on

Conference_Location

Nottingham

Print_ISBN

1-4244-0235-2

Electronic_ISBN

1-4244-0236-0

Type

conf

DOI

10.1109/ICTON.2006.248443

Filename

4013840