Adler, Micah, Fich, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2002) Tight size bounds for packet headers in narrow meshes. In: Montanari, U. and Rolim, J. D. P. and Welzl, E., (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, Volume 1853 . Springer Berlin Heidelberg, pp. 756-767. ISBN 9783540677154

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:	Book Item
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Series Name:	Lecture Notes in Computer Science
Publisher:	Springer Berlin Heidelberg
ISBN:	9783540677154
ISSN:	0302-9743
Book Title:	Automata, Languages and Programming
Editor:	Montanari, U. and Rolim, J. D. P. and Welzl, E.
Official Date:	18 February 2002
Dates:	Date Event 18 February 2002 Published
Volume:	Volume 1853
Number of Pages:	12
Page Range:	pp. 756-767
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Title of Event:	27th International Colloquium on Automata Languages and Programming (ICALP 2000)
Type of Event:	Other
Location of Event:	Geneva, Switzerland
Date(s) of Event:	09-15 Jul 2000
URI:	http://wrap.warwick.ac.uk/id/eprint/12897

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Actions (login required)

View Item