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 k to improve the performance of object lookup. Simulation results show there is some relation among k, the network size N and the average path length. The lower bound of k to achieve a searchable P2P network is still an open question.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gnutella, http://gnutella.wego.com
Freenet, http://freenet.sourceforge.net
Vanthournout, K., Deconinck, G., Belmans, R.: A taxonomy for resource discovery. Personal and Ubiquitous Computing 9, 81–89 (2005)
Newman, M.E.J., Watts, D.J.: Scaling and percolation in the small-world network model. Physical Review E 60, 7332–7342 (1999)
Hui, K.Y.K., Lui, J.C.S., Yau, D.K.Y.: Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds. Computer Networks 50, 2727–2746 (2006)
Zhuge, H., Chen, X., Sun, X., Yao, E.: HRing: A Structured P2P Overlay Based on Harmonic Series. IEEE Transactions on Parallel and Distributed Systems 19, 145–158 (2008)
Li, M., Lee, W.C., Sivasubramaniam, A., Zhao, J.: SSW: A Small-World-Based Overlay for Peer-to-Peer Search. IEEE Transactions on Parallel and Distributed Systems 19, 735–749 (2008)
Carchiolo, V., Malgeri, M., Mangioni, G., Nicosia, V.: Emerging structures of P2P networks induced by social relationships. Computer Communications 31, 620–628 (2008)
Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: 32th Annual ACM Symposium on Theory of Computing, pp. 163–170. ACM Press, New York (2000)
Wang, S., Xuan, D., Zhao, W.: Analyzing and enhancing the resilience of structured peer-to-peer systems. J. Parallel Distrib. Comput. 65, 207–219 (2004)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proc. 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161–172. ACM Press, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Shen, J., Li, J., Wang, X. (2009). Constructing Searchable P2P Network with Randomly Selected Long-Distance Connections. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02469-6_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-02469-6_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02468-9
Online ISBN: 978-3-642-02469-6
eBook Packages: Computer ScienceComputer Science (R0)