Scheduling file transfers in a distributed network

Authors:
E. G. Coffman, Jr.;M. R. Garey;D. S. Johnson;A. S. LaPaugh
Affiliations:
-;-;-;-
Venue:
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Year:
1983

Citing 3
Cited 2

Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graphs and Hypergraphs

Graphs and Hypergraphs

Flow scheduling and endpoint rate control in GridNetworks

Future Generation Computer Systems
Mitigating interference in a network measurement service

Proceedings of the Nineteenth International Workshop on Quality of Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a problem of scheduling file transfers in a network so as to minimize overall finishing time, which we formalize as a problem of scheduling the edges of a weighted multigraph. Although the general problem is NP-complete, we identify polynomial time solvable special eases and derive good performance bounds for several natural approximation algorithms. The above results assume the existence of a central controller, but we also show how the approximation algorithms, along with their performance guarantees, can be adapted to a distributed regime.