A causal multicast protocol for dynamic groups in cellular networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A causal multicast protocol for dynamic groups in cellular networks

Full text

Pdf (498 KB)

Source

Euro American Conference On Telematics And Information Systems archive
Proceedings of the 2008 Euro American Conference on Telematics and Information Systems table of contents

Aracaju, Brazil

Article No. 5

Year of Publication: 2008

ISBN:978-1-59593-988-3

Authors

Chafika Benzaid	LSI, USTHB, Bab Ezzaouar, Alger, Algérie
Nadjib Badache	LSI, USTHB, Bab Ezzaouar, Alger, Algérie

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): , Downloads (12 Months): , Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1621087.1621092 What is a DOI?

ABSTRACT

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Acharya and B. R. Badrinath. A framework for delivering multicast messages in networks with mobile hosts. ACM/Baltzer Mob. Netw. and Applications, 1(2):199--219, June 1996.
	2	S. Alagar and S. Venkatesan. Causally ordered message delivery in mobile systems. In Proc. Workshop on Mob. Comput. Syst. and Appl., pages 169--174, Dec. 1994.
	3	G. Anastasi, A. Bartoli, and F. Spadoni. A reliable multicast protocol for distributed mobile systems: Design and evaluation. IEEE Trans. Parallel and Dist. Syst., 12(10):1009--1022, Oct. 2001.
	4	C. Benzaid and N. Badache. Mobi_causal: a protocol for causal message ordering in mobile computing systems. SIGMOBILE Mob. Comput. Commun. Rev., 9(2):19--28, April 2005.
	5	K. Birman and T. Joseph. Reliable communication in the presence of failures. ACM Trans, on Comput. Syst, 5(1):47--76, Feb. 1987.
	6	P. Chandra and A. D. Kshemkalyani. Causal multicast in mobile networks. In Proc. of the the IEEE Computer Society's 12th Annual intl Symposium on Modeling, Analysis, and Simulation of Computer and Telecommun. Syst. (Mascots'04), pages 213--220, Oct. 2004.
	7	K. Chi, L. Yen, C. Tseng, and T. Huang. A causal multicast protocol for mobile distributed systems. IEICE TRANS. INF. & SYST., E83-D(12):2065--2074, Dec. 2000.
	8	A. D. Kshemkalyani and M. Singhal. An optimal algorithm for generalized causal message ordering. In Proc. of the 15th ACM Symposium on Principles of Dist. Comput., page 87, May 1996.
	9	L. Lamport. Time, clocks and the ordering of events in a distributed system. Commun. of the ACM, 21(7):558--565, July 1978.
	10	C. Li and T. Huang. A mobile-support-station-based causal multicast algorithm in mobile computing environment. Proc. Nat. Science Council, ROC(A), 23(1):100--110, 1999.
	11	C. Lwin, H. Mohanty, and R. Ghosh. Causal ordering in event notification service systems for mobile users. In Proc. of the Intel. Conf. on Information Technology: Coding and Computing (ITCCŠK04), 2004.
	12	R. Prakash, M. Raynal, and M. Singhal. An efficient causal ordering algorithm for mobile computing environments. In Proc. of the 16th intl. Conf. on Dist. Comput. Syst., pages 744--751. ICDCS '96, May 27--30 1996.
	13	R. Prakash and M. Singhal. Dependency sequences and hierarchical clocks: efficient alternatives to vector clocks for mobile computing systems. Wireless Netw., 3(5):349--360, Oct. 1997.
	14	M. Raynal, A. Schiper, and S. Toueg. The causal ordering abstraction and a simple way to implement it. Inf. Process. Lett., 39(6):343--350, Oct. 1991.
	15	A. Schiper, K. Birman, and P. Stephenson. Lightweight causal and atomic group multicast. ACM Trans. Comput. Syst., 9(3):272--314, Aug. 1991.
	16	A. Schiper, J. Eggli, and A. Sandoz. A new algorithm to implement causal ordering. Proc. of the 3rd Intl. Workshop on Dist. Algorithms, In Lecture Notes in Computer Science, 392:219--232, Sept. 1989.
	17	C. Skawratananond, N. Mittal, and V. K. Garg. A lightweight algorithm for causal message ordering in mobile computing systems. In Proc. of 12th ISCA Intl. Conf. on Parallel and Dist. Comput. Syst., pages 245--250. PDCS, 1999.
	18	L. Yen, T. Huang, and S. Hwang. A protocol for causally ordered message delivery in mobile computing systems. Mob. Netw. Appl., 2(4):365--372, Dec. 1997.
	19	S. Zhou, W. Cai, S. Turner, and B. Lee. Critical causal order of events in distributed virtual environments. ACM Trans, on Multimedia Computing, Commun. and Applica., 3(3), Aug. 2007.