Abstract
Random walks is a typical search schema in unstructured peer-to-peer network. It generates partial coverage problem and makes some resources indiscoverable. An efficient search schema WCBF is presented. WCBF utilizes compressed Bloom filter for representing the path information to enlarge the coverage of random walks and alleviates the problem with a low overhead. Experimental results show the coverage of WCBF is almost 6 times that of random walks in a Gnutella-like overlay network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
WISC: (traffic statistics), http://wwwstats.net.wisc.edu
Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6-1 (2002)
Jiang, S., Guo, L., Zhang, X.: Lightflood: an efficient flooding scheme for file search in unstructured peer-to-peer systems. In: Proceedings of ICPP (2003)
Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A local search mechanism for peer-to-peer networks. In: CIKM (2002)
Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proceedings of the ICDCS (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the annual ACM International Conference on supercomputing, vol. 16 (2002)
Clarke, I., Sandberg, O.: Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of the ICSI Workshop On Design Issues in Anonymity and Unobservability (2002)
Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: 3rd IEEE Intl Conference on P2P computing (2003)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: SIGCOMM (2003)
Zhuang, Z., Liu, Y., Xiao, L., Ni, L.M.: Hybrid periodical flooding in unstructured peer-to-peer networks. In: Proceedings of ICPP (2003)
Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: INFOCOM (2004)
Mitzenmacher, M.: Compressed bloom filters. IEEE Transactions on Networking 10, 604 (2002)
Bloom, B.: Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Whitaker, A., Wetherall, D.: Forwarding without loops in icarus. In: Proceedings of the Fifth OPENARCH, pp. 63–75 (2002)
Cleary, J., Witten, I.: Data compression using adaptive coding and partial string matching. IEEE Transactions on Communications 32, 396–402 (1984)
Jovanovic, M., Annexstein, F.S., Berman, K.A.: Modeling peer-to-peer network topologies through “small-world” models and power laws. In: Proceedings of the TELFOR (2001)
Group, D.: Gnutella: To the bandwidth barrier and beyond. Technical report, DSS Group (2000)
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 509 (1999)
Dreier, D.: Manual of operation: Barabasi graph generator v1.0, http://www.cs.ucr.edu/~ddreier/bman.pdf
Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scalability. O’Reilly’s, Sebastopol (2001), www.openp2p.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Q., Wang, Y., Lu, X. (2004). WCBF: Efficient and High-Coverage Search Schema in Unstructured Peer-to-Peer Network. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive