Using adaptive timeouts to achieve at-most-once message delivery-Reference-Cited by-同舟云学术

Using adaptive timeouts to achieve at-most-once message delivery

Published:1995-12 Issue:3 Volume:9 Page:109-117
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib Comput

Author:

Chaudhuri Soma,Coan Brian A.,Welch Jennifer L.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s004460050013.pdf

Reference10 articles.

1. Comer D: Internetworking with TCP/IP: principles, protocols, and architecture. Prentice Hall, Englewood Cliffs 1988

2. Herlihy MP, McKendry M: Timestamp-based orphan elimination. IEEE Trans Softw Eng 15(7): 825–831 (1989)

3. Jain R: Divergence of timeout algorithms for packet retransmissions. Proc. 5th Annual International Phoenix Conference on Computers and Communications 1986, pp 174–179

4. Lamport L: Time, clocks, and the ordering of events in a distributed system. Commun ACM 27(7): 558–565 (1978)

5. Lamport L, Melliar-Smith P: Synchronizing clocks in the presence of faults. J ACM 32(1): 52–78 (1985)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the at-most-once problem with nearly optimal effectiveness;Theoretical Computer Science;2013-07

2. The Strong At-Most-Once Problem;Lecture Notes in Computer Science;2012

3. Solving the At-Most-Once Problem with Nearly Optimal Effectiveness;Distributed Computing and Networking;2012

4. At-Most-Once Semantics in Asynchronous Shared Memory;Lecture Notes in Computer Science;2009