An analytical evaluation method based on generalised random graphs for unstructured peer-to-peer content-sharing systems
by Keiichi Endo
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 6, No. 4, 2011

Abstract: This paper presents a method that can be used to analyse the performance of peer-to-peer content-sharing systems. By using this method, we can analytically calculate the number of newly visited nodes at each step of a query spreading process, which is closely related to various types of performances such as search success rate and search time. Our method is based on the analytical framework proposed by Gaeta et al. Since the existing framework is based on the assumption that the probability of encountering the same node in the query spreading process after multiple hops is negligible, it is not suitable for relatively small networks or highly clustered networks. In this paper, we propose a method to make the analytical framework applicable to those networks by considering the possibility that a node receives the same query from different nodes.

Online publication date: Thu, 26-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com