The Library
Tight size bounds for packet headers in narrow meshes
Tools
Tools
Tools
UNSPECIFIED (2000) Tight size bounds for packet headers in narrow meshes. In: 27th International Colloquium on Automata Languages and Programming (ICALP 2000), GENEVA, SWITZERLAND, JUL 09-15, 2000. Published in: AUTOMATA LANGUAGES AND PROGRAMMING, 1853 pp. 756-767.
Full text not available from this repository.Abstract
Consider the problem of sending a single message from a sender to a receiver through an m x n mesh with asynchronous links that may stop working, and memoryless intermediate nodes. We prove that for m is an element of O(1), it is necessary and sufficient to use packet headers that are Theta(log log n) bits long.
| Item Type: | Conference Item (UNSPECIFIED) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Series Name: | LECTURE NOTES IN COMPUTER SCIENCE |
| Journal or Publication Title: | AUTOMATA LANGUAGES AND PROGRAMMING |
| Publisher: | SPRINGER-VERLAG BERLIN |
| ISBN: | 3-540-67715-1 |
| ISSN: | 0302-9743 |
| Editor: | Montanari, U and Rolim, JDP and Welzl, E |
| Date: | 2000 |
| Volume: | 1853 |
| Number of Pages: | 12 |
| Page Range: | pp. 756-767 |
| Publication Status: | Published |
| Title of Event: | 27th International Colloquium on Automata Languages and Programming (ICALP 2000) |
| Location of Event: | GENEVA, SWITZERLAND |
| Date(s) of Event: | JUL 09-15, 2000 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/12897 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
