Adina Crainiceanu
Johannes Gehrke
Abstract
In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems make them appealing to a wide range of applications.
This article introduces P-Ring, a new peer-to-peer index structure. P-Ring is fully distributed, fault tolerant, and provides load balancing and logarithmic search performance while supporting both equality and range queries. Our theoretical analysis as well as experimental results, obtained both in a simulated environment and on PlanetLab, show the performance of our system.
- Aberer, K. 2001. P-Grid: A self-organizing access structure for p2p information systems. In Proceedings of the IFCIS Conference on Cooperative Information Systems (CoopIS). Google Scholar
Digital Library
- Aspnes, J. and Shah, G. 2003. Skip graphs. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Google ScholarDigital Library
- Bharambe, A. R., Agrawal, M., and Seshan, S. 2004. Mercury: Supporting scalable multi-attribute range queries. SIGCOMM Comput. Comm. Rev. 34, 4. Google ScholarDigital Library
- Cai, M., Frank, M., Chen, J., and Szekely, P. 2003. Maan: A multi-attribute addressable network for grid information services. In Proceedings of the 4th International Workshop on Grid Computing. Google ScholarDigital Library
- Crainiceanu, A., Linga, P., Gehrke, J., and Shanmugasundaram, J. 2004a. Querying peer-to-peer networks using p-trees. In Proceedings of the International Workshop on Web and Databases (WebDB). Google ScholarDigital Library
- Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., and Shanmugasundaram, J. 2004b. An indexing framework for peer-to-peer systems. In Proceedings of the World Wide Web Conference (WWW) (poster).Google Scholar
- Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., and Shanmugasundaram, J. 2007. P-Ring: An efficient and robust p2p range index structure. In Proceedings of the ACM SIGMOD International Conference on Management of Data. Google ScholarDigital Library
- Dabek, F., Kaas Hoek, M. F., Karger, D., Morris, R., and Stoica, I. 2001. Wide-Area cooperative storage with CFS. In Proceedings of the SIGOPS Symposium on Operating Systems Principles (SOSP). Google ScholarDigital Library
- Daskos, A., Ghandeharizadeh, S., and An, X. 2003. Peper: A distributed range addressing space for p2p systems. In Proceedings of the International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P).Google Scholar
- Datta, A., Hauswirth, M., John, R., Schmidt, R., and Aberer, K. 2005. Range-Queries in trie-structured overlays. In Proceedings of the P2P Computing Conference. Google ScholarDigital Library
- Ganesan, P., Bawa, M., and Garcia-Molina, H. 2004. Online balancing of range-partitioned data with applications to peer-to-peer systems. In Proceedings of the International Conference on Very Large Databases (VLDB). Google ScholarDigital Library
- Gupta, A., Agrawal, D., and El Abbadi, A. 2003. Approximate range selection queries in peer-to-peer systems. In Proceedings of the Conference on Innovative Data Systems Research (CIDR).Google Scholar
- Harvey, N., Jones, M., Saroiu, S., Theimer, M., and Wolman, A. 2003. Skipnet: A scalable overlay network with practical locality properties. In Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS). Google ScholarDigital Library
- Jagadish, H., Ooi, B. C., and Vu, Q. H. 2005. Baton: A balanced tree structure for peer-to-peer networks. In Proceedings of the International Conference on Very Large Databases (VLDB). Google ScholarDigital Library
- Jagadish, H., Ooi, B. C., Tan, K.-L., Vu, Q. H., and Zhang, R. 2006. Speeding up search in peer-to-peer networks with a multi-way tree structure. In Proceedings of the ACM SIGMOD International Conference on Management of Data. Google ScholarDigital Library
- JBI. 2011. http://www.rl.af.mil/programs/jbi/.Google Scholar
- Lagoze, C. and de Sompel, H. V. 2001. The open archive initiative: Building a low-barrier interoperability framework. In Proceedings of the ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL). Google ScholarDigital Library
- Li, J., Stribling, J., Morris, R., Kaashoek, M. F., and Gil, T. M. 2005. A performance vs. cost framework for evaluating dht design tradeoffs under churn. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom).Google Scholar
- Linga, P., Crainiceanu, A., Gehrke, J., and Shanmugasundaram, J. 2005. Guaranteeing correctness and availability in p2p range indices. In Proceedings of the ACM SIGMOD International Conference on Management of Data. Google ScholarDigital Library
- Litwin, W., Neimat, M.-A., and Schneider, D. A. 1993. Lh* - Linear hashing for distributed files. In Proceedings of the ACM SIGMOD International Conference on Management of Data. Google ScholarDigital Library
- Litwin, W., Neimat, M.-A., and Schneider, D. A. 1994. Rp*: A family of order preserving scalable distributed data structures. In Proceedings of the International Conference on Very Large Databases (VLDB). Google ScholarDigital Library
- Lomet, D. B. 1996. Replicated indexes for distributed data. In Proceedings of the International Conference on Parallel and Distributed Information Systems (PDIS). Google ScholarDigital Library
- Planet Lab. 2011. Planet Lab homepage. www.planet-lab.org.Google Scholar
- Ramakrishnan, R. and Gehrke, J. 2003. Database Management Systems. McGraw Hill. Google ScholarDigital Library
- Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. 2001. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM International Conference on Management of Data. Google ScholarDigital Library
- Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. 2004. Handling churn in a dht. In Proceedings of the USENIX Annual Tech Conference. Google ScholarDigital Library
- Rowstron, A. and Druschel, P. 2001. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the International ACM/IFIP/USENIX Middleware Conference (Middleware). Google ScholarDigital Library
- Sahin, O. D., Gupta, A., Agrawal, D., and El Abbadi, A. 2004. A p2p framework for caching range queries. In Proceedings of the International Conference on Data Engineering (ICDE). Google ScholarDigital Library
- Stoica, I., Morris, R., Karger, D., Frans Kaas Hoek, M., and Balakrishnan, H. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM Conference. Google ScholarDigital Library
- Zhao, B. Y., Kubiatowicz, J., and Joseph, A. 2001. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. rep., University of California Berkeley. Google ScholarDigital Library
Index Terms
- Load Balancing and Range Queries in P2P Systems Using P-Ring
Recommendations
P-ring: an efficient and robust P2P range index structure
SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of dataPeer-to-peer systems have emerged as a robust, scalable and decentralized way to share and publish data. In this paper, we propose P-Ring, a new P2P index structure that supports both equality and range queries. P-Ring is fault-tolerant, provides ...
Randomized load balancing strategies with churn resilience in peer-to-peer networks
The objective of load balancing in peer-to-peer (P2P) networks is to balance the workload of peer nodes in proportion to their capacity so as to eliminate performance bottlenecks. It is challenging because of the dynamic nature in overlay networks, the ...
Load balancing for structured P2P networks using the advanced finger selection algorithm (AFSA)
SAC '10: Proceedings of the 2010 ACM Symposium on Applied ComputingStructured Peer-to-Peer (P2P) networks, such as networks based on Distributed Hash Tables (DHTs), can be enhanced by using load balancing mechanisms. Current load balancing mechanisms are either trying to achieve even distribution of objects among nodes,...
Reviews
Todor Todorov
P-Ring is a new peer-to-peer (P2P) index structure. This paper introduces and describes this fully distributed, fault-tolerant structure that provides load balancing and logarithmic search performance while supporting both equality and range queries. The authors describe the model and architecture in detail, and present pseudocode algorithms. They also document the testing results and performance analysis. The authors conclude that "P-Ring outperforms [most of the] existing index structures[, and ...] that it maintains its excellent search performance with low maintenance cost in a dynamic P2P system."? I recommend this paper to anyone interested in P2P systems and their application. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments