Header-size lower bounds for end-to-end communication in memoryless networks

Authors:
Pierre Fraigniaud;Cyril Gavoille
Affiliations:
CNRS, Lab. de Recherche en Informatique, University Paris-Sud, Batiment, Orsay Cedex, France;University of Bordeaux, LaBRI, Talence Cedex, France
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Year:
2006

Citing 28
Cited 1

Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey

BIT - Ellis Horwood series in artificial intelligence
Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
End-to-end communication in unreliable networks

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Source to destination communication in the presence of faults

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A quantitative approach to dynamic networks

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Real-time sequence transmission problem

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Bootstrap network resynchronization (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Finding approximate separators and computing tree width quickly

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Connection-based communication in dynamic networks

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels

Journal of the ACM (JACM)
The impossibility of implementing reliable communication in the face of crashes

Journal of the ACM (JACM)
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

Journal of Algorithms
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Reliable communication over unreliable channels

Journal of the ACM (JACM)
Recoverable sequence transmission protocols

Journal of the ACM (JACM)
Log-space polynomial end-to-end communication

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Slide—the key to polynomial end-to-end communication

Journal of Algorithms
Crash Resilient Communication in Dynamic Networks

IEEE Transactions on Computers
Counting protocols for reliable end-to-end transmission

Journal of Computer and System Sciences
The complexity of end-to-end communication in memoryless networks

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Highly connected sets and the excluded grid theorem

Journal of Combinatorial Theory Series B
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Short Headers Suffice for Communication in a DAG with Link Failures

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Efficient Approximation for Triangulation of Minimum Treewidth

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence

$k$-Robust Single-Message Transmission

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The end-to-end communication problem is a protocol design problem, for sending a packet from a specified source-node s to a specified target-node t, through an unreliable asynchronous memoryless communication network. The protocol must insure reception and termination. In this paper, we measure the complexity of the protocol in term of header size, i.e., the quantity of information that must be attached to the packets to insure their delivery. We show that headers of Ω(log log τ) bits are required in every network, where τ denotes the treewidth of the network. In planar networks, Ω(log τ) bits are required.