Skip to main content
SpringerLink
Log in

Satisfiability and trustworthiness of acquaintances in peer-to-peer overlay networks

  • Published:
Information Systems Frontiers Aims and scope Submit manuscript

Abstract

Various types of applications access to objects distributed in peer-to-peer (P2P) overlay networks. Even if the locations of target objects are detected by some algorithms like flooding and distributed hash table (DHT) ones, applications cannot manipulate the target objects without access requests. It is critical to discover which peer can manipulate an object in which method, i.e. only a peer with an access right is allowed to manipulate an object. Hence, the application rather has to find target peers which can manipulate a target object than detecting the location of a target object. Due to the scalability and variety of peers, it is difficult, possibly impossible to maintain a centralized directory showing in which peer each object is distributed. 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 of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. Acquaintance peers of a peer may notify the peer of different information on target peers due to communication and propagation delay. Here, it is critical to discuss how much a peer trusts each acquaintance peer. We first define the satisfiability, i.e. how much a peer is satisfied by issuing an access request to another peer. For example, if a peer \(p_{\!j}\) locally manipulates a target object o and sends a response, a peer p i is mostly satisfied. On the other hand, if \(p_{\!j}\) has to ask another peer to manipulate the object o, p i is less satisfied. We define the trustworthiness of an acquaintance peer of a peer from the satisfiability and the ranking factor.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2000). Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability (DIAU2000), pp. 46–66.

  • Crespo, A., & Garcia-Molina, H. (2002). Routing indices for peer-to-peer systems. In Proceedings of the 22nd IEEE International Conference on Distributed Computing System (ICDCS2002), pp. 23–32.

  • Cuenca-Acuna, F. M., Peery, C., Martin, R. P., & Nguyen, T. D. (2003). PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities. In Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC), pp. 236–249.

  • Damiani, E., di Vimercati, S. D. C., Paraboschi, S., Samarati, P., & Violante, F. (2002). A reputation-based approach for choosing reliable resources in peer-to-peer networks. In Proceedings of ACM Conference on Computer and Communications Security (CCS’02), pp. 207–216.

  • Ferraiolo, F. D., Kuhn, D. R., & Chandramouli, R. (2003). Role-based access control. Norwood, MA: Artech House.

    Google Scholar 

  • Gupta, M., Judge, P., & Ammar, M. (2003). A reputation system for peer-to-peer networks. In Proceedings of the 13th International Workshop on Network and Operation Systems Support for Digital Audio and Video (NOSSDAV’03), pp. 144–152.

  • Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The Eigentrust algorithm for reputation management in P2P networks. In Proceedings of the 12th International World Wide Web Conferences (WWW2003), pp. 640–651.

  • Liu, Y., Zhuang, Z., Xiao, L., & Ni, L. M. (2004). A distributed approach to solving overlay mismatching problem. In Proceedings of the 24th IEEE International Conference on Distributed Computing System (ICDCS2004), pp. 132–139.

  • Marti, S., & Garcia-Molina, H. (2004). Limited reputation sharing in P2P systems. In Proceedings of ACM Conference on Electronic Commerce (EC’04), pp. 91–101.

  • Maymounkov, P., & Mazieres, D. (2002). Kademlia: A peer-to-peer information system based on the xor metric. In Proceedings of the 1st International WorkshoShenker p R.M, p on Peer-to-Peer Systems (IPTPS’02), pp. 53–65.

  • Oracle Corporation (1999). Oracle8i Concepts Vol. 1 1999 release 8.1.5.

  • Ratnasamy, S., Francis, P., & Handley, S. (2001). A scalable content-addressable network. ACM SIGCOMM2001, pp. 161–172.

  • Ripeanu, M. (2001). Peer-to-peer architecture case study: Gnutella network. In Proceedings of the International Conference on Peer-to-Peer Computing (P2P2001), pp. 99–100.

  • Rowstron, A. I. T., & Druschel, P. (2001). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 3rd IFIP/ACM International Conference on Distributed Systems Platforms(Middleware), pp. 329–350.

  • Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., & Balakrishnan, H. (2003). Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (TON), 11(1), 17–32.

    Article  Google Scholar 

  • The Gnutella Protocol Specification v0.4 http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf

  • Wang, Y. & Varadharajan, V. (2004). Interaction trust evaluation in decentralized environments. In Proceedings of 5th International Conference on Electronic Commerce and Web Technologies (EC-Web’04), pp. 144–153.

  • Wang, Y. & Varadharajan, V. (2005). Interaction Trust2: Developing trust in peer-to-peer environments. In Proceedings of IEEE International Conference on Services Computing (SCC2005), pp. 24–34.

  • Watanabe, K., Hayashibara, N., & Takizawa, M. (2005). CBF: Look-up protocol for distributed multimedia objects in peer-to-peer overlay networks. Journal of Interconnection Networks (JOIN), 6(3), 323–344.

    Article  Google Scholar 

  • Xiong, L. & Liu, L. (2004). PeerTrust: Supporting reputation-based trust for peer-to-peer electronic communities. IEEE Transaction on Knowledge and Data Engineering, 16(7), pp. 843–857.

    Article  Google Scholar 

  • Yu, B., Singh, M. P., & Sycara, K. (2004). Developing trust in large-scale peer-to-peer systems. In Proceedings of IEEE 1st Symposium on Multi-Agent Security and Survivability (MAS&S2004), pp. 1–10.

  • Zhao, B. Y., Kubiatowicz, J., & Joseph, A. D. (2002). Tapestry: A fault-tolerant wide-area application infrastructure. Computer Communication Review, 32(1), 81.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Takizawa Laboratory, Applied Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Saitama, 350-0394, Japan

    Kenichi Watanabe

  2. Faculty of Business Administration, Rissho University, Osaki, Shinagawa-ku, Tokyo, 141-8602, Japan

    Tomoya Enokido

  3. Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki-gun, Saitama, 350-0394, Japan

    Makoto Takizawa

Authors
  1. Kenichi Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomoya Enokido
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Makoto Takizawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kenichi Watanabe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Watanabe, K., Enokido, T. & Takizawa, M. Satisfiability and trustworthiness of acquaintances in peer-to-peer overlay networks. Inf Syst Front 8, 271–284 (2006). https://doi.org/10.1007/s10796-006-9001-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10796-006-9001-8

Keywords

Search

Navigation