Back to Search Start Over

Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths

Authors :
Sambuddha Roy
Anamitra R. Choudhury
Yogish Sabharwal
Venkatesan T. Chakaravarthy
Source :
IPDPS
Publication Year :
2013
Publisher :
IEEE, 2013.

Abstract

In this paper we study the unsplittable flow problem (UFP) on tree networks in a distributed setting. We have a set of processors (or agents) and a set of tree networks defined over some vertex set. Each processor can access a subset of the tree networks. Each edge in each of the tree networks is associated with a capacity. Each processor has a demand specified as a pair of vertices u and v, along with a profit and a height; the processor wishes to send data between u and v and requires bandwidth equal to its height. Towards that goal, the processor needs to select a tree network accessible to it. A feasible solution selects a subset of demands and schedules each selected demand on a tree network accessible to the processor owning the demand. The requirement is that for any tree network and any edge in the network, the sum of heights of demands scheduled on the network and passing through the edge must not exceed the capacity offered by the edge. The goal is to output a solution having the maximum aggregate profit. Prior work has addressed the above problem in a distributed setting for the special case where all the edge capacities are uniform, say one unit. The main contributions of this paper is to address the general case where the edge capacities can be non-uniform and arbitrary. For this case, we present distributed algorithms with poly-logarithmic approximation ratio.

Details

Database :
OpenAIRE
Journal :
2013 IEEE 27th International Symposium on Parallel and Distributed Processing
Accession number :
edsair.doi...........69132627e5a9c23b57d8992e193ce123
Full Text :
https://doi.org/10.1109/ipdps.2013.92