Design and evaluation of algorithms for obtaining objective trustworthiness on acquaintances in P2P overlay networks
by Soichi Sawamura, Admir Barolli, Ailixier Aikebaier, Makoto Takizawa, Tomoya Enokido
International Journal of Grid and Utility Computing (IJGUC), Vol. 2, No. 3, 2011

Abstract: In fully distributed P2P overlay networks, each peer has to obtain information on objects distributed through communicating with its acquaintances. An acquaintance might hold obsolete information due to the propagation delay and faults of peers. Hence, a peer has to collect information only from trustworthy acquaintances. The subjective trustworthiness shows how much a peer trusts its acquaintance. The objective trustworthiness indicates how much other peers trust the acquaintance. We discuss three algorithms to calculate the objective trustworthiness. The algorithm OT1 shows a type of flooding algorithm. A peer sends request messages only to the acquaintances to reduce the number of messages in the algorithms OT2 and OT3. Furthermore, the peer ps sends messages to only acquaintances which the peer ps can trust in OT3. Then, the peer ps receives the subjective trustworthiness on the acquaintance from the acquaintance p2. The peer pu obtains the average value of the subjective trustworthiness collected as the objective trustworthiness. We evaluate the three algorithms in terms of how correct objective trustworthiness can be obtained by the algorithms.

Online publication date: Sat, 28-Mar-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 Grid and Utility Computing (IJGUC):
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