Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

31st Annual International Computer Software and Applications Conference - Vol. 1- (COMPSAC 2007)   pp. 105-108
Reliable Self-Clustering P2P Overlay Networks

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/COMPSAC.2007.178
Send link to a friend

Abstract
Peer-to-peer overlay networks offer a flexible architecture for decentralized data sharing. In this paper, we present a novel approach to improve the search efficiency and scalability of P2P overlay networks by clustering P2P nodes with reliable mechanism. In our method, the reliability of the overlay is formed by evaluating the level of trust using Bayesian statistic analysis, and clusters can be formed and maintained autonomously by P2P nodes with only partial knowledge. Simulation and experimental results indicate the usefulness of this approach.
Additional Information

Citation:  Shihui Wang, Yan Zhang, Wei Wang, "Reliable Self-Clustering P2P Overlay Networks," compsac, pp. 105-108,  31st Annual International Computer Software and Applications Conference - Vol. 1- (COMPSAC 2007),  2007

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback