This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searching performance under arbitrary system parameters and resource constraints (mainly the available bandwidth). Based on the model, we design a decentralized peer-to-peer searching strategy, namely the Lookup-ring, which provides very efficient keyword searching in high dynamic peer-to-peer environments. The simulation results show that Lookup-ring can easily support a large-scale system with more than 106 participating peers at a very small cost in each peer. © IFIP International Federation for Information Processing 2004.
CITATION STYLE
Liu, X., Yang, G., Hu, J., Chen, M., & Wu, Y. (2004). Lookup-ring: Building efficient lookups for high dynamic peer-to-peer overlays’. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3222, 154–166. https://doi.org/10.1007/978-3-540-30141-7_24
Mendeley helps you to discover research relevant for your work.