Lower bounds for oblivious single-packet end-to-end communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 211-223

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

End to End; Sequence Transmission; Tree Width

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FORESTRY;

ASYNCHRONOUS COMMUNICATION; END TO END; END-TO-END COMMUNICATION; PLANAR NETWORKS; PROTOCOL DESIGN; SQUARE MESHES; TARGET NODES; TREE-WIDTH;

COMPLEX NETWORKS;

EID: 35248881135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_15     Document Type: Article

References (41)

1. M. Adler and F. Fich. The Complexity of End-to-End Communication in Memory-less Networks. In 18th ACM Symposium on Principles of Distributed Computing (PODC), pages 239-248, 1999.
2. M. Adler, F. Fich, L. Goldberg, and M. Paterson. Tight Size Bounds for Packet Headers in Narrow Meshes. In 27th Int. Colloquium on Automata, Languages and Programming (ICALP), Springer, LNCS 1853, pages 756-767, 2000.
3. Y. Afek, B. Awerbuch, and E. Gafni. Applying Static Network Protocols to Dynamic Networks. In 28th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 358-370, 1987.
4. Y. Afek, and E. Gafni. End-to-End Communication in Unreliable Networks. In 7th ACM Symposium on Principles of Distributed Computing (PODC), pages 131-148, 1988.
5. Y. Afek, and E. Gafni. Bootstrap Network Resynchonization. In 10th ACM Symposium on Principles of Distributed Computing (PODC), pages 295-307, 1991.
6. Y. Afek, H. Attiya, A. Fekete, M. Fischer, N. Lynch, Y. Mansour, D.-W. Wang, and L. Zuck. Reliable Communication Over Unreliable Channels. Journal of the ACM 41(6):1267-1297 (1994).
7. 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 22(1):158-186 (1997).
8. A. Aho, J. Ullman, A. Wyler, and M. Yannakakis. Bounds on the Size and Transmission Rate of Communication Protocols. Computers and Math with Applications 8(3):205-214 (1982).
9. E. Amir. Efficient approximation for triangulation of minimum treewidth. In 17th Conference on Uncertainty in Artificial Intelligence (UAI), 2001.
10. S. Arnborg. Efficient Algorithms for Combinatorial Problems on Graphs with Bounded Decomposability-A Survey. BIT 25:2-23 (1985).
11. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of Finding Embeddings in a k-Tree. SIAM J. Alg. Disc. Meth. 8:277-284 (1987).
12. B. Awerbuch and S. Even. Reliable Broadcast Protocols in Unreliable Networks. Networks 16:381-396 (1986).
13. B. Awerbuch, Y. Mansour, and N. Shavit. Polynomial End-to-End Communication. In 30th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 358-363, 1989.
14. B. Awerbuch, O. Goldreich, and A. Herzberg. A Quantitative Approach to Dynamic Networks. In 9th ACM Symposium on Principles of Distributed Computing (PODC), pages 189-203, 1990.
15. K. Bartlett, R. Scantleburg, and P. Wilkinson. A Note on Reliable, Full-Duplex Transmission over Half-Duplex Links. Communication of the ACM 12:260-261 (1969).
16. H. Bodlaender. A Tourist Guide through Treewidth. Acta Cybernetica 11:1-21 (1993).
17. H. Bodlaender. A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM Journal on Computing, 25:1305-1317, 1996.
18. H. Bodlaender, J. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. Journal of Algorithms 18:238-255 (1995).
19. V. Bouchitté, D. Kratsch, H. Müller, and I. Todinca. On treewidth approximations. In 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2001.
20. R. Diestel. Graph Theory (2nd edition). Springer-Verlag, New York, 2000.
21. R. Diestel, T.R. Jensen, K.Y. Gorbunov, and C. Thomassen. Highly connected sets and the excluded grid theorem. Journal of Combin. Theory B 75:61-73 (1999).
22. S. Dolev and J. Welch. Crash Resilient Communication in Dynamic Networks. IEEE Transactions on Computers 46(1):14-26 (1997).
23. A. Fekete, and N. Lynch. The Need for Headers: An Impossibility Result for Communication over Unreliable Channels. In 1st Int. Conf. on Theories of Concurrency: Unification and Extension (CONCUR), Springer, LNCS 458, pages 199-215, 1990.
24. A. Fekete, N. Lynch, Y. Mansour, and J. Spinelli. The Impossibility of Implementing Reliable Communication in the Face of Crashes. Journal of the ACM 40(3):1087-1107 (1993).
25. F. Fich. End-to-End Communication Protocols. In 2nd Int. Conference on Principles of Distributed Systems (OPODIS), Hermes, pages 37-43, 1998.
26. F. Fich and A. Jakoby. Short Headers Suffice for Communication in a DAG with Link Failures. In 14th International Symposium on Distributed Computing (DISC), Springer, LNCS, pages 360-373, 2000.
27. O. Goldreich, A. Herzberg, and Y. Mansour. Source to Destination Communication in the Presence of Faults. In 8th ACM Symposium on Principles of Distributed Computing (PODC), pages 85-101, 1989.
28. A. Herzberg. Connection-Based Communication in Dynamic Networks. In 11th ACM Symposium on Principles of Distributed Computing (PODC), pages 13-24, 1992.
29. E. Kushilevitz, R. Ostrovsky, and A. Rosén. Log-Space Polynomial End-to-End Communication. In 28th ACM Symposium on Theory of Computing (STOC), pages 559-568, 1995.
30. R. Ladner, A. LaMarca, and E. Tempero. Counting Protocol for Reliable End-to-End Transmission. Journal of Computer and System Sciences 56:96-111 (1998).
31. Y. Mansour and B. Schieber. The Intractability of bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels. Journal of the ACM 39(4):783-799 (1992).
32. J. Postel. Internet Protocol. Internet Engineering Task Force Request For Comments 791, 1981.
33. B. Reed. Finding Approximate Separators and Computing Treewidth Quickly. In 24th ACM Symposium on Theory of Computing (STOC), pages 221-228 (1992).
34. N. Robertson, and P.D. Seymour. Graph Minors. III. Planar Tree-Width. Journal of Combin. Theory B 36:49-64 (1984).
35. N. Robertson, and P.D. Seymour. Graph Minors. V. Excluding a planar graph. Journal of Combin. Theory B 41:92-114 (1986).
36. N. Robertson, P.D. Seymour, and R. Thomas. Quickly excluding a planar graph. Journal of Combin. Theory B 62:323-348 (1994).
37. N. Stenning. A Data Transfer Protocol. Computer Networks 1(2):99-110 (1976).
38. E. Tempero, and R. Ladner. Recoverable Sequence Transmission Protocols. Journal of the ACM 42(5):1059-1090 (1995).
39. U. Vishkin. A Distributed Orientation Algorithm. IEEE Transaction on Information Theory 29, 624-629 (1983).
40. D.-W. Wang, and L. Zuck. Tight Bounds for the Sequence Transmission Problem. In 8th ACM Symposium on Principles of Distributed Computing (PODC), pages 73-83, 1989.
41. D.-W. Wang, and L. Zuck. Real-Time Sequence Transmission Problem. In 10th ACM Symposium on Principles of Distributed Computing (PODC), pages 111-124, 1991.