Cost Based Data Dissemination in Broadcast Networks with Disconnection

We consider the problem of data dissemination in a broad- cast network. In contrast to previously studied models, broadcasting is among peers, rather than client server. Such a model represents, for example, satellite communication among widely distributed nodes, sensor networks, and mobile ad-hoc networks. We introduce a cost model for data dissemination in peer to peer broadcast networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost may be given in terms of dollars, energy, or bandwidth. Using the model we first determine the parameters for which eager (i.e. consistent) replication has a lower cost than lazy (i.e. inconsistent) replication. Then we introduce a lazy broadcast policy and compare it with several naive or traditional approaches to solving the problem.

[1]  Roger M. Needham,et al.  Experience with Grapevine: the growth of a distributed system , 1984, TOCS.

[2]  Richard A. Golding.  A Weak-Consistency Architecture for Distributed Information Services , 1992, Comput. Syst..

[3]  Andy Hopper,et al.  Piconet: embedded mobile networking , 1997, IEEE Wirel. Commun..

[4]  Liuba Shrira,et al.  Providing high availability using lazy replication , 1992, TOCS.

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

[6]  Elena Pagani,et al.  Reliable broadcast in mobile multihop packet networks , 1997, MobiCom '97.

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

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

[9]  Rafael Alonso,et al.  Data caching issues in an information retrieval system , 1990, TODS.

[10]  Bo Xu,et al.  Moving objects databases: issues and solutions , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[11]  Stanley B. Zdonik,et al.  Balancing push and pull for data broadcast , 1997, SIGMOD '97.

[12]  Dennis Shasha,et al.  The dangers of replication and a solution , 1996, SIGMOD '96.

[13]  Jennifer Widom,et al.  Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.

[14]  Stanley Zdonik,et al.  Prefetching from a broadcast disk , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[15]  Nitin H. Vaidya,et al.  Scheduling data broadcast to “impatient” users , 1999, MobiDe '99.

[16]  Lisa M. Brown,et al.  A survey of image registration techniques , 1992, CSUR.

[17]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.