Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Using adaptive timeouts to achieve at-most-once message delivery 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

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

Loading next page...
 
/lp/springer-journals/using-adaptive-timeouts-to-achieve-at-most-once-message-delivery-0WRv2CIU0t

References (13)

Publisher
Springer Journals
Copyright
Copyright © Springer-Verlag 1995
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/s004460050013
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Distributed ComputingSpringer Journals

Published: Dec 1, 1995

Keywords: At-most-once message delivery; Communication algorithms; Synchronized clocks; Adaptive algorithms

There are no references for this article.