Load Balancing and Range Queries in P2P Systems Using P-Ring

被引：12

作者：

Crainiceanu, Adina ^{[1
]}

Linga, Prakash

Machanavajjhala, Ashwin

Gehrke, Johannes ^{[2
]}

Shanmugasundaram, Jayavel

机构：

[1] USN Acad, Annapolis, MD 21402 USA

[2] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA

来源：

ACM TRANSACTIONS ON INTERNET TECHNOLOGY | 2011年 / 10卷 / 04期

基金：

美国国家科学基金会;

关键词：

Algorithms; Management; Performance; Peer-to-peer systems; range queries; load balancing; indexing;

D O I：

10.1145/1944339.1944343

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页数：30