Research Article
Constructing Searchable P2P Network with Randomly Selected Long-Distance Connections
@INPROCEEDINGS{10.1007/978-3-642-02469-6_62, author={Jingbo Shen and Jinlong Li and Xufa Wang}, title={Constructing Searchable P2P Network with Randomly Selected Long-Distance Connections}, proceedings={Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2}, proceedings_a={COMPLEX PART 2}, year={2012}, month={5}, keywords={Searchable P2P Network Small-World Paradigm Long-Distance Connection Random Selection Object Lookup}, doi={10.1007/978-3-642-02469-6_62} }- Jingbo Shen
Jinlong Li
Xufa Wang
Year: 2012
Constructing Searchable P2P Network with Randomly Selected Long-Distance Connections
COMPLEX PART 2
Springer
DOI: 10.1007/978-3-642-02469-6_62
Abstract
Object lookup is a basic problem in P2P network. Long-distance connections have been used to construct a searchable P2P network according to the small-world paradigm. Long-distance connections based on distance can achieve a searchable P2P network in theorem. However, it is hard to measure the lattice distance between two peers in real P2P network. On the other hand, it is easy to construct randomly selected long-distance connections with low overhead. We increase the number of randomly selected long-distance connections to improve the performance of object lookup. Simulation results show there is some relation among , the network size and the average path length. The lower bound of to achieve a searchable P2P network is still an open question.