Abstract
In this paper, we present a novel search algorithm called Dynamic Random Walk Team (DRWT), which achieves a better tradeoff between performance and overhead. The main difference between DRWT and the traditional Random Walk algorithms contains two aspects: (1) all nodes advertise their resource sharing information and maintain and broadcast the information with the EDBF-like manner, which discards the information dynamically when transmitted to neighbors; and (2) DRWT extends the concept of walker in traditional Random Walk to search team, which selects its search direction based on the resource location information at each intermediate node. Furthermore, each search team periodically contacts the requesting node and may be required to enhance its search intensity by sending out more walkers based on the distribution of the resource location information to accelerate the search process.
The work was supported by the National Basic Research Program of China (973) under Grant No.2005CB321801.
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
Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of IEEE Infocom (2004)
Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks. In: Proc. of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria (July 2002)
Kumar, A., Xu, J(J.), Zegura, E.W.: Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks. In: Proceedings of IEEE Infocom (2005)
Guo, D., Chen, H., Luo, X.: Theory and Network Application of Dynamic Bloom Filters. In: Proceedings of IEEE Infocom (2006)
Joseph, S.R.H.: NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks. In: Proc. of International Workshop on Peer-to-Peer Computing, Pisa, Italy (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Lu, X., Li, D., Xiao, N. (2006). DRWT: An Efficient Random Walk Algorithm for Unstructured P2P Networks. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_20
Download citation
DOI: https://doi.org/10.1007/11947950_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68139-7
Online ISBN: 978-3-540-68140-3
eBook Packages: Computer ScienceComputer Science (R0)