Article

Free access

End-to-end communication in unreliable networks

Authors:

Eli Gafni,

Yehuda AfekAuthors Info & Claims

PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

Pages 131 - 148

https://doi.org/10.1145/62546.62570

Published: 01 January 1988 Publication History

PDF eReader

References

[1]

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.

Digital Library

Google Scholar

[2]

B. Awerbuch ~nd S. Even. Reliable broadcast protocols in unreliable networks. NETWORKS, 16:381-396, 1986.

Crossref

Google Scholar

[3]

Y. Afek and E. Gafni. End-to-end communication in uareliabel networks. May 1988. Submitted for Jou:'nal Publicatioa.

Google Scholar

[4]

B. Awerbuch ~nd Y. Mansour. An efficient topology update p:'otocol for dynamic networks. Jaatuary 1988. Technical Report, MIT.

Google Scholar

[5]

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}.

Google Scholar

[6]

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.

Google Scholar

[7]

K.A. Ba~-tlett, R. A. Scantlebury, ~nd P. T. Wilkiason. A aote on reliable full-duplex transmission over half-duplex links. Comm. of $he ACM, 12:260-261, 1969.

Digital Library

Google Scholar

[8]

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.

Google Scholar

[9]

S. G. Finn. Resynch procedures and fail-safe network protocol. IEEE Tranc. on Comm., COM-27:840-845, June 1979.

Crossref

Google Scholar

[10]

R.G. Gallager. Distributed Minimum Hop Algorithms. Technical Report LIDS-P-1175, M.I.T. Lab for Information and Decision Systems, January 1982.

Crossref

Google Scholar

[11]

J.Y. Halpern and L. D. Zuck. A little knowledge goes a long w~y: simple knowledge-based derivations and correctness proofs for a family of protocols. In Proceedings of the A CM Symp. on Principles of Distributed Computing, August 1987.

Digital Library

Google Scholar

[12]

L. Lamport. Time, clocks, and the ordering of events in a distributed system. CA CM, 21(7):558-565, July 1978.

Digital Library

Google Scholar

[13]

A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1), January 1983.

Google Scholar

Cited By

View all

Cheng ZLi ZSun BZhang SShao Y(2020)Reputation-based Q-Routing for Robust Inter-committee Routing in the Sharding-based Blockchain2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049(230-236)Online publication date: Aug-2020
https://doi.org/10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049
Prasad SZuck L(2016)Self-Similarity Breeds ResilienceElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.222.3222(30-44)Online publication date: 9-Aug-2016
https://doi.org/10.4204/EPTCS.222.3
Sterbenz JHutchison DÇetinkaya EJabbar ARohrer JSchöller MSmith P(2014)Redundancy, diversity, and connectivity to achieve multilevel network resilience, survivability, and disruption tolerance invited paperTelecommunications Systems10.1007/s11235-013-9816-956:1(17-31)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s11235-013-9816-9
Show More Cited By

Index Terms

End-to-end communication in unreliable networks
1. Networks
  1. Network protocols
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing

January 1988

303 pages

ISBN:0897912772

DOI:10.1145/62546

Chairman:
Danny Dolev
Hebrew Univ., Jerusalem

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC88

Sponsor:

PODC88: The seventh annual conference on Principles of distributed computing

August 15 - 17, 1988

Ontario, Toronto, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
561
Total Downloads

Downloads (Last 12 months)64
Downloads (Last 6 weeks)9

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cheng ZLi ZSun BZhang SShao Y(2020)Reputation-based Q-Routing for Robust Inter-committee Routing in the Sharding-based Blockchain2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049(230-236)Online publication date: Aug-2020
https://doi.org/10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00049
Prasad SZuck L(2016)Self-Similarity Breeds ResilienceElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.222.3222(30-44)Online publication date: 9-Aug-2016
https://doi.org/10.4204/EPTCS.222.3
Sterbenz JHutchison DÇetinkaya EJabbar ARohrer JSchöller MSmith P(2014)Redundancy, diversity, and connectivity to achieve multilevel network resilience, survivability, and disruption tolerance invited paperTelecommunications Systems10.1007/s11235-013-9816-956:1(17-31)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s11235-013-9816-9
Bochmann GAsaduzzaman S(2013)Distributed B-Tree with Weak ConsistencyRevised Selected Papers of the First International Conference on Networked Systems - Volume 785310.1007/978-3-642-40148-0_12(159-174)Online publication date: 2-May-2013
https://dl.acm.org/doi/10.1007/978-3-642-40148-0_12
Afek YGafni E(2013)Asynchrony from SynchronyDistributed Computing and Networking10.1007/978-3-642-35668-1_16(225-239)Online publication date: 2013
https://doi.org/10.1007/978-3-642-35668-1_16
Chechik SLangberg MPeleg DRoditty L(2012)f-Sensitivity Distance Oracles and Routing SchemesAlgorithmica10.5555/3118246.311861963:4(861-882)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.5555/3118246.3118619
Bunn POstrovsky R(2010)Asynchronous throughput-optimal routing in malicious networksProceedings of the 37th international colloquium conference on Automata, languages and programming: Part II10.5555/1880999.1881025(236-248)Online publication date: 6-Jul-2010
https://dl.acm.org/doi/10.5555/1880999.1881025
Lister R(2010)CS EDUCATION RESEARCHThe naughties in CSEd researchACM Inroads10.1145/1721933.17219421:1(22-24)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1721933.1721942
Clear T(2010)THINKING ISSUESManaging mid-project progress reviewsACM Inroads10.1145/1721933.17219381:1(14-15)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1721933.1721938
Gotterbarn D(2010)THINKING PROFESSIONALLYWhy bother with ethics in computingACM Inroads10.1145/1721933.17219351:1(9-10)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1145/1721933.1721935
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

An evolutionary approach to improve end-to-end performance in tcp/ip networks

End-to-end multicast congestion control and avoidance

End-to-end fault tolerance using transport layer multihoming