QoS Aware and Fair Resource Allocation Scheme in Transport Networks

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