Article

Free access

Bootstrap network resynchronization (extended abstract)

Authors:

Yehuda Afek,

Eli GafniAuthors Info & Claims

PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing

Pages 295 - 307

https://doi.org/10.1145/112600.112625

Published: 01 July 1991 Publication History

PDF eReader

References

[1]

Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. of the 28th IEEE Annual Syrup. on Foundation of Computer Science, pages 358-370, October 1987.

Digital Library

Google Scholar

[2]

H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. In Proc. of the Ninth Annual A CM Syrup. on Principles of Distributed Computing (PODC), pages 363-375, August 1990.

Digital Library

Google Scholar

[3]

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

Crossref

Google Scholar

[4]

H. Attiya, M. J. Fischer, D. Wang, and L. D. Zuck. Reliable communication using unreliable channels. Manuscript, 1988.

Google Scholar

[5]

Y. A~ek and E. Gafni. End-toend communication in unreliabel networks. In Proc. of the Seventh A CM Syrup. on Principles of Distributed Computing, pages 131-148, August 1988.

Digital Library

Google Scholar

[6]

Y. Afek, E. Gafni, and A. Rosen. Optimal fault tolerant file transfer protocol. Extended Abstract, April 1990.

Google Scholar

[7]

B. Awerbuch, Y. Mansour, and N. Shavit. Polynomial end to end communication. In Proc. of the 30th IEEE Annual Syrup. on Foundation of Computer Science, pages 358-363, October 1989.

Digital Library

Google Scholar

[8]

K.A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Comm. of the A CM, 12:260-261, 1969.

Digital Library

Google Scholar

[9]

E.W. Dijkstra and W. H. J. Feijin. A Method of Programming. Addison-Wesley, 1988.

Digital Library

Google Scholar

[10]

W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11-1'1-4, August 1980.

Google Scholar

[11]

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

Crossref

Google Scholar

[12]

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

[13]

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

Digital Library

Google Scholar

[14]

M.O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the A CM, 36(2):3315- 348, 1989.

Digital Library

Google Scholar

[15]

A. Segall. Distributed network protocols. IEEE Trans. on l'nformation Theory, IT-29(1), Ja.nuary 1983.

Google Scholar

[16]

F.R. Soloway and P. A. Humblet. On distributed network protocols for changing topologies. Technical report, MIT, May 1986. Report LIDC-P-1564 MIT Laboratory for Inf. and Dec. Sys.

Google Scholar

Cited By

View all

Awerbuch BCidon IKutten S(2008)Optimal maintenance of a spanning treeJournal of the ACM10.1145/1391289.139129255:4(1-45)Online publication date: 18-Sep-2008
https://dl.acm.org/doi/10.1145/1391289.1391292
Fraigniaud PGavoille C(2006)Header-size lower bounds for end-to-end communication in memoryless networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2005.09.02550:10(1630-1638)Online publication date: 14-Jul-2006
https://dl.acm.org/doi/10.1016/j.comnet.2005.09.025
Dolev SWelch J(2005)Crash resilient communication in dynamic networksDistributed Algorithms10.1007/3-540-57271-6_32(129-144)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_32
Show More Cited By

Index Terms

Bootstrap network resynchronization (extended abstract)

Recommendations

Total acknowledgements (extended abstract): a robust feedback mechanism for end-to-end congestion control

End-to-end data transport protocols have two main functions: error recovery and congestion control. The information required by the sender to perform these functions is provided by acknowledgements (ACKs) from the receiver. The Internet transport ...
Total acknowledgements (extended abstract): a robust feedback mechanism for end-to-end congestion control
SIGMETRICS '98/PERFORMANCE '98: Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

End-to-end data transport protocols have two main functions: error recovery and congestion control. The information required by the sender to perform these functions is provided by acknowledgements (ACKs) from the receiver. The Internet transport ...
Resynchronization attacks on WG and LEX
FSE'06: Proceedings of the 13th international conference on Fast Software Encryption

WG and LEX are two stream ciphers submitted to eStream – the ECRYPT stream cipher project. In this paper, we point out security flaws in the resynchronization of these two ciphers. The resynchronization of WG is vulnerable to a differential attack. For ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing

July 1991

355 pages

ISBN:0897914392

DOI:10.1145/112600

Chairman:
Luigi Logrippo
Univ. of Ottawa

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 July 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC91

Sponsor:

PODC91: 10th Annual ACM Symposium in Principles of Distibuted Computing

August 19 - 21, 1991

Quebec, Montreal, Canada

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
233
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)4

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Awerbuch BCidon IKutten S(2008)Optimal maintenance of a spanning treeJournal of the ACM10.1145/1391289.139129255:4(1-45)Online publication date: 18-Sep-2008
https://dl.acm.org/doi/10.1145/1391289.1391292
Fraigniaud PGavoille C(2006)Header-size lower bounds for end-to-end communication in memoryless networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2005.09.02550:10(1630-1638)Online publication date: 14-Jul-2006
https://dl.acm.org/doi/10.1016/j.comnet.2005.09.025
Dolev SWelch J(2005)Crash resilient communication in dynamic networksDistributed Algorithms10.1007/3-540-57271-6_32(129-144)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57271-6_32
Awerbuch BMansour Y(2005)An efficient topology update protocol for dynamic networksDistributed Algorithms10.1007/3-540-56188-9_13(185-202)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-56188-9_13
Fraigniaud PGavoille C(2003)Lower Bounds for Oblivious Single-Packet End-to-End CommunicationDistributed Computing10.1007/978-3-540-39989-6_15(211-223)Online publication date: 2003
https://doi.org/10.1007/978-3-540-39989-6_15
Fich FJakoby A(2002)Short Headers Suffice for Communication in a DAG with Link FailuresDistributed Computing10.1007/3-540-40026-5_24(360-373)Online publication date: 15-Mar-2002
https://doi.org/10.1007/3-540-40026-5_24
Adler MFich FCoan BWelch J(1999)The complexity of end-to-end communication in memoryless networksProceedings of the eighteenth annual ACM symposium on Principles of distributed computing10.1145/301308.301364(239-248)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301308.301364
Dolev SWelch J(1997)Crash Resilient Communication in Dynamic NetworksIEEE Transactions on Computers10.1109/12.55979946:1(14-26)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1109/12.559799
Afek YAwerbuch BGafni EMansour YRosén AShavit N(1997)Slide-The Key to Polynomial End-to-End CommunicationJournal of Algorithms10.1006/jagm.1996.081922:1(158-186)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1006/jagm.1996.0819
Kushilevitz EOstrovsky RRosén ALeighton FBorodin A(1995)Log-space polynomial end-to-end communicationProceedings of the twenty-seventh annual ACM symposium on Theory of computing10.1145/225058.225273(559-568)Online publication date: 29-May-1995
https://dl.acm.org/doi/10.1145/225058.225273
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

Total acknowledgements (extended abstract): a robust feedback mechanism for end-to-end congestion control

Total acknowledgements (extended abstract): a robust feedback mechanism for end-to-end congestion control

Resynchronization attacks on WG and LEX