Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2005.12A.2.137

Epidemic-Style Group Communication Algorithm ensuring Causal Order Delivery  

Kim Chayoung (고려대학교 컴퓨터학과)
Ahn Jinho (경기대학교 전자계산학과)
Publication Information
The KIPS Transactions:PartA / v.12A, no.2, 2005 , pp. 137-144 More about this Journal
Abstract
Many reliable group communication algorithms were presented to satisfy predetermined message ordering properties in small or medium-scale distributed systems. However, the previous algorithms 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.
Keywords
분산시스템;그룹통신;전염형 알고리즘;확장성;메시지 전달 순서;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Hayden and K. Birman, 'Probabilistic broadcast', Technical Report TR96-1606, Cornell University, Computer Science, Sept. 1996
2 D. Kempe and J. Kleinberg, 'Protocols and impossibility for gossip-based communication mechanisms,' In Proc. of IEEE Symposium on Foundations of Computer Science, pp.417-480, Vancouver, Canada, Nov. 2002   DOI
3 A.-M. Kermarrec, L. Massoulie and A. J. Ganesh, 'Probabilistic reliable dissemination in large-scale systems,' IEEE Transactions on Parallel and Distributed Systems, Vol.14, No.3, pp.248-258, Mar. 2003   DOI   ScienceOn
4 M.-J. Lin and K. Marzullo, 'Directional gossip:Gossip in a wide-area network,' Technical Report CS1999-0622, University of California, San Diego, Computer Science and Engineering, June 1999
5 D. S. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins and Z. Xu, 'Peer-to-Peer Computing,' Technical Report HPL-2002-57, HP Laboratories, Palo Alto, Mar. 2002
6 F. J. N. Cosquer and P. Verissimo, 'Survey of selected groupware applications and supporting platforms,' Technical Report RT-21-94, INESC, 1994
7 A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehar and D. Terry, 'Epidemic algorithms for replicated database maintenance,' In Proc. of the 6th ACM Symposium on Principles of Distributed Computing, pp.1-12, VanCouver, BC. Canada, Aug. 1987   DOI
8 P. Eugster, S. Handurukande, R. Guerraoui, A.-M. Kermarrec and P. Kouznetsov, 'Lightweight probabilistic broadcast,' In Proc. of the international Conference on Dependable Systems and Networks, pp.443-452, 2001   DOI
9 P. Felber and F. Pedone, 'Probabilistic Atomic Broadcast,' Hewlett-Packard Technical Report HPL-2002-69, 2002
10 S. Floyd, V. Jacobson, C-G. Liu, S. McCanne and L. Zhang, 'A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing,' IEEE/ACM Transactions on Networking, pp.784-803, Dec. 1997   DOI   ScienceOn
11 A. J. Ganesh, A.-M. Kermarrec and L. Massoulie, 'SCAMP: Peer-to-Peer lightweight membership service for large-scale group communication,' In Proc. of the 3rd International Workshop on Networked Group Communications, London, UK., Nov. 2001
12 A. J. Ganesh, A.-M. Kermarrec and L. Massoulie, 'HiScamp: self-organizing hierarchical membership protocol,' In Proc. of the 10th European ACM SIGOPS WorkShop, Sept. 2002   DOI
13 K. Guo, M. Hayden, R. V. Renesse, W. Vogels and K. P. Birman, 'GSGC An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast,' Technical Report TR97-1656, Cornell University, Computer Science, Dec. 1997
14 M. Castro, P. Druschel, A-M. Kermarrec and A. Rowstron, 'SCRIBE: A Large-Scale and Decentralized Application-Level Multicast Infrastructure,' IEEE Journal of Selected Areas in Communications, Vol.20, No.8, Oct. 2002   DOI   ScienceOn
15 K. P. Birman and T. A. Joseph, 'Reliable Communication in the Presence of Failures,' ACM Transactions on Computer Systems, Vol.5, No.1, pp.47-76, 1987   DOI   ScienceOn
16 K. P. Birman, A. Schiper and P. Stephenson, 'Lightweight causal and atomic group multicast,' ACM Transactions on Computer Systems, Vol.9, No.3, pp.272-314, 1991   DOI
17 K. P. Birman, M. Hayden, O. Ozkasap. Z. Xiao, M. Budiu and Y. Minsky, 'Bimodal Multicast,' ACM Transactions on Computer Systems, Vol.17, No.2, pp.41-88, 1999   DOI
18 S. Ratnasamy, M. Handley, R. Karp and S. Shenker, 'Application-level multicast using content-addressable networks,' In Proc. of the 3rd International Workshop on Networked Group Communication. Nov. 2001
19 S. Paul, K. Sabnani, J. Lin and S. Bhattacharyya, 'Reliable Multicast Transport Protocol(RMTP),' IEEE Journal on Selected Areas in Communications, Vol.15, No.3, pp.407-421, Apr. 2000   DOI   ScienceOn
20 D. Pendarakis, S. Shi, D. Verma and M. Waldvogel, 'ALMI:An application level multicast infrastructure,' In Proc. of the 3rd USNIX Symposium on internet Technologies and Systems, pp.49-60, San Francisco, CA, USA, Mar. 2001
21 R. V. Renesse, Y. Minsky and M. Hayden, 'A Gossip-Style Failure Detection Service,' Technical Report TR98-1687, Cornell University, May 1998
22 I. Gupta, R van Renesse and K. P. Birman, 'A probabilistically correct leader election protocol for large groups,' In Procs of the 14th International Symposium on Distributed Computing, pp.89-103, Toledo, Spain, Oct. 2000