William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/35.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: One of the central tasks of networking is packet-routing when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual sub-problems: path selection and congestion resolution along the selected paths. However, this conceptual separation has a serious drawback: each packet's path is fixed at the source and cannot be modified adaptively en-route when traffic conditions change. The problem is especially severe when packet... (Update)
Similar documents based on text: More All
0.9: Adaptive Packet Routing for Bursty Adversarial Traffic - Aiello, Kushilevitz.. (1998) (Correct)
0.5: Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999) (Correct)
0.4: Log-Space Polynomial End-to-End Communication - Kushilevitz, Ostrovsky, Rosen (1995) (Correct)
Related documents from co-citation: More All
24: Universal stability results for greedy contentionresolution protocols - Andrews, Awerbuch et al. - 1996
22: Stability of Adaptive and Non-Adaptive packet Routing Policies in Adversarial Qu.. - Gamarnik - 1999
21: Stability of adversarial queues via fluid models - Gamarnik - 1998
BibTeX entry: (Update)
W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Ros'en. Adaptive packet routing for bursty adversarial traffic. in Proc. of the 30th Annual ACM Symp. on Theory of Computing, pages 359--368, May 1998. http://citeseer.ist.psu.edu/aiello98adaptive.html More
@inproceedings{ aiello98adaptive,
author = "William Aiello and Eyal Kushilevitz and Rafail Ostrovsky and Adi Ros{\'e}n",
title = "Adaptive packet routing for bursty adversarial traffic",
pages = "359--368",
year = "1998",
url = "citeseer.ist.psu.edu/aiello98adaptive.html" }
Citations (may not include all citations):1312 A Generalized Processor Sharing Approach to Flow Control in .. (context) - Parekh, Gallager - 1993
1312 A Generalized Processor Sharing Approach to Flow Control in .. (context) - Parekh, Gallager - 1994
199 A Calculus for Network Delay, Part I: Network Elements in Is.. (context) - Cruz - 1991
133 Throughput Competitive On-Line Routing - Awerbuch, Azar et al. - 1993
100 A Calculus for Network Delay, Part II: Network Analysis (context) - Cruz - 1991
90 Universal Stability Results for Greedy Contention-Resolution.. - Andrews, Awerbuch et al. - 1996
72 Disjoint Paths in Densely Embedded Graphs - Kleinberg, Tardos - 1995
69 Competitive Routing of Virtual Circuits with Unknown Duratio.. - Awerbuch, Azar et al. - 1994
58 Local Control Packet Switching Algorithm (context) - Ostrovsky, Rabani - 1997
56 Methods for message routing in parallel machines (context) - Leighton - 1992
55 Distributed packet switching in arbitrary networks - Rabani, Tardos - 1996
45 Improved Approximation Algorithms for the Multicommodity Flo.. - Awerbuch, Leighton - 1994
45 Conductance and Convergence of Markov Chains---A Combinatori.. (context) - Mihail - 1989
45 The Efficiency of Greedy Routing in Hypercubes and Butterfli.. (context) - Stamoulis, Tsitsiklis - 1994
42 Universal algorithms for store-and-forward and wormhole rout.. - Cypher, auf et al. - 1996
41 A Simple Local-Control Approximation Algorithm for Multicomm.. - Awerbuch, Leighton - 1993
36 A constant-factor approximation algorithm for packet routing.. - Srinivasan, Teo - 1997
35 Tight Analyses of Two Local Load Balancing Algorithms - Ghosh, Leighton et al. - 1995
34 Approximate Load Balancing on Dynamic and Asynchronous Netwo.. - Aiello, Awerbuch et al. - 1992
32 Adversarial Queuing Theory - Borodin, Kleinberg et al. - 1996
31 Dynamic Deflection Routing on Arrays (context) - Broder, Upfal - 1996
31 Universal Continuous Routing Strategies - Scheideler, Vocking - 1996
31 Routing and Admission Control in General Topology Networks w.. - Kamath, Palmon et al. - 1996
29 Greedy Packet Scheduling on Shortest Paths - Mansour, Patt-Shamir - 1993
29 A General Approach to Dynamic Packet Routing with Bounded Bu.. - Broder, Frieze et al. - 1996
26 Dynamic Load Balancing on Parallel and Distributed Networks .. (context) - Ghosh, Muthukrishnan - 1994
22 End-to-End Communication with Polynomial Overhead (context) - Awerbuch, Mansour et al. - 1989
19 General Dynamic Routing with Per-Packet Delay Guarantees of .. - Andrews, Fern'andez et al. - 1997
12 personal communication (context) - Leighton - 1998
11 Slide---A Technique for Communication in Unreliable Networks (context) - Afek, Gafni et al. - 1992
11 Slide - The Key to Polynomial End-to-End Communication - Afek, Awerbuch et al. - 1997
10 A packet routing protocol for arbitrary networks - auf, Vocking
9 Queuing Analysis of Oblivious Packet-Routing Algorithms (context) - Harchol-Balter, Black - 1994
9 Bounding Delays in Packet Routing Networks (context) - Harchol-Balter, Wolfe - 1995
7 Packet Routing and Job-Shop Scheduling in O(congestion+dilat.. - Leighton, Maggs et al. - 1994
3 Fast Algorithms for Finding O(Congestion+Dilation) Packet Ro.. (context) - Leighton, Maggs et al.
The graph only includes citing articles where the year of publication is known.
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