M. Adler, F. Fich, L. Goldberg, and M. Paterson. Tight Size Bounds for Packet Headers in Narrow Meshes. In 27th Int. Colloquium on Automata, Languages and Programming (ICALP), Springer, LNCS 1853, pages 756-767, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Lower Bounds for Oblivious Single-Message End-to-End.. - Fraigniaud, Gavoille (2003) (Correct)
....vertex set protocol does not o er signi cant improvement in the mesh, compared to the hop count protocol. Since the mesh is planar, it does not contain K 5 as minor, and thus it lets a big gap between the best known upper and lower bounds for mesh networks. Adler, Fich, Goldberg, and Paterson [2] recently closed this gap for narrow meshes, i.e. p q meshes with p = O(1) They have shown that there exists a protocol for n node meshes using headers of size O(p(log p log log n) and that any p q mesh requires headers of size ze log n) for 3 6 p 6 q. Constant size header protocol ....
....graphs. We also mentioned the protocol of Dolev and Welch [20] which applies to the single message problem as well. Adler and Fich [1] derived lower and upper bounds for the header size in speci c networks (e.g. meshes, hypercubes, butter ies, de Bruijn, etc. Adler, Fich, Goldberg, and Paterson [2] addressed the problem in p q meshes, p = O(1) They proved the somewhat surprising result stating that headers of size (log log n) bits are required in 3 n=3 meshes (whereas headers of constant size are sucient in 2 n=2 meshes) For a more detailed descriptions of the end to end protocols ....
M. Adler, F. Fich, L. Goldberg, and M. Paterson. Tight Size Bounds for Packet Headers in Narrow Meshes. In 27th Int. Colloquium on Automata, Languages and Programming (ICALP), Springer, LNCS 1853, pages 756-767, 2000.
Header-Size Lower Bounds for End-to-End Communication in.. - Fraigniaud, Gavoille (2004) (Correct)
No context found.
M. Adler, F. Fich, L. Goldberg, and M. Paterson. Tight Size Bounds for Packet Headers in Narrow Meshes. In 27th Int. Colloquium on Automata, Languages and Programming (ICALP), Springer, LNCS 1853, pages 756-767, 2000.
Lower Bounds for Oblivious Single-Packet End-to-End.. - Fraigniaud, Gavoille (Correct)
No context found.
M. Adler, F. Fich, L. Goldberg, and M. Paterson. Tight Size Bounds for Packet Headers in Narrow Meshes. In 27th Int. Colloquium on Automata, Languages and Programming (ICALP), Springer, LNCS 1853, pages 756-767, 2000.
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