Trustworthiness of acquaintances in Peer-to-Peer overlay networks
by Kenichi Watanabe, Tomoya Enokido, Makoto Takizawa
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 6, No. 2, 2009

Abstract: Various types of applications manipulate objects distributed in Peer-to-Peer overlay networks. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance relations among peers and how much a peer trusts each acquaintance peer. We define the trustworthiness of each acquaintance peer in terms of the acquaintance relations. We discuss a Charge-Based Flooding (CBF) algorithm to find target peers so that more trustworthy areas in Peer-to-Peer overlay networks are more deeply searched. We evaluate the CBF algorithm compared with a TTL-based algorithm.

Online publication date: Sun, 26-Jul-2009

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 High Performance Computing and Networking (IJHPCN):
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