Skip to main content
Conference Proceedings

Tight size bounds for packet headers in narrow meshes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1853 756-767
DOI: 10.1007/3-540-45022-x_63
5Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Consider the problem of sending a single message from a sender to a receiver through an m × n mesh with asynchronous links that may stop working, and memoryless intermediate nodes. We prove that for m ∈ O(1), it is necessary and sufficient to use packet headers that are Θ(log log n) bits long.

Cite

CITATION STYLE

APA

Adler, M., Fich, F., Goldberg, L. A., & Paterson, M. (2000). Tight size bounds for packet headers in narrow meshes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 756–767). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free