<%@ page language="java" contentType="text/html" %>
<%-- Include common initialisation code --%>
<%@ include file="/arch/common.jsp" %>
<%-- The current tab --%>
<% String currentTab = "Research"; %>
<%-- Content of navigation pane --%>
<%@ include file="nav.jsp" %>
<% showCurrentLink=true; %>
<%-- Current navigation location --%>
<% String currentNav = "Reports and Theses"; %>
<%-- Include the code for the document header --%>
<%@ include file="/arch/header.jsp" %>
Research Report CS-RR-366
<%-- Include the code for the lines and navigation --%>
<%@ include file="/arch/middle.jsp" %>
Micah Adler, Faith Fitch, Leslie Ann Goldberg and Mike Paterson,
Tight Size Bounds for Packet Headers in Narrow Meshes
(January 21, 2000).
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 = O(1),
it is necessary and sufficient to use packet headers that are Theta(log
log n) bits long.
Download
cs-rr-366.ps.gz
<%-- Include the code for the document footer --%>
<%@ include file="/arch/footer.jsp" %>