Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Mills (1991)
Internet time synchronization: the network time protocolRFC, 1129
L. Lamport (1978)
Time, clocks, and the ordering of events in a distributed systemCommun. ACM, 21
D. Comer, D. Stevens (1988)
Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition
R. Jain (1998)
Divergence of Timeout Algorithms for Packet RetransmissionsArXiv, cs.NI/9809097
J. Steiner, C. Neuman, J. Schiller (1988)
An authentication service for open network systems
D. Comer (1995)
Principles, protocols, and architecture
Lixia Zhang (1986)
Why TCP timers don't work well
L. Lamport, P. Melliar-Smith (1985)
Synchronizing clocks in the presence of faultsJ. ACM, 32
B. Liskov, L. Shrira, J. Wroclawski (1989)
Efficient at-most-once messages based on synchronized clocksProceedings of the Second Workshop on Workstation Operating Systems
DL Mills (1991)
Internet time synchronization: the network time protocolIEEE Trans Commun, 39
B Liskov, L Shrira, J Wroclawski (1991)
Efficient at-most-once messages based on synchronized clocksACM Trans Comput Syst, 9
M. Herlihy, M. McKendry (1989)
Timestamp-Based Orphan EliminationIEEE Trans. Software Eng., 15
B. Liskov (1991)
Practical uses of synchronized clocks in distributed systemsDistributed Computing, 6
SummaryWe extend the at-most-once message delivery algorithm of Liskov, Shrira, and Wroclawski to adapt dynamically to changes in message transmission time and degree of clock synchronization. The performance of their algorithm depends on its being supplied with a good estimate of the maximum message lifetime — the sum of the message delivery time and the difference in processor clock values between sender and recipient. We present two algorithms that are suitable for use in a system where the message lifetime is unknown or may change. Our extensions allow the automatic and continuous determination of a suitable value for the maximum lifetime. We prove that whenever the actual message lifetime is bounded, then our adaptive algorithms converge to an accurate estimate of its true value. Our two algorithms differ in the behavior they require from the network and achieve different performance levels. Our formal statement of convergence is expressed in terms of the number of messages received, rather than time elapsed. We show that this formulation is necessary by proving that no method for estimating the lifetime can achieve convergence in a bounded amount of time.
Distributed Computing – Springer Journals
Published: Dec 1, 1995
Keywords: At-most-once message delivery; Communication algorithms; Synchronized clocks; Adaptive algorithms
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.