William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosen  Home/Search
Context Related
| cs.technion.ac.il/users/adir...AKOR2.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: cs.technion.ac.il/users/ad...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: William Aiello Rafail Ostrovsky Eyal Kushilevitz Adi Ros'en Abstract The combination of the buffer size of routers deployed in the Internet and the Internet traffic itself leads routinely to routers dropping packets. Motivated by this, we initiate the rigorous study of dynamic storeand -forward routing on arbitrary networks in a model in which dropped packets must explicitly be taken into account. To avoid the uncertainties of traffic modeling, we consider arbitrary traffic on the... (Update)
Cited by: More
Maximizing Profit in Overloaded Networks - Andrews (Correct)
Instability of FIFO at Arbitrarily Low Rates in the.. - Bhattacharjee, Goel (2002) (Correct)
Similar documents (at the sentence level):
55.6%: Dynamic Routing on Networks with Fixed-Size Buffers (Extended.. - Aiello, al. (2003) (Correct)
Active bibliography (related documents): More All
1.0: Adaptive Packet Routing for Bursty Adversarial Traffic - Aiello, Kushilevitz.. (1998) (Correct)
0.4: Tight Bounds for the Performance of Longest-In-System On Dags - Adler, Rosen (2002) (Correct)
0.3: Universal-Stability Results and Performance Bounds for - Greedy.. (Correct)
Similar documents based on text: More All
0.4: Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999) (Correct)
0.4: One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000) (Correct)
0.3: Characterizing Linear Size Circuits in Terms of Privacy - Kushilevitz, Ostrovsky.. (1996) (Correct)
Related documents from co-citation: More All
2: Instability of fifo in session-oriented networks - Andrews - 2000
2: Scheduling over a time-varying userdependent Proceedings of the 43rd Annual Symp.. (context) - Andrews, Zhang - 2002
2: IEEE Transaction of Information Theory (context) - Cruz, for et al. - 1991
BibTeX entry: (Update)
W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Rosen. Dynamic routing on networks with fixed-size buffers. ACMSIAM Symposium on Discrete Algorithms, pages 771--780, 2003. http://citeseer.ist.psu.edu/aiello03dynamic.html More
@misc{ aiello03dynamic,
author = "W. Aiello and R. Ostrovsky and E. Kushilevitz and A. Rosen",
title = "Dynamic routing on networks with fixed-size buffers",
text = "W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Rosen. Dynamic routing
on networks with fixed-size buffers. ACMSIAM Symposium on Discrete Algorithms,
pages 771--780, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/aiello03dynamic.html" }
Citations (may not include all citations):1312 A GeneralizedProcessor Sharing Approach to Flow Control in I.. (context) - Parekh, Gallager - 1994
1312 A GeneralizedProcessor Sharing Approach to Flow Control in I.. (context) - Parekh, Gallager - 1993
280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
133 Throughput Competitive On-Line Routing - Awerbuch, Azar et al. - 1993
90 Universal Stability Results for Greedy Contention-Resolution.. - Andrews, Awerbuch et al. - 1996
73 The chaotic nature of TCP congestion control - Veres, Boda - 2000
72 Disjoint Paths in Densely Embedded Graphs - Kleinberg, Tardos - 1995
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 The Efficiency of Greedy Routing in Hypercubes and Butterfli.. (context) - Stamoulis, Tsitsiklis - 1994
45 Conductance and Convergence of Markov Chains---A Combinatori.. (context) - Mihail - 1989
36 A constant-factor approximation algorithm for packet routing.. - Srinivasan, Teo - 1997
32 Adversarial Queuing Theory - Borodin, Kleinberg et al. - 1996
32 Bounds on the Greedy Routing Algorithm for Array Networks - Mitzenmacher - 1996
31 Universal Continuous Routing Strategies - Scheideler, Vocking - 1996
31 Dynamic Deflection Routing on Arrays (context) - Broder, Upfal - 1996
31 Stability of Adaptive and non-Adaptive Packet Routing in Adv.. - Gamarnik - 1999
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
23 Optimal smoothing schedules for real-time streams (context) - Mansour, Patt-Shamir et al. - 2000
9 Bounding Delays in Packet Routing Networks (context) - Harchol-Balter, Wolfe - 1995
9 Queuing Analysis of Oblivious Packet-Routing Algorithms (context) - Harchol-Balter, Black - 1994
8 Competitive Queue Policies for Differentiated Services - Aiello, Mansour et al. - 2000
7 Packet Routing and JobShop Scheduling in O(congestion+dilati.. - Leighton, Maggs et al. - 1994
7 Buffer overflow management in QoS switches - Kesselman, Lotker et al. - 2001
3 Fast Algorithms for Finding O(Congestion+Dilation) Packet Ro.. (context) - Leighton, Maggs et al.
3 The end of simple traffic models (context) - Partridge - 1993
1 Competitve buffer management for shared-memory switches (context) - Hahne, Kesselman et al. - 2001
http://www.cs.jhu.edu/scheideler
Documents on the same site (http://www.cs.technion.ac.il/users/adiro/publ/publ.html): More
Slide - The Key to Polynomial End-to-End Communication - Afek, Awerbuch, Gafni.. (1997) (Correct)
On Delivery Times in Packet Networks under Adversarial Traffic - Rosen, Tsirkin (2004) (Correct)
Randomized Robot Navigation Algorithms - Berman, Blum, Fiat, Karloff.. (1996) (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