Baruch Awerbuch, Petra Berenbrink, Andre Brinkmann, and Christian Scheidler, "Simple routing strategies for adversarial systems," in FOCS'01, Las Vegas, Nevada, October 2001, pp. 158--167. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Scheduling Over a Time-Varying User-Dependent Channel - With Applications To (Correct)
....where r i (t) 2 f0; 1g and show that if the objective is for each packet is to meet an assigned deadline then the Earliest Deadline First algorithm is not always optimal (in contrast to the constant rate case) Some recent papers have addressed the issue of routing in dynamic networks. In [7], Awerbuch et al. consider an adversarial network model where edges come and go over time. The aim is to route and schedule packets so that the system remains stable. A similar problem was considered by Anshelevich et al. in [6] However, there is an important distinction between our model and the ....
....et al. consider an adversarial network model where edges come and go over time. The aim is to route and schedule packets so that the system remains stable. A similar problem was considered by Anshelevich et al. in [6] However, there is an important distinction between our model and the models of [7, 6], in addition to the fact that their rates can only be 0 or 1. In [7, 6] each node can transmit packets to multiple neighbors simultaneously, assuming that the corresponding edges are present. However, in our model a basestation can only transmit to one mobile user at a time. This makes ....
[Article contains additional citation context not shown here]
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc of FOCS '01, pages 158 -- 167.
Stability of Load Balancing Algorithms in Dynamic.. - Anshelevich, Kempe (2002) (6 citations) (Correct)
....1 in the case where packets can be injected at multiple sources but are destined for a single sink; our algorithm is stable in a dynamic network model where edges can appear and disappear. A stable algorithm for this version of the problem was previously given in a recent paper of Awerbuch et al. [4], using a di#erent, but essentially more general, notion of a dynamic network; our proof, a direct adaption of the analysis of our single commodity load balancing algorithm, is considerably shorter and simpler. 2. SINGLE COMMODITY LOAD BALANCING In this section, we will study the load balancing ....
....commodity i exactly as their single commodity equivalents. The algorithm will now not only have to choose when to send a token across an edge, but also which of several available (and conflicting) kinds of tokens to send. Our class of algorithms is practically identical to the one from [2] and [4], and can be formalized as follows: Algorithm MCLB# At each time t, for each edge e = u, v) Choose i to maximize h (i) t (u) h (i) t (v) If h (i) t (u) # h (i) t (v) #, then send a token of commodity i from u to v. If h (i) t (v) # h (i) t (u) #, then send a ....
[Article contains additional citation context not shown here]
B. Awerbuch, P. Berenbrink, A. Brinkmann and C. Scheideler. "Simple routing strategies for adversarial systems," Proc. IEEE Symp. on Foundations of Computer Science 2001.
Models and Techniques for Communication in Dynamic Networks.. - Scheideler (2001) (2 citations) Self-citation (Scheideler) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 158-167, 2001.
On Local Algorithms for Topology Control and Routing in .. - Jia, Rajaraman.. (2003) (4 citations) Self-citation (Scheideler) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 158--167, 2001.
Anycasting and Multicasting in Adversarial Systems.. - Awerbuch, Brinkmann, al. (2002) Self-citation (Awerbuch Brinkmann Scheideler) (Correct)
....and Multicasting in Adversarial Systems: Routing and Admission Control (Preliminary Technical Report) Baruch Awerbuch # Johns Hopkins University 3400 N. Charles Street Baltimore, MD 21218, USA baruch cs.jhu.edu Andre Brinkmann Heinz Nixdorf Institute and Department of Electrical Engineering University of Paderborn 33102 Paderborn, Germany brinkman hni.upb.de Christian Scheideler Department of Computer Science Johns Hopkins University 3400 N. Charles Street Baltimore, ....
....baruch cs.jhu.edu Andre Brinkmann Heinz Nixdorf Institute and Department of Electrical Engineering University of Paderborn 33102 Paderborn, Germany brinkman hni.upb.de Christian Scheideler Department of Computer Science Johns Hopkins University 3400 N. Charles Street Baltimore, MD 21218, USA scheideler cs.jhu.edu Johns Hopkins University, March 01 2002 Abstract In this paper we consider the problem of routing packets in dynamically changing networks, concentrating on two different modes: anycasting and multicasting. In anycasting, a packet has a set of destinations but ....
[Article contains additional citation context not shown here]
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 158--167, 2001.
Anycasting in Adversarial Systems: Routing and Admission .. - Awerbuch, Brinkmann.. Self-citation (Awerbuch Brinkmann Scheideler) (Correct)
....that holds for arbitrary greedy protocols seem to indicate that online protocols cannot compete well with best possible protocols when using the same bu#er size. The study of adversarial models was initiated, in the context of routing, by Awerbuch, Mansour and Shavit [11] and further refined by [4, 7, 9, 10, 14]. In these papers the model is used that the adversary does not reveal the paths to the system, and therefore the routing protocol has to figure out paths for the packets by itself. Based on work by Awerbuch and Leighton [10] Aiello et al. 4] show that there is a simple distributed routing ....
....protocol that keeps the number of packets in transit bounded in a dynamic network if, roughly speaking, in each window of time the paths selected for the injected packets require a capacity that is below what the available network capacities can handle in the same window of time. Awerbuch et al. [7] generalize this to an adversarial model in which the adversary is allowed to control the network topology and packet injections as it likes, as long as for every injected packet it can provide a schedule to reach its destination. They show that even for the case that the network capacity is fully ....
[Article contains additional citation context not shown here]
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In FOCS '01, pages 158--167, 2001.
Routing in a Highly Dynamic Topology - Ganjali, McKeown (Correct)
No context found.
Baruch Awerbuch, Petra Berenbrink, Andre Brinkmann, and Christian Scheidler, "Simple routing strategies for adversarial systems," in FOCS'01, Las Vegas, Nevada, October 2001, pp. 158--167.
Scheduling over a Time-Varying User-Dependent Channel with.. - Andrews, Zhang (2002) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proc of FOCS '01, pages 158 -- 167.
Routing and Scheduling in Multihop Wireless Networks with.. - Andrews, Zhang (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pages 158 -- 167, Las Vegas, NV, October 2001.
A Note on Models for Non-Probabilistic Analysis of.. - Rosen (2002) (1 citation) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, Simple Routing Strategies for Adversarial Systems. In Proc. of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 158-167, 2001.
On Delivery Times in Packet Networks under Adversarial Traffic - Rosen, Tsirkin (2004) (2 citations) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, Simple Routing Strategies for Adversarial Systems. In Proc. of the 42nd Ann. IEEE Symposium on Foundations of Computer Science (FOCS), pp. 158-167, 2001.
Mobility Models for Ad hoc Network Simulation - Lin, Noubir, Rajaraman (2004) (4 citations) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, "Simple routing strategies for adversarial systems," in Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer Science, October 2001.
Worst Case Mobility in Ad Hoc Networks - Schindelhauer, Lukovszki, Rührup, .. (2003) (2 citations) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple Routing Strategies for Adversarial Systems. In IEEE Symposium on Foundations of Computer Science (FOCS'01), pages 158--167, 2001.
Worst Case Mobility in Ad Hoc Networks - Schindelhauer, Lukovszki, Rührup, .. (2003) (2 citations) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple Routing Strategies for Adversarial Systems. In IEEE Symposium on Foundations of Computer Science (FOCS'01), pages 158--167, 2001.
Topology Control and Routing in Ad hoc Networks: A Survey - Rajaraman (2002) (14 citations) (Correct)
No context found.
B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer Science, October 2001.
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