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
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
k-robust single-message transmission
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
| Hi-index | 0.00 |
We consider the problem of transmitting a message from a sender $s$ to a receiver $r$ through a network in which edges may fail and cannot recover. In the transmission protocols we consider, we require that $r$ may not be “flooded” by infinitely many copies of this message. A routing protocol is $k$-robust if it ensures that a message sent by $s$ will be received by $r$ when at most $k$ edges fail, unless no $s,r$-path remains. Graphs which have a $k$-robust protocol for all $k$ were characterized in [F. E. Fich, A. Kündgen, M. J. Pelsmajer, and R. Ramamurthi, SIAM J. Discrete Math., 19 (2005), pp. 815-847]. For any other graph, its robustness is the maximum $k$ for which it has a $k$-robust protocol. We provide general lower bounds for robustness by improving a natural protocol obtained from Menger's theorem. We determine robustness for several examples, such as complete graphs, grids, and hypercubes.