End-to-end communication in unreliable networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

End-to-end communication in unreliable networks

Full text

Pdf (1.79 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the seventh annual ACM Symposium on Principles of distributed computing table of contents

Toronto, Ontario, Canada

Pages: 131 - 148

Year of Publication: 1988

ISBN:0-89791-277-2

Authors

Eli Gafni	Department of Computer Science, University of California, Los Angeles, Los Angeles, CA
Yehuda Afek	AT&T Bell Labs., 600 Mountain Ave., Murray Hill, NJ

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 25, Citation Count: 23

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/62546.62570 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AAG87	Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. of the 2 8th IEEE Annual Symp. on Foundation o} Computer Science, pages 358-370, October 1987.
	AE86	B. Awerbuch ~nd S. Even. Reliable broadcast protocols in unreliable networks. NETWORKS, 16:381-396, 1986.
	AG88	Y. Afek and E. Gafni. End-to-end communication in uareliabel networks. May 1988. Submitted for Jou:'nal Publicatioa.
	AM88	B. Awerbuch ~nd Y. Mansour. An efficient topology update p:'otocol for dynamic networks. Jaatuary 1988. Technical Report, MIT.
	AUWY82	A. V. Aho, 3. D. Ullman, A. D. Wyner, aa:d M. Yannakakis. Bounds on the size and transmission rate of communication protocols. Comp. ~ Maths. with AppIs., 8:3:205-214, 1982. det~tiled version of {AUY-79}.
	AUY79	A.V. Allo, 3. D. Ullman, and .~I. Yaaa~kakis. ~lodeling communication protocols by atttomata. In Proc. of the 20th IEEE Annual Syrup. on Foundation of Computer Science, pages 267-273, 1979.
	BSW69	K. A. Bartlett , R. A. Scantlebury , P. T. Wilkinson, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, v.12 n.5, p.260-261, May 1969 [doi>10.1145/362946.362970]
	CR87	I. Cidon and R. Rom. Fail-safe end-to-end protocols in computer networks with changing topology. IEEE Trans. on Communication, COM-35(4):410-413, April 1987.
	Fin79	S. G. Finn. Resynch procedures and fail-safe network protocol. IEEE Tranc. on Comm., COM-27:840-845, June 1979.
	Gal82	R.G. Gallager. Distributed Minimum Hop Algorithms. Technical Report LIDS-P-1175, M.I.T. Lab for Information and Decision Systems, January 1982.
	HZ87	Joseph Y. Halpern, A little knowledge goes a long way: simple knowledge-based derivations and correctness proofs for a family of protocols, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.269-280, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41863]
	Lam78	Leslie Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, v.21 n.7, p.558-565, July 1978 [doi>10.1145/359545.359563]
	Seg83	A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1), January 1983.

CITED BY 23

	Baruch Awerbuch , Oded Godlreich , Amir Herzberg, A quantitative approach to dynamic networks, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.189-203, August 22-24, 1990, Quebec City, Quebec, Canada
	Joseph Y. Halpern , Lenore D. Zuck, A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols, Journal of the ACM (JACM), v.39 n.3, p.449-478, July 1992
	A. Herzberg , S. Kutten, Fast isolation of arbitrary forwarding faults, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.339-353, June 1989, Edmonton, Alberta, Canada
	Yehuda Afek , Eli Gafni, Bootstrap network resynchronization (extended abstract), Proceedings of the tenth annual ACM symposium on Principles of distributed computing, p.295-307, August 19-21, 1991, Montreal, Quebec, Canada
	Yehuda Afek , Hagit Attiya , Alan Fekete , Michael Fischer , Nancy Lynch , Yishay Mansour , Dai-Wei Wang , Lenore Zuck, Reliable communication over unreliable channels, Journal of the ACM (JACM), v.41 n.6, p.1267-1297, Nov. 1994
	Eyal Kushilevitz , Rafail Ostrovsky , Adi Rosén, Log-space polynomial end-to-end communication, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.559-568, May 29-June 01, 1995, Las Vegas, Nevada, United States
	Lujun Jia , Rajmohan Rajaraman , Christian Scheideler, On local algorithms for topology control and routing in ad hoc networks, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA
	Yehuda Afek , Eli Gafni , Adi Rosén, The slide mechanism with applications in dynamic networks, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, p.35-46, August 10-12, 1992, Vancouver, British Columbia, Canada
	Hagit Attiya , Amotz Bar-Noy , Danny Dolev, Sharing memory robustly in message-passing systems, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.363-375, August 22-24, 1990, Quebec City, Quebec, Canada
	Amir Herzberg, Connection-based communication in dynamic networks, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, p.13-24, August 10-12, 1992, Vancouver, British Columbia, Canada
	Hagit Attiya , Amotz Bar-Noy , Danny Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM (JACM), v.42 n.1, p.124-142, Jan. 1995
	James P. G. Sterbenz , Rajesh Krishnan , Regina Rosales Hain , Alden W. Jackson , David Levin , Ram Ramanathan , John Zao, Survivable mobile wireless networks: issues, challenges, and research directions, Proceedings of the 3rd ACM workshop on Wireless security, p.31-40, September 28-28, 2002, Atlanta, GA, USA
	Robert Cypher , Smaragda Konstantinidou, Bounds on the efficiency of message-passing protocols for parallel computers, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.173-181, June 30-July 02, 1993, Velen, Germany
	Baruch Awerbuch , Tom Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.487-496, May 23-25, 1994, Montreal, Quebec, Canada
	Micah Adler , Faith Fich, The complexity of end-to-end communication in memoryless networks, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.239-248, May 04-06, 1999, Atlanta, Georgia, United States
	H. Abu-Amara , J. Lokre, Election in Asynchronous Complete Networks with Intermittent Link Failures, IEEE Transactions on Computers, v.43 n.7, p.778-788, July 1994
	Shlomi Dolev , Jennifer L. Welch, Crash Resilient Communication in Dynamic Networks, IEEE Transactions on Computers, v.46 n.1, p.14-26, January 1997
	Y. Afek , D. Hendler, On the complexity of global computation in the presence of link failures: the general case, Distributed Computing, v.8 n.3, p.115-120, March 1995
	Yehuda Afek , Geoffrey M. Brown, Self-stabilization over unreliable communication media, Distributed Computing, v.7 n.1, p.27-34, November 1993
	Andrzej Pelc , David Peleg, Feasibility and complexity of broadcasting with random transmission failures, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA
	Pierre Fraigniaud , Cyril Gavoille, Header-size lower bounds for end-to-end communication in memoryless networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.50 n.10, p.1630-1638, 14 July 2006
	Andrzej Pelc , David Peleg, Feasibility and complexity of broadcasting with random transmission failures, Theoretical Computer Science, v.370 n.1-3, p.279-292, February, 2007
	Baruch Awerbuch , Israel Cidon , Shay Kutten, Optimal maintenance of a spanning tree, Journal of the ACM (JACM), v.55 n.4, p.1-45, September 2008