C. Scheideler and B. Vocking, "From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols", In Proc. of the 31st ACM Symposium on the Theory of Computing, pp. 215--224, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
From Static to Dynamic Routing: Efficient Transformations.. - Scheideler, Vöcking (1999) (1 citation) Self-citation (Scheideler Vocking) (Correct)
No context found.
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-andforward protocols. In Proc. of the 31th ACM Symp. on Theory of Computing (STOC), 1999. 28
On Local Algorithms for Topology Control and Routing in .. - Jia, Rajaraman.. (2003) (4 citations) Self-citation (Scheideler) (Correct)
No context found.
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 215--224, 1999.
Information Gathering in Adversarial Systems: Lines and Cycles - Kothapalli, Scheideler Self-citation (Scheideler) (Correct)
....In the following, B will always mean the buffer size of an optimal routing algorithm. 1. 2 Previous results The study of adversarial models in communication networks was initiated, in the context of queueing disciplines, by Borodin et al. 12] Other work on adversarial queueing includes [6, 13, 14, 15, 23, 26]. In these papers it is assumed that the adversary has to provide a path for every injected packet and reveals these paths to the system. The paths have to be selected in a way that they do not overload the system. Hence, it only remains to find the right queueing discipline (such as ....
C. Scheideler and B. Vocking. From static to dynamic routing: efficient transformations of store-and-forward protocols. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 215--224, 1999.
Anycasting and Multicasting in Adversarial Systems.. - Awerbuch, Brinkmann, al. (2002) Self-citation (Scheideler) (Correct)
....of successfully delivered packets. However, we will show that the seemingly impossible task is possible, both for anycasting and multicasting. The study of adversarial models was initiated, in the context of switching alone, by Borodin et al. 16] Other work on switching includes [6, 22, 23, 24, 42, 45] In these papers it is assumed that the adversary has to provide a path for every injected packet and reveals these paths to the system. The paths have to be selected in a way that they do not overload the system. Hence, it only remains to find the right queueing discipline (such as ....
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 215--224, 1999.
Simple Routing Strategies for Adversarial Systems - Awerbuch, Berenbrink.. (2001) (11 citations) Self-citation (Scheideler) (Correct)
....to the system. There is no need to do either routing or admission (input stream) control. Thus, it only remains to find the right switching strategy to send the packets to their destinations. This model was introduced by Borodin et al. in [9] and has subsequently been studied in several papers [5, 12, 13, 14, 17, 18]. All previous results mentioned above (except for a result by Gamarnik for the special case that the adversary reveals the paths to the system [13] only manage to accomplish their task if the injection process is strictly below what can be handled by the network. Or more precisely, it has to be ....
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pages 215--224, 1999.
SIMLAB - A Simulation Environment for Storage Area Networks - Berenbrink, Brinkmann, al. (2001) Self-citation (Scheideler) (Correct)
....Growing rank protocol (see [16] In this case every packet is marked with a rank depending on its generation time. The routers always forward the packet with the smallest rank. Furthermore, every time a packet traverses a link, its rank will be increased. ELIS (enforced longest in system, see [19]) This strategy is a restricted variant of the LIS strategy. The strategy uses control packets in order to enforce that the generation times of the packets which are routed across any link are increasing with time. Figure 9 shows a sample output of simulations with different switching strategies ....
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In Proceedings of the 31st Symposium on Theory of Computing (STOC), pages 215--224, 1999.
From Static to Dynamic Routing: Efficient Transformations.. - Scheideler, Vöcking (1999) (1 citation) Self-citation (Scheideler Vocking) (Correct)
....the static algorithm chosen for the transformation does not provide this locality feature and is not pure. In the adversarial model, the delay bound of the packets is closely related to the time bound given for the static algorithm. A preliminary version appears at the 31st STOC, 1999, see [18]. y Department of Mathematics and Computer Science, and Heinz Nixdorf Institute, Paderborn University, Germany. Email: chrsch uni paderborn.de. Supported in part by the DFG Sonderforschungsbereich 376 and the EU ESPRIT Long Term Research Project 20244 (ALCOM IT) z International Computer ....
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-andforward protocols. In Proc. of the 31th ACM Symp. on Theory of Computing (STOC), 1999. 28
From Static to Dynamic Routing: Efficient Transformations.. - Scheideler, Vöcking (1999) (1 citation) Self-citation (Scheideler Vocking) (Correct)
....if the static algorithm chosen for the transformation does not provide this locality feature and is not pure. In the adversarial model, the delay bound of the packets is closely related to the time bound given for the static algorithm. A preliminary version appears at the 31th STOC, 1999, see [16]. y Department of Mathematics and Computer Science, and Heinz Nixdorf Institute, Paderborn University, Germany. Email: chrsch uni paderborn.de. Supported in part by the DFG Sonderforschungsbereich 376 and the EU ESPRIT Long Term Research Project 20244 (ALCOM IT) z International Computer ....
C. Scheideler and B. Vocking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In Proc. of the 31th ACM Symp. on Theory of Computing (STOC), 1999. 42
Tight Bounds for the Performance of Longest-In-System On Dags - Adler, Rosen (2002) (3 citations) (Correct)
No context found.
C. Scheideler and B. Vocking, "From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols", In Proc. of the 31st ACM Symposium on the Theory of Computing, pp. 215--224, 1999.
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