论文信息 - A load-balancing structured store model on P2P network

A load-balancing structured store model on P2P network

This paper proposed a structured p2p model called balance-peer, introduce a method to partition the data rang without any global information on the load to. Our Balance-peer model is used to realize a partition-by-keyword indexing service based on DHT with each node in the system responsible for part of the keywords of the inverted index list. In this paper we use the concept of data partition in parallel databases to realize the load balance in P2P systems. At last this paper has the performance test. The result convinces us that our storage balance strategy is valid.

Gao Ying | Zhan Jiang

[1] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[2] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[3] Hector Garcia-Molina,et al. Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems , 2004, VLDB.

[4] Ben Y. Zhao,et al. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[5] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[6] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.

[7] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[8] Amin Vahdat,et al. Efficient Peer-to-Peer Keyword Searching , 2003, Middleware.