k-robust single-message transmission

Authors:
André Kündgen;Michael J. Pelsmajer;Radhika Ramamurthi
Affiliations:
Department of Mathematics, California State University, San Marcos;Department of Applied Mathematics, Illinois Institute of Technology;Department of Mathematics, California State University, San Marcos
Venue:
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Year:
2004

Citing 3
Cited 1

The complexity of end-to-end communication in memoryless networks

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Tight Size Bounds for Packet Headers in Narrow Meshes

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Graph Minors and Reliable Single Message Transmission

SIAM Journal on Discrete Mathematics

$k$-Robust Single-Message Transmission

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

End-to-end communication considers the problem of sending messages between a sender s and a receiver r through an asynchronous, unreliable network, such as the Internet. We consider the problem of transmitting a single message from s to r through a network in which edges may fail and cannot recover. We assume that some s,r-path survives, but we do not know which path it is. A routing algorithm is k-robust if it ensures that a message sent by s will be received by r when at most k edges fail, and it will never generate an infinite number of messages. Graphs with a k-robust algorithm for all k were characterized in[5]. For any other graph, its robustness is the maximum k for which it has a k-robust algorithm. We provide general lower bounds for robustness by improving a natural algorithm obtained from Menger's Theorem. We determine robustness for several examples, such as complete graphs, grids, and hypercubes.