See this document in CiteSeerX!

Competitive Routing of Virtual Circuits with Unknown Duration (1995)  (Make Corrections)  (69 citations)
Baruch Awerbuch, Yossi Azar, Serge Plotkin, Orli Waarts
SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)



  Home/Search   Context   Related

 
View or download:
math.tau.ac.il/~azar/reroute.ps.gz
stanford.edu/plotkin/reroute.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  toronto.edu/~we...avivpapers.out (more)
From:  umass.edu/~datta/Course
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we present a strategy to route unknown duration virtual circuits in a highspeed communication network. Previous work on virtual circuit routing concentrated on the case where the call duration is known in advance. We show that by allowing O(logn) reroutes per call, we can achieve O(logn) competitive ratio with respect to the maximum load (congestion) for the unknown duration case, were n is the number of nodes in the network. This is in contrast to the\Omega\Gamma 4 p n) lower... (Update)

Cited by:   More
Constant Factor Bounds for On-line Load Balancing on Related.. - Andrews   (Correct)
Improved Bounds for On-line Load Balancing - Matthew Andrews Andrews (1996)   (Correct)
Adaptive Packet Routing for Bursty Adversarial Traffic - Aiello, Kushilevitz.. (1998)   (Correct)

Active bibliography (related documents):   More   All
0.1:   On-Line Routing of Virtual Circuits with.. - Aspnes, Azar.. (1997)   (Correct)
0.1:   Competitive Routing of Virtual Circuits with Unknown Duration - Awerbuch (1994)   (Correct)
0.1:   On-line Load Balancing of Temporary Tasks - Azar, Kalyanasundaram, Plotkin, .. (1993)   (Correct)

Similar documents based on text:   More   All
0.2:   StUSPACE(log n) \subseteq DSPACE(log² n/ log log n) - Allender, Lange   (Correct)
0.2:   Fast Broadcast in High Speed Networks - Gopal, Gopal, Kutten   (Correct)
0.2:   RUSPACE(log n) \subseteq DSPACE(log² n/log log n) - Allender, Lange   (Correct)

Related documents from co-citation:   More   All
39:   Throughput competitive on-line routing - Awerbuch, Azar et al. - 1993
31:   line load balancing - Azar, Broder et al. - 1992
30:   Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985

BibTeX entry:   (Update)

B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proceedings of 5th ACM/SIAM Symposium on Discrete Algorithms, pages 321--327, 1994. http://citeseer.ist.psu.edu/article/awerbuch95competitive.html   More

@inproceedings{ awerbuch94competitive,
    author = "Awerbuch and Azar and Plotkin and Waarts",
    title = "Competitive Routing of Virtual Circuits with Unknown Duration",
    booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
    year = "1994",
    url = "citeseer.ist.psu.edu/article/awerbuch95competitive.html" }
Citations (may not include all citations):
488   Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
170   Bounds for certain multiprocessing anomalies (context) - Graham - 1966
133   Throughput-competitive on-line routing - Awerbuch, Azar et al.
109   line load balancing with applications to machine scheduling .. (context) - Aspnes, Azar et al. - 1993
98   New algorithms for an ancient scheduling problem - Bartal, Fiat et al. - 1992
74   line load balancing - Azar, Broder et al. - 1992
62   Efficient on-line call control algorithms - Garay, Gopal et al. - 1993
61   The competitiveness of on-line assignment - Azar, Naor et al. - 1992
58   An optimal algorithm for on-line bipartite matching (context) - Karp, Vazirani et al. - 1990
54   Call preemption in communication networks (context) - Garay, Gopal - 1992
42   line load balancing of temporary tasks - Azar, Kalyanasundaram et al. - 1993
31   Online load balancing and network flow - Phillips, Westbrook - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.toronto.edu/~websql/demo-cascon/qtelaviv-papers.out.html):   More
Balanced Allocations - Azar, Broder, Karlin, Upfal (1994)   (Correct)
On-Line Routing of Virtual Circuits with.. - Aspnes, Azar.. (1997)   (Correct)
On-line Load Balancing - Azar, Broder, Karlin (1992)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC