Skip to main content
SpringerLink
Log in

Cost Based Data Dissemination in Satellite Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

We consider the problem of data dissemination in a broadcast 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, M. Franklin and S. Zdonik, Prefetching from a broadcast disk, in: 12th International Conference on Data Engineering (February 1996).

  2. S. Acharya, M. Franklin and S. Zdonik, Balancing push and pull for data broadcast, in: Proc. ACM SIGMOD'97, Tucson, Arizona (1997) pp. 183–194.

  3. P.K. Agarwal, L. Arge and J. Erickson, Indexing moving points, in: ACM PODS'2000 (to appear).

  4. R. Alonso, D. Barbara and H. Garcia-Molina, Data caching issues in an information retrieval system, ACM Transactions on Database Systems 15(3) (September 1990).

  5. K. Birman and T.A. Joseph, Reliable communication in the presence of failures, ACM Transactions on Computer Systems 5(1) (February 1987).

  6. K. Birman, A. Schiper and P. Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems 9(3) (August 1991).

  7. Y. Breitbart, R. Komondoor, R. Rastogi and S. Seshadri, Update propagation protocols for replicated databases, in: Proceedings of ACM SIGMOD' 99, Philadelphia, PA (June 1999).

  8. Y. Breitbart and H.F. Korth, Replication and consistency in a distributed environment, Journal of Computer and System Sciences 59(1) (August 1999).

  9. L.G. Brown, A survey of image registration techniques, ACM Computing Surveys 24(4) (December 1992) 325–376.

    Google Scholar 

  10. A. Demers, D. Greene et al., Epidemic algorithms for replicated database maintenance, Operating Systems Review 22(1) (January 1988) 8–32.

    Google Scholar 

  11. C. Fidge, Timestamps in message-passing systems that preserve the partial ordering, in: Proceedings of the 11th Australian Computer Science Conference (1988).

  12. R. Golding, A weak-consistency architecture for distributed information services, Usenix Association, Computing Systems 5(4) (1992).

  13. J. Gray, P. Helland, P. O'Neil and D. Shasha, The dangers of replication and a solution, in: Proc. ACM SIGMOD'96, Montreal, Canada (1996) pp. 173–182.

  14. G. Grimmett and D. Welsh, Probability: an Introduction (Clarendon Press, 1986).

  15. J. Holliday, D. Agrawal and A.E. Abbadi, Planned disconnections for mobile databases, in: Proceedings of the 11th International IEEE Workshop on Database and Expert Systems (DEXA 2000) (2000).

  16. J. Holliday, D. Agrawal and A.E. Abbadi, Exploiting planed disconnections in mobile environments, in: Proceedings of the 10th IEEE Workshop on Research Issues in Data Engineering (RIDE2000) (February 2000) pp. 25–29.

  17. T. Imielinski and B. Badrinath, Mobile wireless computing: challenges in data management, CACM 37(10) (October 1994).

  18. S. Jiang and N.H. Vaidya, Scheduling data broadcast to “impatient” users, in: Proceedings of ACM International Workshop on Data Engineering for Wireless and Mobile Access, Seattle, Washington (August 1999).

  19. P. Keleher, Decentralized replicated-object protocols, in: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (April 1999).

  20. G. Kollios, D. Gunopulos and V.J. Tsotras, On indexing mobile objects, in: Proceedings of the Eighteenth ACM SIGMOD-SIGACTSIGART Symposium on Principles of Database Systems, Philadelphia, PA (1999).

  21. G. Kollios, D. Gunopulos and V.J. Tsotras, Nearest neighbor queries in a mobile environment, in: Workshop on Spatio-Temporal Database Management, Edinburgh, Scotland (1999).

  22. R. Kravets and P. Krishnan, Power management techniques for mobile communications, in: MOBICOM'98, Dallas, TX (1998).

  23. R. Ladin, B. Liskov and S. Ghemawat, Providing high availability using lazy replication, ACM Transactions on Computer Systems 10(4) (November 1992).

  24. B. Liskov, R. Scheifler, E.Walker and W. Weihl, Orphan detection (extended abstract), in: Proceedings of the 17th International Symposium on Fault-Tolerant Computing (July 1987).

  25. J.P. Macker and M.S. Corson, Mobile ad hoc networking and the IETF, Mobile Computing and Communications Review 2(1) (January 1998).

  26. F. Mattern, Virtual time and global states of distributed systems, in: Proceedings of the International Workshop on Parallel and Distributed Algorithms (North-Holland, 1989).

  27. C. Olston and J. Widom, Offering a precision-performance tradeoff for aggregation queries over replicated data, http://www-db. stanford.edu/pub/papers/trapp-ag.ps

  28. E. Pagani and G.P. Rossi, Reliable broadcast in mobile multihop packet networks, in: Proc. ACM MOBICOM'97, Budapest, Hungary (1997) pp. 34–42.

  29. A. Schiper, J. Eggli and A. Sandoz, A new algorithm to implement causal ordering, in: Proceedings of the 3rd International Workshop on Distributed Algorithms, Lecture Notes on Computer Science, Vol. 392 (Springer-Verlag, New York, 1989).

    Google Scholar 

  30. M.D. Schroeder, A.D. Birrell and R.M. Needham, Experience with Grapevine: the growth of a distributed system, ACM Transactions on Computer Systems 2(1) (February 1984) 3–23.

    Google Scholar 

  31. P. Sistla, O. Wolfson, S. Chamberlain and S. Dao, Modeling and querying moving objects, in: Proceedings of the Thirteenth International Conference on Data Engineering (ICDE13), Birmingham, UK (April 1997).

  32. A.S. Tanenbaum, Computer Networks (Prentice Hall, 1996).

  33. O. Wolfson, B. Xu, S. Chamberlain and L. Jiang, Moving objects databases: Issues and solutions, in: Proceedings of the 10th International Conference on Scientific and Statistical Database Management (SSDBM98), Capri, Italy (July 1—3, 1998) pp. 111–122.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Illinois, Chicago, USA

    Bo Xu & Ouri Wolfson

  2. Army Research Laboratory, USA

    Sam Chamberlain

  3. School of Computer Science, Florida International University, University Park, Miami, FL, 33199, USA

    Naphtali Rishe

Authors
  1. Bo Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ouri Wolfson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sam Chamberlain
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naphtali Rishe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, B., Wolfson, O., Chamberlain, S. et al. Cost Based Data Dissemination in Satellite Networks. Mobile Networks and Applications 7, 49–66 (2002). https://doi.org/10.1023/A:1013277313373

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013277313373

Search

Navigation