The full text of this article:

'Dominating-set-based' searching in peer-to-peer networks
by Chunlin Yang, Xiuqi Li
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 3, No. 4, 2005
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?'. In this paper, we propose a 'dominating-set-based', 'peer-to-peer' searching algorithm to maximise 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.

is only available to individual subscribers or to users at subscribing institutions.

Pay per view: If you are not a Subscriber and you just want to read the full contents of this article, please click here to purchase online access to the full-text of this article. Please allow 3 days + mailing time. Current price for article is Thirty Euros (€30)

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN) journal, that have been redirected here, please check if you have a registered username/password subscription with Inderscience. If that is the case, please Login:

If you are not yet a Subscriber to International Journal of High Performance Computing and Networking (IJHPCN) journal, you can subscribe by following a few simple and quick steps. A subscription will give you complete access to all articles in the current issue, as well as to all articles in the previous three years, where applicable. Click here to subscribe.

Should you experience further difficulties or have any enquiries, please email subs@inderscience.com