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

James Aspnes, Yossi Azar, Amos Fiat, Serge Plotkin, Orli Waarts

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-to-point and multicast) where the goal is to route all requests while minimizing the required bandwidth. We concentrate on the case of permanent virtual circuits (i.e., once a circuit is established, it exists forever), and describe an algorithm that achieves an O(log n) competitive ratio with respect to maximum congestion, where n 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 O(log n) factor. We also show that this result is tight, that is, for any on-line algorithm there exists a scenario in which Ω(log n) 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 related machines case, we describe the first algorithm that achieves constant competitive ratio. For the unrelated case (with n machines), we describe a new method that yields O(log n)-competitive algorithm. This stands in contrast to the natural greedy approach, whose competitive ratio is exactly n.

Original languageEnglish
Pages (from-to)486-504
Number of pages19
JournalJournal of the ACM
Volume44
Issue number3
DOIs
StatePublished - May 1997

Keywords

  • Algorithms
  • High-speed networks
  • On-line algorithms
  • Optimization
  • Routing
  • Theory

Fingerprint

Dive into the research topics of 'On-line routing of virtual circuits with applications to load balancing and machine scheduling'. Together they form a unique fingerprint.

Cite this