Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2000) Tight size bounds for packet headers in narrow meshes. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Preview

PDF (Department of Computer Science Research Report) WRAP_cs-rr-366.pdf - Other - Requires a PDF viewer. Download (303Kb) | Preview

Request Changes to record.

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 E O(1), it is necessary and sufficient to use packet headers that are Theta(log log n) bits long.

Item Type:	Report
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Packet transport networks
Series Name:	Department of Computer Science research report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	2000
Dates:	Date Event 2000 Completion
Number:	Number 366
Number of Pages:	15
DOI:	CS-RR-366
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Access rights to Published version:	Restricted or Subscription Access
Funder:	Natural Sciences and Engineering Research Council of Canada (NSERC), CITO, Engineering and Physical Sciences Research Council (EPSRC), European Strategic Programme of Research and Development in Information Technology (ESPRIT)
Grant number:	GR/L60982 (EPSRC), ALCOM-FT (ESPRIT)
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads