On-line routing of virtual circuits with applications to load balancing and machine scheduling

In this paper we study the problem of on-line allocation of routes to virtual circuits (both <italic>point-to-point</italic> and <italic>multicast</italic>) where the goal is to route all requests while minimizing the required bandwidth. We concentrate on the case of <italic>Permanent</italic> virtual circuits (i.e., once a circuit is established it exists forever), and describe an algorithm that achieves on <italic>O</italic> (log <italic>n</italic>) competitive ratio with respect to maximum congestin, where <italic>n</italic>is the number of nodes in the network. Informally, our results show that instead of knowing all of the future requests, it is sufficient to increase the bandwidth of the communication links by an <italic>O</italic> (log <italic>n</italic>) factor. We also show that this result is tight, that is, for any on-line algorithm there exists a scenario in which ***(log <italic>n</italic>) increase in bandwidth is necessary in directed networks. We view virtual circuit routing as a generalization of an on-line load balancing problem, defined as follows: jobs arrive on line and each job must be assigned to one of the machines immediately upon arrival. Assigning a job to a machine increases the machine's load by an amount that depends both on the job and on the machine. The goal is to minimize the maximum load. For the <italic>related machines</italic> case, we describe the first algorithm that achieves constant competitive ratio. for the <italic>unrelated</italic> case (with <italic>n</italic>machines), we describe a new method that yields <italic>O</italic>(log<italic>n</italic>)-competitive algorithm. This stands in contrast to the natural greed approach, whose competitive ratio is exactly <italic>n</italic>. show that this result is tight, that is, for any on-line algorithm there exists a scenario in which ***(log <italic>n</italic>) increase in bandwidth is necessary in directed networks.

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

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

[4]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

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

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

[8]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[9]  Fillia Makedon,et al.  Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.

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

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

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

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

[14]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

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

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

[17]  Steven J. Phillips,et al.  Online load balancing and network flow , 1993, STOC.

[18]  Yossi Azar,et al.  Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

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

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

[22]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

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

[24]  B. Awerbuch,et al.  Load Balancing in the Lp Norm , 1995, FOCS 1995.

[25]  Ming-Yang Kao,et al.  Load balancing in the L/sub p/ norm , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[26]  David P. Williamson,et al.  Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..

[27]  David R. Karger,et al.  Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.

[28]  K. G. Ramakrishnan,et al.  On-line routing for permanent virtual circuits , 1995, Proceedings of INFOCOM'95.

[29]  Serge A. Plotkin Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

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

[31]  Yossi Azar,et al.  Competitive multicast routing , 1995, Wirel. Networks.

[32]  Yossi Azar On-line Load Balancing , 1996, Online Algorithms.

[33]  Serge A. Plotkin,et al.  Routing and admission control in general topology networks with Poisson arrivals , 1995, SODA '96.

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

[35]  Yuan Ma,et al.  An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration , 1997, Inf. Process. Lett..

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

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