On-line Resource Management with Applications to Routing and Scheduling

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.

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

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

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

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

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

[6]  Moti Yung,et al.  Efficient on-line call control algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[21]  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.

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

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

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

[25]  J. K. Lenstra,et al.  An introduction to multiprocessor scheduling , 1981 .

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

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