Cost Based Data Dissemination in Broadcast Networks

  • Bo Xu
  • Ouri Wolfson
  • Sam Chamberlain
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1973)


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.


Data Item Communication Cost Late Version Local Database Version Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Alonso, D. Barbara, and H. Garcia-Molina, Data Caching Issues in an Information Retrieval System, ACM Transactions on Database Systems, Vol. 15, No. 3, Sept. 1990.Google Scholar
  2. 2.
    R. Ladin, B. Liskov, S. Ghemawat, Providing High Availability Using Lazy Replication, ACM Transactions on Computer Systems, Vol. 10, No. 4, November 1992.Google Scholar
  3. 3.
    K. Birman, A. Schiper, P. Stephenson, Lightweight Causal and Atomic Group Multicast, ACM Transactions on Computer Systems, Vol. 9, No. 3, August 1991.Google Scholar
  4. 4.
    K. Birman, T. A. Joseph, Reliable Communication in the Presence of Failures,ACM Transactions on Computer Systems, Vol. 5, No. 1, Feb. 1987.Google Scholar
  5. 5.
    L. G. Brown, A Survey of Image Registration Techniques, ACM Computing Surveys, 24(4):325–376, December 1992.CrossRefGoogle Scholar
  6. 6.
    J. P. Macker and M. S. Corson, Mobile Ad Hoc Networking and the IETF, Mobile Computing and Communications Review, Vol. 2, No. 1, January 1998.Google Scholar
  7. 7.
    C. Olston, J. Widom, Offering a precision-performance tradeoff for aggregation queries over replicated data,
  8. 8.
    A. Schiper, J. Eggli, and A. Sandoz, A new algorithm to implement causal ordering,in the Proceedings of the 3rd International Workshop on Distributed Algorithms, Lecture Notes on Computer Science392, Springer-Verlag, New York, 1989.Google Scholar
  9. 9.
    E. Pagani and G. P. Rossi, Reliable Broadcast in Mobile Multihop Packet Networks, Proc. ACM MOBICOM’97, pp. 34–42, Budapest, Hungary, 1997.Google Scholar
  10. 10.
    J. Gray, P. Helland, P. O’Neil, D. Shasha, The dangers of replication and a solution, Proc. ACM SIGMOD 96, pp. 173–182, Montreal, Canada, 1996.Google Scholar
  11. 11.
    S. Jiang, N. H. Vaidya, Scheduling data broadcast to “impatient” users, Proceedings of ACM International Workshop on Data Engineering for Wireless and Mobile Access, Seattle, Washington, August 1999.Google Scholar
  12. 12.
    J. M. Kahn, R. H. Katz and K. S. J. Pister, Next century challenges: mobile networking for “Smart Dust”, Proceedings of the fifth ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM99), Seattle, WA, August, 1999.Google Scholar
  13. 13.
    O. Wolfson, B. Xu, S. Chamberlain, L. Jiang, Moving Objects Databases: Issues and Solutions, Proceedings of the 10th International Conference on Scientific and Statistical Database Management (SSDBM98), Capri, Italy, July 1-3, 1998, pp. 111–122.Google Scholar
  14. 14.
    F. Bennett, D. Clarke, J. Evans, A. Hopper, A. Jones, and D. Leask, Piconet: Embedded Mobile Networking, IEEE Personal Communications, 4(5), October 1997.Google Scholar
  15. 15.
    M. D. Schroeder, A. D. Birrell, R. M. Needham, Experience with Grapevine: the growth of a distributed system, ACM Transactions on Computer Systems, vol. 2, No. 1, pp. 3–23, Feb. 1984.CrossRefGoogle Scholar
  16. 16.
    R. Golding, A weak-consistency architecture for distributed information services, Computing Systems, vol. 5, No. 4, 1992. Usenix Association.Google Scholar
  17. 17.
    S. Chamberlain, Model-Based Battle Command: A Paradigm Whose Time Has Come, 1995 Symposium on C2 Research & Technology, NDU, June 1995Google Scholar
  18. 18.
    A. S. Tanenbaum, Computer networks, Prentice Hall, 1996.Google Scholar
  19. 19.
    S. Acharya, M. Franklin, S. Zdonik, Balancing push and pull for data broadcast, Proc. ACM SIGMOD 97, pp. 183–194, Tucson, Arizona, 1997.Google Scholar
  20. 20.
    S. Acharya, M. Franklin, and S. Zdonik, Prefetching from a broadcast disk, in 12th International Conference on Data Engineering, Feb. 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Bo Xu
    • 1
  • Ouri Wolfson
    • 1
  • Sam Chamberlain
    • 2
  1. 1.University of IllinoisChicago
  2. 2.Army Research LaboratoriesChicago

Personalised recommendations