Designing an asynchronous group communication middleware for wireless users

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Designing an asynchronous group communication middleware for wireless users

Full text

Pdf (1.87 MB)

Source

International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems table of contents

Tenerife, Canary Islands, Spain

SESSION: Dissemination, multicast, routing table of contents

Pages 274-279

Year of Publication: 2009

ISBN:978-1-60558-616-8

Authors

Xuwen Yu	University of Notre Dame, Notre Dame, IN, USA
Surendar Chandra	None, Granger, IN, USA

Sponsor

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 3, 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/1641804.1641850 What is a DOI?

ABSTRACT

We evaluate an asynchronous gossiping middleware for wireless users that propagates messages from any group member to all the other group members. This propagation can either be implemented through distributed mechanisms or can be mediated through servers. Our analysis of asynchronous mechanisms using wireless user availability traces from an university, corporation and a hot spot federation shows that the fundamental impediment to the system performance is the wireless user availability patterns. We then investigate the relative performance for several distributed as well as server mediated approaches. We show that pull mechanisms effectively randomizes the times when messages are propagated and thus achieves better performance than push based mechanisms. We then develop an adaptive approach that customizes the propagation frequency using the last session duration and show that this mechanism exhibits good performance when the required propagation intervals are large. We also show that for a given number of gossips, it is preferable to propagate messages to all available nodes rather than increasing the frequency while correspondingly reducing the number of nodes to propagate messages. Our results allow middleware developers to choose the appropriate propagation model to satisfy their application constraints.

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	R. Bakhshi, F. Bonnet, W. Fokkink, and B. Haverkort. Formal analysis techniques for gossiping protocols. SIGOPS Oper. Syst. Rev., 41(5):28--36, 2007.
	2	M. Balazinska and P. Castro. CRAWDAD data set ibm/watson (v. 2003-02-19). http://crawdad.cs.dartmouth.edu/ibm/watson, Feb. 2003.
	3	K. Birman. The promise, and limitations, of gossip protocols. SIGOPS Oper. Syst. Rev., 41(5):8--13, 2007.
	4	S. Chandra and N. Regola. flockfs, a moderated group authoring system for wireless workgroups. In Mobiquitous '09, Toronto, Canada, July 2009.
	5	A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In ACM PODC, pages 1--12, Aug. 1987.
	6	S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In Sigcomm'04, pages 145--158, 2004.
	7	M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In Middleware '04, pages 79--98, New York, NY, USA, 2004. Springer-Verlag New York, Inc.
	8	G.H. Kuenning, R. Bagrodia, R.G. Guy, G.J. Popek, P.L. Reiher, and A.-I. Wang. Measuring the quality of service of optimistic replication. In ECOOP '98: Workshop ion on Object-Oriented Technology, pages 319--320, London, UK, 1998. Springer-Verlag.
	9	M. Kwiatkowska, G. Norman, and D. Parker. Analysis of a gossip protocol in prism. SIGMETRICS Perform. Eval. Rev., 36(3):17--22, 2008.
	10	M. Lenczner, B. Gregoire, and F. Proulx. CRAWDAD trace ilesansfil/wifidog/session/04_07 (v. 2007-08-27). http://crawdad.cs.dartmouth.edu/ilesansfil/wifidog/session/04_07, Aug. 2007.
	11	A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Duke University, July 2000.