Abstract
The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the question “Where is X”. Breadth-first search, the basic searching mechanism used in Gnutella networks [4], floods the networks to maximize the return results. Depth-first search used in Freenet [3] retrieves popular files faster than other files but on average the return results are not maximized. Other searching algorithms used in peer-to-peer networks, such as iterative deepening [9], local indices [9], routing indices [2] and NEVRLATE [1] provide different improved searching mechanisms. In this paper, we propose a dominating-set-based peer-to-peer searching algorithm to maximize the return of searching results while keeping a low cost for both searching and creating/maintaining the connected-dominating-set (CDS) of the peer-to-peer network. This approach is based on random walk. However, the searching space is restricted to dominating nodes. Simulation has been done and results are compared with the one using regular random walk.
This work was supported in part by NSF grants CCR 0329741, ANI 0073736, and EIA 0130806. Contact person: jie@cse.fau.edu.
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
Chander, A., Dawson, S., Lincoln, P., Stringer-Calvert, D.: Nevrlate: scalable resource discovery. In: Proc. 2nd IEEE/ACM Int’l Symposium on Cluster Computing and the Grid, pp. 382–388 (2002)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. 22nd Int’l Conference on Distributed Computing Systems, pp. 23–32 (2002)
http://freenet.sourceforge.net (Freenet website)
http://www.gnutella.com (Gnutella website)
http://www.napster.com (Napater website)
Portmann, M., Seneviratne, A.: The cost of application-level broadcast in a fully decentralized peer-to-peer network. In: Proc. 7th Int’l Symposium on Computers and Communications, pp. 941–946 (2002)
Krishna Ramanathan, M., Kalogeraki, V., Pruyne, J.: Finding good peers in peerto- peer networks. In: Proc. Int’l Symposium on Parallel and Distributed Processing, pp. 232–239 (2002)
Wu, J., Li, H.: On calculating connected dominating sets for efficient routing in ad hoc wireless networks. In: Proc. 3rd Int’l Workshop on Discrete Algorithm and Methods for Mobile Computing and Communications, pp. 7–14 (1999)
Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proc. 22nd Int’l Conference on Distributed Computing Systems, pp. 5–14 (2002)
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
Yang, C., Wu, J. (2004). Dominating-Set-Based Searching in Peer-to-Peer Networks. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive