Skip to main content

Streaming Data Dissemination Using Peer-Peer Systems

  • Chapter
Stream Data Management

Part of the book series: Advances in Database Systems ((ADBS,volume 30))

  • 563 Accesses

Abstract

Many characteristics of peer-peer systems make them suitable for addressing the traditional problems of information storage and dissemination. Peer-peer systems give a distributed solution to these problems. Typically, peer-peer systems (research prototypes or commercial systems) have dynamic topologies where peers join and leave the network at any point. However, the information that is stored and queried in these peers is assumed to be static. Most of these current peer-peer systems do not deal with data that is changing dynamically, i.e., data that changes rapidly and unpredictably. This chapter first examines a few of the existing peer-peer systems and the various issues that they address. It then discusses some of the research issues in using peer-peer systems for managing dynamic or streaming data and presents a peer-peer solution for the dissemination of dynamic data.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Acharya, S., Franklin, M. J., and Zdonik, S. B. (1997). Balancing push and pull for data broadcast. In Proceedings of the ACM SIGMOD Conference.

    Google Scholar 

  • Agarwal, S., Ramamritham, K., and Shah, S. (2004). Construction of a temporal coherency preserving dynamic data dissemination network. In The 25th IEEE International Real Time Systems Symposium.

    Google Scholar 

  • Chawathe, Yatin, Ratnasamy, Sylvia, Breslau, Lee, Lanham, Nick, and Shenker, Scott (2003). Making Gnutella-like p2p systems scalable. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 407–418. ACM Press.

    Google Scholar 

  • Crespo, Arturo and Garcia-Molina, H. (2002). Semantic overlay networks for p2p systems. Technical report, Computer Science Department, Stanford University.

    Google Scholar 

  • Fuentes, Francisco (2002). An overview of media streaming over peer-to-peer networks. Technical report, Technische Univeritat Munchen.

    Google Scholar 

  • Gnutella http://www.gnutella.com.

    Google Scholar 

  • Hefeeda, M., Habib, A., Botev, B., Xu, D., and Bhargava, D. B. (2003). Collectcast: A peer-to-peer service for media streaming. (Submitted to) ACM Multimedia Systems Journal.

    Google Scholar 

  • Majumdar, R., Moudgalya, K., and Ramamritham, K. (2003). Adaptive coherency maintenance techniques for time-varying data. In The 24th IEEE International Real Time Systems Symposium.

    Google Scholar 

  • Marti, Sergio and Molina, Hector Garcia (2004). Limited reputation sharing in p2p systems. In In ACM Conference on Electronic Commerce. Neoganesh http://www.openclinical.org/aisp.neoganesh.html.

    Google Scholar 

  • Padmanabhan, V., Wang, H., Chou, P., and Sripanidkulchai, K. (2002). Distributing streaming media content using cooperative networking. In In ACM/IEEE NOSSDAV.

    Google Scholar 

  • Ratnasamy, Sylvia, Francis, Paul, Handley, Mark, Karp, Richard, and Shenker, Scott (2001). A scalable content-addressable network. In Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 161–172. ACM Press.

    Google Scholar 

  • Shah, S., Dharmarajan, S., and Ramamritham, K. (2003). An efficient and resilient approach to filtering and disseminating dynamic data. In Proceedings of the 29th Conference on VLDB.

    Google Scholar 

  • Shah, S., Ramamritham, K., and Shenoy, P. (2002). Maintaining coherency of dynamic data in cooperating repositories. In Proceedings of the 28th Conference on VLDB.

    Google Scholar 

  • Srinivasan, R., Liang, C, and Ramamritham, K. (1998). Maintaining temporal coherency of virtual data warehouses. In The 19th IEEE Real-Time Systems Symposium.

    Google Scholar 

  • Stoica, Ion, Morris, Robert, Karger, David, Kaashoek, M. Frans, and Balakrishnan, Hari (2001). Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 149–160. ACM Press.

    Google Scholar 

  • Zhu, S. and Ravishankar, C. (2004). Stochastic consistency, and scalable pull-based caching for erratic data sources. In Proceedings of the 30th Conference on VLDB.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Shah, S., Ramamritham, K. (2005). Streaming Data Dissemination Using Peer-Peer Systems. In: Chaudhry, N.A., Shaw, K., Abdelguerfi, M. (eds) Stream Data Management. Advances in Database Systems, vol 30. Springer, Boston, MA. https://doi.org/10.1007/0-387-25229-0_8

Download citation

  • DOI: https://doi.org/10.1007/0-387-25229-0_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-24393-1

  • Online ISBN: 978-0-387-25229-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics