Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.

[1]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[2]  Yossi Azar,et al.  Minimizing the flow time without migration , 1999, STOC '99.

[3]  Gerhard J. Woeginger,et al.  Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine , 1999, SIAM J. Comput..

[4]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[6]  Cynthia A. Phillips,et al.  Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.

[7]  M. Yung,et al.  E cient On-Line Call Control , 2008 .

[8]  Moti Yung,et al.  Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.

[9]  Rajmohan Rajaraman,et al.  Online scheduling to minimize average stretch , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Sanjeev Khanna,et al.  On multi-dimensional packing problems , 1999, SODA '99.

[11]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[12]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[13]  Daniel P. Siewiorek,et al.  Modeling multicomputer task allocation as a vector packing problem , 1996, Proceedings of 9th International Symposium on Systems Synthesis.

[14]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[15]  Éva Tardos,et al.  Scheduling data transfers in a network and the set scheduling problem , 1999, STOC '99.

[16]  Luca Becchetti,et al.  Scheduling to minimize average stretch without migration , 2000, SODA '00.

[17]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[18]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[19]  Jirí Sgall,et al.  Randomized on-line scheduling of parallel jobs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[20]  Anja Feldmann,et al.  Optimal On-Line Scheduling of Parallel Jobs with Dependencies , 1998, J. Comb. Optim..

[21]  Leah Epstein,et al.  Optimal Online Flow Time with Resource Augmentation , 2001, FCT.

[22]  Amos Fiat,et al.  Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.

[23]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[24]  Anja Feldmann,et al.  Optimal online scheduling of parallel jobs with dependencies , 1993, STOC.

[25]  Cynthia A. Phillips,et al.  Improved Scheduling Algorithms for Minsum Criteria , 1996, ICALP.

[26]  Rajmohan Rajaraman,et al.  Improved algorithms for stretch scheduling , 2002, SODA '02.

[27]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[28]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[29]  Y. Mansour,et al.  Eecient On-line Call Control Algorithms , 1993 .

[30]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[31]  Minos N. Garofalakis,et al.  Scheduling issues in multimedia query optimization , 1995, CSUR.

[32]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.