The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Open accessAbstract
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 on O (log n ) competitive ratio with respect to maximum congestin, 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 greed approach, whose competitive ratio is exactly n .
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Bounds for Certain Multiprocessing Anomalies
Graham, R. L. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb01709.x · Cited by 1,647
An approximate solution for the Steiner problem in graphs
Takahashi, H., & Matsuyama, A. (1980) · Mathematica japonica · Cited by 878
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988) · Algorithmica · doi:10.1007/bf01762111 · Cited by 631
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
(2023) · doi:10.1145/3564246 · Cited by 587
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Plotkin, S. A., Shmoys, D. B., & Tardos, É. (1995) · Mathematics of Operations Research · doi:10.1287/moor.20.2.257 · Cited by 542
Self-citationCompetitive algorithms for on-line problems
Manasse, M., McGeoch, L., & Sleator, D. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62243 · Cited by 358
An optimal on-line algorithm for metrical task system
Borodin, A., Linial, N., & Saks, M. E. (1992) · Journal of the ACM · doi:10.1145/146585.146588 · Cited by 326
The Competitiveness of On-Line Assignments
Azar, Y., Naor, J. S., & Rom, R. (1995) · Journal of Algorithms · doi:10.1006/jagm.1995.1008 · Cited by 241
Self-citationNew algorithms for an ancient scheduling problem
Bartal, Y., Fiat, A., Karloff, H. J., & Vohra, R. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129718 · Cited by 210
Self-citationFast approximation algorithms for multicommodity flow problems
Leighton, T., Stein, C., Makedon, F. S., Eva Tardos, D., Plotkin, S. A., & Tragoudas, S. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103425 · Cited by 201
Self-citationCompetitive routing of virtual circuits in ATM networks
Plotkin, S. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.400667 · Cited by 164
Self-citationAn optimal online algorithm for metrical task systems
Borodin, A., Linial, N., & Saks, M. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28435 · Cited by 164
Competitive non-preemptive call control
Awerbuch, B., Bartal, Y., Fiat, A., & Rosén, A. (1994) · doi:10.5555/314464.314510 · Cited by 144
Self-citationA Better Algorithm for an Ancient Scheduling Problem
Karger, D. R., Phillips, S. J., & Torng, E. K. (1996) · Journal of Algorithms · doi:10.1006/jagm.1996.0019 · Cited by 141
Fast Approximation Algorithms for Multicommodity Flow Problems
Leighton, T., Makedon, F. S., Plotkin, S. A., Stein, C., Eva Tardos, D., & Tragoudas, S. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1020 · Cited by 125
Self-citationOn-line admission control and circuit routing for high performance computing and communication
Awerbuch, B., Gawlick, R., Leighton, T., et al. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365675 · Cited by 100
On-Line Load Balancing of Temporary Tasks
Azar, Y., Kalyanasundaram, B., Plotkin, S. A., et al. (1997) · Journal of Algorithms · doi:10.1006/jagm.1995.0799 · Cited by 76
Self-citationCompetitive routing of virtual circuits with unknown duration
Awerbuch, B., Azar, Y., Plotkin, S. A., & Waarts, O. (1994) · Symposium on Discrete Algorithms · doi:10.5555/314464.314508 · Cited by 75
Self-citationScheduling parallel machines on-line
Shmoys, D. B., Wein, J. M., & Williamson, D. P. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185361 · Cited by 71
Routing and admission control in general topology networks with Poisson arrivals
Kamath, A. P., Palmon, O., & Plotkin, S. A. (1996) · doi:10.5555/313852.314073 · Cited by 61
Self-citationRouting and Admission Control in General Topology Networks
Gawlick, R., Kamath, A. P., Plotkin, S. A., et al. (1995) · Cited by 54
Self-citationAn improved lower bound for load balancing of tasks with unknown duration
Ma, Y., & Plotkin, S. A. (1997) · Information Processing Letters · doi:10.1016/s0020-0190(97)00085-9 · Cited by 16
Self-citation
Cited by
Online team formation in social networks
Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., & Leonardi, S. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187950 · Cited by 325
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Buchbinder, N., & (Seffi) Naor, J. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982179 · Cited by 260
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2012) · SIAM Journal on Discrete Mathematics · doi:10.1137/100794018 · Cited by 39
Metadata
- Authors
- Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O.
- Venue
- Journal of the ACM
- Published
- 1997-05
- Volume
- 44
- Issue
- 3
- Pages
- 486-504
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2156867662
- Cited by
- 330
- References
- 24
- FWCI
- 11.42
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.