Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, N. Shavit, A. Ros'en. Slide - The Key to Polynomial End-to-End Communication. Journal of Algorithms, Vol. 22, No. 1, pp. 158--186, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....may request such links at most g times (g a constant) Once a direct link is established, the nodes may use it to exchange information for as many times as they wish. Many different protocols for end to end communication have been developed when links (and or intermediate nodes) may fail ( 1] [2], 3] 4] 5] 6] 8] 9] Also, previous work of the authors examined structural properties of unreliable networks ( 10] 11] 12] In this paper, we present a simple protocol which establishes (almost surely) a very long path in the network (involving a constant fraction, at least, of ....

Afek, Awerbuch, Gafni, Mansour, Rosen and Shavit. Slide - The Key to Polynomial End-to-End Communication. J. of Algorithms, vol. 22, no 1, 158--186, 1997. Nikoletseas et al.: Communication Establishment in Adverse Environments 11

....it suffices to identify a feedback vertex set (a set of vertices, at least one of which must appear in every cycle) and count until the number of visits to processors in this set exceeds the set s cardinality [16] For many networks, this quantity may be substantially smaller. The slide protocol [4] was designed for networks with bidirectional links that can fail (but not recover) It behaves very differently from sequence number based protocols: No headers are used and intermediate processors do not duplicate or destroy packets. Stacks of at most n packets are stored at each intermediate ....

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Ros`en, and N. Shavit, Slide--The Key to Polynomial End-to-End Communication, Journal of Algorithms, vol. 22, no. 1, 1997, pages 158--186.

No context found.

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, N. Shavit, A. Ros'en. Slide - The Key to Polynomial End-to-End Communication. Journal of Algorithms, Vol. 22, No. 1, pp. 158--186, 1997.

No context found.

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, N. Shavit, A. Ros'en. Slide - The Key to Polynomial End-to-End Communication. Journal of Algorithms, Vol. 22, No. 1, pp. 158--186, 1997.

....number of incoming or outgoing edges a virtual node can have. For the destination node, we will not require any limitation on the number of incoming edges. The option set model can be generalized so that it can also cover multicasting situations. However, we will wait with this until Section 5. 2.2 The T balancing algorithm We will present our algorithm in the option set model. Thus, when we speak about nodes and edges, we mean virtual nodes and virtual edges. Let h v,t denote the amount of packets in node v at the beginning of time step t. For the destination node d, h d,t = 0 at any ....

....number of incoming or outgoing edges a virtual node can have. For the destination node, we will not require any limitation on the number of incoming edges. The option set model can be generalized so that it can also cover multicasting situations. However, we will wait with this until Section 5. 2. 2 The T balancing algorithm We will present our algorithm in the option set model. Thus, when we speak about nodes and edges, we mean virtual nodes and virtual edges. Let h v,t denote the amount of packets in node v at the beginning of time step t. For the destination node d, h d,t = 0 at any ....

[Article contains additional citation context not shown here]

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosen, and N. Shavit. Slide -- the key to polynomial end-to-end communication. Journal of Algorithms, 22(1):158--186, 1997.

....bounds also apply to other adversarial routing and queueing models suggested so far. Finally, we note that all approaches in the adversarial routing area, including this current paper, are based on simple load balancing schemes first pioneered by Awerbuch, Mansour and Shavit [11] and refined in [1 4, 7, 9, 10] for various routing purposes. Our achievement is to demonstrate that balancing even works for anycasting. Also, we use a much more general adversarial network model then was used in previous papers, and we consider the admission control problem. In order to state our analytical results, we need ....

....by some given online algorithm A with bu#er size B # . We call an online algorithm A (c, s) competitive if for all # and all B, A can guarantee that A s # B (#) c OPTB (#) r for any s # s, where r 0 is some value that is independent of # (but may depend on s, B and n) c [0, 1] denotes here the fraction of the best possible throughput that can be achieved by A and s denotes the space overhead necessary to achieve this. If c can be brought arbitrarily close to 1, A is also called s(#) competitive (or simply competitive) where s(#) reflects the relationship between s and ....

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosen, and N. Shavit. Slide -- the key to polynomial end-to-end communication. Journal of Algorithms, 22(1):158--186, 1997.

No context found.

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Ros'en, and N. Shavit. Slide -- the Key to Polynomial End-to-End Communication. J. of Algorithms 22(1):158-186, 1997.

No context found.

Afek, Awerbuch, Gafni, Mansour, Ros`en, and Shavit, Slide--The Key to Polynomial End-toEnd Communication, Journal of Algorithms, vol. 22, no. 1, 1997, pages 158--186.

No context found.

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, N. Shavit, A. Ros'en. Slide - The Key to Polynomial End-to-End Communication. Journal of Algorithms, Vol. 22, No. 1, pp. 158--186, 1997.

No context found.

Afek, Awerbuch, Gafni, Mansour, Ros'en, and Shavit, Slide--The Key to Polynomial End-toEnd Communication, Journal of Algorithms, vol. 22, no. 1, 1997, pages 158--186.

No context found.

Y Afek, B Awerbuch, E Gafni, Y Mansour, A Rosen, and N Shavit. Slide - the key to polynomial end-to-end communication. Journal of Algorithms, 22(1):158--186, 1997.

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