Abstract
This chapter presents the architectures and algorithms for Internet-scale peer-to-peer (p2p) data management. In recent years, a new set of scalability challenges have arisen in the context of Internet-scale (p2p) systems, in which the scaling metric is the number of participating computers rather than the number of bytes stored. This is new and intriguing territory for the design of data management algorithms and systems. The best-known application of p2p technology is filesharing, which despite its sometimes unsavory use, has been a vibrant technology driver. Additionally, there are compelling new application agendas for p2p systems including Internet monitoring, content distribution, distributed storage, multi-user games, and next-generation Internet routing. The energy behind p2p technology has led to an academic renaissance in the distributed algorithms and distributed systems communities, much of which directly addresses issues in massively distributed data management.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
