A causal multicast protocol for dynamic groups in cellular networks

Group communication is an abstraction which deals with multicasting a message from a source process to a group of processes. In Group Communication Systems (GCS), causal message ordering is an essential tool to ensure interaction among group members in a consistent way. In this paper, we propose a simple and optimal causal multicast protocol which copes with the dynamically changing groups in mobile environments. The protocol presents an optimal communication overhead without causing inhibition effect in the delivery of messages. The group membership management depends on a simple, yet powerful idea. This original idea consists in considering the join and leave requests as data messages, and then will be ordered with other messages. This makes no need to a coordination phase in the installation of a new view. Our protocol requires minimal resources on mobile hosts and wireless links and scales well with large groups.

[1]  André Schiper,et al.  A New Algorithm to Implement Causal Ordering , 1989, WDAG.

[2]  Stephen John Turner,et al.  Critical causal order of events in distributed virtual environments , 2007, TOMCCAP.

[3]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[4]  Sridhar Alagar.  Causally Ordered Message Delivery in Mobile Systems , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[5]  Ajay D. Kshemkalyani,et al.  Causal multicast in mobile networks , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[6]  Hrushikesha Mohanty,et al.  Causal ordering in event notification service systems for mobile users , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[7]  Mukesh Singhal,et al.  Dependency sequences and hierarchical clocks: Efficient alternatives to vector clocks for mobile computing systems , 1997, Wirel. Networks.

[8]  B. R. Badrinath,et al.  A framework for delivering multicast messages in networks with mobile hosts , 1996, Mob. Networks Appl..

[9]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[10]  Ajay D. Kshemkalyani,et al.  An optimal algorithm for generalized causal message ordering , 1996, PODC '96.

[11]  Li-Hsing Yen,et al.  A causal multicast protocol for mobile distributed systems , 2000 .

[12]  Giuseppe Anastasi,et al.  A Reliable Multicast Protocol for Distributed Mobile Systems: Design and Evaluation , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  André Schiper,et al.  The Causal Ordering Abstraction and a Simple Way to Implement it , 1991, Inf. Process. Lett..

[14]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[15]  Li-Hsing Yen,et al.  A protocol for causally ordered message delivery in mobile computing systems , 1997, Mob. Networks Appl..

[16]  Nadjib Badache,et al.  Mobi_Causal: a protocol for causal message ordering in mobile computing systems , 2005, MOCO.

[17]  Ting-Lu Huang,et al.  A Mobile-Support-Station-Based Causal Multicast Algorithm in Mobile Computing Environment , 1999 .

[18]  Mukesh Singhal,et al.  An efficient causal ordering algorithm for mobile computing environments , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.