Abstract
This paper considers a number of communication problems, including end-to-end communication and multicasts, in networks whose underlying graphs are directed and acyclic and whose links are subject to permanent failures. In the case that each processor has separate input queues for each in-edge, we present protocols for these problems that use single bit headers. In the case that each processor has a single input queue for all of its in-edges, we prove that θ(logcf)-bit headers are necessary and sufficient, where d is the indegree of the graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Micah Adler and Faith E. Fich, The Complexity of End-to-End Communication in Memoryless Networks, 18th Annual ACM Symposium on Principles of Distributed Computing, May 1999, pages 239–248.
Micah Adler, Faith E. Fich, Leslie Ann Goldberg, and Mike Paterson Tight Size Bounds for Packet Headers in Narrow Meshes, to appear in the Proceedings of the 27th International Colloquium on Automata, Languages and Programming, 2000.
Y. Afek, H. Attiya, A. Fekete, M. Fischer, N. Lynch, Y. Mansour, D. Wang, and L. Zuck, Reliable Communication Over Unreliable Channels, Journal of the ACM, vol. 41, no. 6, 1994, pages 1267–1297.
Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosèn, and N Shavit, Slide-The Key to Polynomial End-to-End Communication, Journal of Algorithms, vol. 22, no. 1, 1997, pages 158–186.
Y. Afek and E. Gafni, End-to End Communication in Unreliable Networks, Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, 1988, pages 131–148.
Y. Afek and E. Gafni, Bootstrap Network Resynchronization, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, 1991, pages 295–307.
B. Awerbuch and S. Even, Reliable Broadcast Protocols in Unreliable Networks, Networks, vol. 16, 1986, pages 381–396.
B. Awerbuch, Y. Mansour, and N. Shavit, Polynomial End to End Communication, Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pages 358–363.
B. Awerbuch, B. Patt-Shamir, and G. Varghese, Self-stabilizing End-to-End Communication, Journal of High Speed Networks, vol. 5, no. 4, 1996, pages 365–381.
K. Bartlett, R. Scantlebury, and P. Wilkinson, A Note on Reliable, Full-Duplex Transmission over Half-Duplex Links, Communications of the ACM, vol. 12, 1969, pages 260–261.
S. Dolev and J. Welch, Crash Resilient Communication in Dynamic Networks, IEEE Transactions of Computers, vol. 46, 1997, pages 14–26.
R. Dutton and R. Brigham, Strong, weak and other colorings of uniform hyper-graphs, Proceedings of the Sixteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 47, 1985, pages 299–314.
F. Fich, End-to-end Communication, Proceedings of OPODIS ’98, Amiens, France, 1998, pages 37–43.
E. Kushilevitz, R. Ostrovsky, and A. Rosen, Log-Space Polynomial End-to-End Communication, Proceedings of the 28th ACM Symposium on the Theory of Computing, 1995, pages 559–568.
R. Ladner, A. LaMarca, and E. Tempero, Counting Protocols for Reliable End-to-End Transmission, Journal of Computer and Systems Sciences, vol. 56, no. 1, 1998, pages 96–111.
J. Postel, Internet Protocol, Network Working Group Request for Comments 791, September 1981.
M. Stenning, A Data Transfer Protocol, Computer Net., vol. 1, 1976, pages 99–110.
E. Tempero and R. Ladner, Recoverable Sequence Transmission Protocols, Journal of the ACM, vol. 42, no. 5, 1995, pages 1059–1090.
U. Vishkin, A Distributed Orientation Algorithm, EEE Trans, on Information Theory, vol. 29, 1983, pages 624–629.
D. Wang and L. Zuck, Tight Bounds for the Sequence Transmission Problem, 8th Annual ACM Symposium on Principles of Distributed Computing, 1989, pages 73–83.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fich, F.E., Jakoby, A. (2000). Short Headers Suffice for Communication in a DAG with Link Failures. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-40026-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41143-7
Online ISBN: 978-3-540-40026-4
eBook Packages: Springer Book Archive