This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Causal Broadcasting with Positive Acknowledgments and Bounded-Length Counters
October 2004 (vol. 53 no. 10)
pp. 1355-1358
A causal broadcast protocol was proposed earlier in [1]. Two extensions of the protocol were also proposed in order to improve its throughput and bandwidth utilization. In this paper, we show that both extensions are not live, i.e., there may be execution patterns in which processes stop delivering messages. We also show that the algorithm for the second extension does not satisfy the requirements on which its correctness was established. Finally, we provide fixed versions of both extensions and prove their correctness.

[1] R. Baldoni, A Positive Acknowledgment Protocol for Causal Broadcasting IEEE Trans. Computers, vol. 47, no. 12, pp. 1341-1350, Dec. 1998.
[2] F. Mattern, Virtual Time and Global States in Distributed Systems Proc. Int'l Workshop Parallel and Distributed Algorithms, pp. 215-226, Oct. 1989.
[3] C.J. Fidge, "Logical Time in Distributed Computing Systems," Computer, pp. 28-33, Aug. 1991.
[4] L. Lamport, Time, Clocks and the Ordering of Events in a Distributed System Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.

Index Terms:
Happened-before relation, vector times, multicast, sliding windows, asynchrony.
Citation:
Giuseppe Anastasi, Alberto Bartoli, Giacomo Giannini, "On Causal Broadcasting with Positive Acknowledgments and Bounded-Length Counters," IEEE Transactions on Computers, vol. 53, no. 10, pp. 1355-1358, Oct. 2004, doi:10.1109/TC.2004.82
Usage of this product signifies your acceptance of the Terms of Use.