Epidemic-Style Group Communication Algorithm ensuring Causal Order Delivery

KIPS Transactions on Computer and Communication Systems, Vol. 12, No. 2, pp. 137-144, Apr. 2005
10.3745/KIPSTA.2005.12.2.137,   PDF Download:


many reliable group communication algorithm were presented to satisfy predetermined message ordering properties in small or medium-scale distributed systems. However, the previous algorithm with their strong reliability properties may be unappropriate for large-scale systems. To address this issue, some epidemic-style group communication algorithms were proposed for considerably improving scalability while guaranteeing the reasonably weaker reliability property than the existing ones. The algorithms are all designed for ensuring the atomic order message delivery property. But, some distributed applications such as multimedia systems and collaborative work, may require only the weaker message ordering property, i.e., causal order delivery. This paper proposes an efficient epidemic-style group communication algorithm ensuring causal order delivery to provide the indigenous scalability of the epidemic-style approach.

Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article
[IEEE Style]
C. Y. Kim and J. H. Ahn, "Epidemic-Style Group Communication Algorithm ensuring Causal Order Delivery," KIPS Journal A (2001 ~ 2012) , vol. 12, no. 2, pp. 137-144, 2005. DOI: 10.3745/KIPSTA.2005.12.2.137.

[ACM Style]
Cha Young Kim and Jin Ho Ahn. 2005. Epidemic-Style Group Communication Algorithm ensuring Causal Order Delivery. KIPS Journal A (2001 ~ 2012) , 12, 2, (2005), 137-144. DOI: 10.3745/KIPSTA.2005.12.2.137.