Rafail Ostrovsky, Yuval Rabani  Home/Search
Context
Related
| ucla.edu/~rafail/PUBLIC/27.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/~rafail/PUBLIC/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network, given any collection of packets with a specified route for each packet, there exists an "optimal" schedule for all these packets. That is, there exists a schedule of the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destinations in O(C + D) steps, where C is the "congestion" (i.e., the maximum number of paths that... (Update)
Similar documents (at the sentence level):
68.9%: Universal O(congestion + dilation + log^(1+ε) N).. - Ostrovsky, Rabani (Correct)
Active bibliography (related documents): More All
0.2: Adaptive Packet Routing for Bursty Adversarial Traffic - Aiello, Kushilevitz.. (1998) (Correct)
0.2: From Static to Dynamic Routing: Efficient Transformations.. - Scheideler, Vöcking (1999) (Correct)
0.2: Locally Efficient On-Line Strategies for Routing Packets.. - Berenbrink, Scheideler (1999) (Correct)
Similar documents based on text: More All
0.4: Distributed Packet Switching in Arbitrary Networks - Rabani, Tardos (1996) (Correct)
0.4: Polynomial Time Approximation Schemes for Geometric k-Clustering - Ostrovsky, Rabani (2000) (Correct)
0.3: Path Coloring on the Mesh - Rabani (1996) (Correct)
BibTeX entry: (Update)
@misc{ ostrovsky-universal,
author = "Rafail Ostrovsky and Yuval Rabani",
title = "Universal O(congestion + dilation + log^(1+ε) N) Local Control
Packet Switching Algorithms",
url = "citeseer.ist.psu.edu/724496.html" }
Citations (may not include all citations):1312 A generalized processor sharing approach to flow control in .. (context) - Parekh, Gallager - 1994
90 Universal stability results for greedy contention-resolution.. - Andrews, Awerbuch et al.
90 Adversarial queueing theory - Borodin, Kleinberg et al.
90 Randomized routing and sorting on fixed-connection networks - Leighton, Maggs et al. - 1994
80 Packet routing and job-shop scheduling in O (context) - Leighton, Maggs et al. - 1994
56 An Algorithmic Approach to the Lov'asz Local Lemma (context) - Beck - 1991
56 Methods for message routing in parallel machines (context) - Leighton
55 Distributed packet switching in arbitrary networks - Rabani, Tardos
53 Fast algorithms for finding O (context) - Leighton, Maggs et al. - 1996
46 Competitive routing of virtual circuits in ATM networks - Plotkin - 1995
42 Universal algorithms for store-and-forward and wormhole rout.. - Cypher, auf et al.
36 A constant-factor approximation algorithm for packet routing - Srinivasan, Teo
29 A general approach to dynamic packet routing with bounded bu.. - Broder, Frieze et al.
19 General dynamic routing with per-packet delay guarantees o - Andrews, Fern'andez et al. - 1997
10 A packet routing protocol for arbitrary networks - auf, Vocking - 1993
4 ATM UNI Specification Version (context) - Specification, Forum - 1993
2 Multimedia Networking: Applications and Challenges (context) - Gopal
Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html): More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (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