On-Line Resource Management with Application to Routing and Scheduling

Abstract. We propose a framework to model on-line resource management problems based on an on-line version of positive linear programming. We consider both min cost problems and max benefit problems and propose logarithmic competitive algorithms that are optimal up to a constant factor. The proposed framework provides a general methodology that applies to a wide class of on-line problems: shop scheduling, packet routing, and in general a class of packing and assignment problems. Previously studied problems as on-line multiprocessor scheduling and on-line virtual circuit routing can also be modeled within this framework.

[1]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.

[2]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[3]  Jan Karel Lenstra,et al.  An introduction to multiprocessor scheduling : (preprint) , 1980 .

[4]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[5]  Yossi Azar,et al.  On-line choice of on-line algorithms , 1993, SODA '93.

[6]  Richard M. Karp,et al.  On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? , 1992, IFIP Congress.

[7]  Leen Stougie,et al.  Competitive Algorithms for the On-line Traveling Salesman , 1995, WADS.

[8]  Alok Aggarwal,et al.  Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.

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

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

[11]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[12]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[13]  Luca Cabibbo.  Querying and Updating Complex-Object Databases , 1996 .

[14]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[15]  Pierre A. Humblet,et al.  On the number of wavelengths and switches in all-optical networks , 1994, IEEE Trans. Commun..

[16]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[17]  Greg N. Frederickson,et al.  Preemptive Ensemble Motion Planning on a Tree , 1992, SIAM J. Comput..

[18]  Amos Fiat,et al.  On Capital Investment , 1996, ICALP.

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

[20]  Gerhard J. Woeginger,et al.  An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..

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

[22]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[23]  Magnús M. Halldórsson,et al.  Lower bounds for on-line graph coloring , 1992, SODA '92.

[24]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[25]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[26]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1993, Theor. Comput. Sci..

[27]  Greg N. Frederickson.  A Note on the Complexity of a Simple Transportation Problem , 1993, SIAM J. Comput..

[28]  Allan Borodin,et al.  An optimal online algorithm for metrical task systems , 1987, STOC.

[29]  Leen Stougie,et al.  Serving Requests with On-line Routing , 1994, SWAT.

[30]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[31]  Yuval Rabani,et al.  Competitive k-server algorithms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[32]  Amos Fiat,et al.  Packet Routing via Min-Cost Circuit Routing , 1996, ISTCS.

[33]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[34]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[35]  Allan Borodin,et al.  On the power of randomization in online algorithms , 1990, STOC '90.

[36]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[37]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[38]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[39]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[40]  David R. Karger,et al.  A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[41]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.

[42]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[43]  Kavita Bala,et al.  Algorithms for routing in a linear lightwave network , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[44]  Ran El-Yaniv,et al.  The statistical adversary allows optimal money-making trading strategies , 1995, SODA '95.

[45]  Ran El-Yaniv,et al.  Competitive analysis of financial games , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[46]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

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

[48]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[49]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

[50]  Paul G. Spirakis,et al.  Randomized competitive algorithms for admission control in general networks , 1995, PODC '95.

[51]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[52]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[53]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[54]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[55]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..

[56]  David P. Williamson,et al.  On-Line Scheduling of Parallel Machines , 1990 .

[57]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[58]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[59]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

[61]  Ran Canetti,et al.  Bandwidth allocation with preemption , 1995, STOC '95.

[62]  Yossi Azar,et al.  On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[63]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[64]  Ran El-Yaniv,et al.  The mortgage problem , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[65]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[66]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[67]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[68]  Diego Calvanese,et al.  Unrestricted and finite model reasoning in class-based representation formalisms , 1996 .