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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, M., Fich, F.E.: The Complexity of End-to-End Communication in Memoryless Networks. In: 18th Annual ACM Symposium on Principles of Distributed Computing, May 1999, pp. 239–248 (1999)
Adler, M., Fich, F.E., Goldberg, L.A., Paterson, M.: Tight Size Bounds for Packet Headers in Narrow Meshes. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 756. Springer, Heidelberg (2000)
Fich, F.E.: End-to-end Communication. In: Proceedings of the 2nd International Conference on Principles of Distributed Systems, Amiens, France, pp. 37–43 (1998)
Lovász, L.: Personal communication (2003)
Fich, F.E., Kündgen, A., Pelsmajer, M.J., Ramamurthi, R.: Graph Minors and Reliable Single-Message Transmission. Accepted for publication in SIAM J. Discr. Math.
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Inc., Upper Saddle River (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kündgen, A., Pelsmajer, M.J., Ramamurthi, R. (2005). k-Robust Single-Message Transmission. In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_9
Download citation
DOI: https://doi.org/10.1007/11527954_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27873-3
Online ISBN: 978-3-540-31860-6
eBook Packages: Computer ScienceComputer Science (R0)