Ranking factors in peer-to-peer overlay networks

ABSTRACT

A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. In this article, we discuss a fully distributed P2P system where there is no centralized controller. Each peer has to obtain service information from its acquaintance peers and also send its service information to the acquaintance peers. An acquaintance peer of a peer p is a peer about whose service the peer p knows and with which the peer p can directly communicate in an overlay network. Some acquaintance peer might hold obsolete service information and might be faulty. Each peer has to find a more trustworthy one among acquaintance peers. There are many discussions on how to detect peers that hold a target object. However, a peer cannot manipulate an object without being granted access rights (permissions). In addition to detecting what peers hold a target object, we have to find peers granted access rights to manipulate the target object. The trustworthiness of each acquaintance is defined in terms of the satisfiability and ranking factor in this article. The satisfiability of an acquaintance peer shows how much each peer can trust the acquaintance peer through direct communication to not only detect target objects but also obtain their access rights. On the other hand, the ranking factor of an acquaintance peer indicates how much the acquaintance peer is trusted only by trustworthy acquaintance peers which is different from the traditional reputation concept. We evaluate how the trustworthiness of an acquaintance peer is changed through interactions among peers in a detection algorithm.

REFERENCES

• 1: Stephanos Androutsellis-Theotokis , Diomidis Spinellis, A survey of peer-to-peer content distribution technologies, ACM Computing Surveys (CSUR), v.36 n.4, p.335-371, December 2004 [doi>10.1145/1041680.1041681]
• 2: Ian Clarke , Oskar Sandberg , Brandon Wiley , Theodore W. Hong, Freenet: a distributed anonymous information storage and retrieval system, International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability, p.46-66, January 2001, Berkeley, California, United States
• 3: Arturo Crespo , Hector Garcia-Molina, Routing Indices For Peer-to-Peer Systems, Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02), p.23, July 02-05, 2002
• 4: Cuenca-Acuna, F. M., Martin, R. P., and Nguyen, T. D. 2002. PlanetP: Using gossiping and random replication to support reliable peer-to-peer content search and retrieval. Tech. Rep. DCS-TR-494, Rutgers University.
• 5: Egemen Tanin , Deepa Nayar , Hanan Samet, An efficient nearest neighbor algorithm for P2P settings, Proceedings of the 2005 national conference on Digital government research, May 15-18, 2005, Atlanta, Georgia
• 6: David F. Ferraiolo , D. Richard Kuhn , Ramaswamy Chandramouli, Role-Based Access Control, Artech House, Inc., Norwood, MA, 2003
• 7: Sepandar D. Kamvar , Mario T. Schlosser , Hector Garcia-Molina, The Eigentrust algorithm for reputation management in P2P networks, Proceedings of the 12th international conference on World Wide Web, May 20-24, 2003, Budapest, Hungary [doi>10.1145/775152.775242]
• 8: Leslie Lamport , Robert Shostak , Marshall Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.382-401, July 1982 [doi>10.1145/357172.357176]
• 9: Yunhao Liu , Zhenyun Zhuang , Li Xiao , Lionel M. Ni, A Distributed Approach to Solving Overlay Mismatching Problem, Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04), p.132-139, March 24-26, 2004
• 10: Yoshio Nakajima , Kenichi Watanabe , Naohiro Hayashibara , Tomoya Enokido , Makoto Takizawa , S. Misbah Deen, Trustworthiness in Peer-to-Peer Overlay Networks, Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06), p.86-93, June 05-07, 2006 [doi>10.1109/SUTC.2006.140]
• 11: Napster. http://www.napster.com.
• 12: OMG Inc. 1997. The Common Object Request Broker: Architecture and Specification. QED Publishing Co.
• 13: Oracle Corporation 1999. Oracle8i Concepts Vol. 1.
• 14: Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Schenker, A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.161-172, August 2001, San Diego, California, United States
• 15: M. Ripeanu, [15] Peer-to-Peer Architecture Case Study: Gnutella Network, Proceedings of the First International Conference on Peer-to-Peer Computing (P2P'01), p.99, August 27-29, 2001
• 16: Antony I. T. Rowstron , Peter Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, p.329-350, November 12-16, 2001
• 17: Ion Stoica , Robert Morris , David Liben-Nowell , David R. Karger , M. Frans Kaashoek , Frank Dabek , Hari Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking (TON), v.11 n.1, p.17-32, February 2003 [doi>10.1109/TNET.2002.808407]
• 18: Sybase SQL Server. Sybase sql server. http://www.sybase.com/.
• 19: Peter Urban , Andre Schiper , Xavier Defago, Neko: A Single Environment to Simulate and Prototype Distributed Algorithms, Proceedings of the The 15th International Conference on Information Networking, p.503, January 31-February 02, 2001
• 20: Watanabe, K., Enokido, T., and Takizawa, M. 2006. Trustworthiness of acquaintances in peer-to-peer overlay networks. Inter. J. High Perform. Comput. Netw. (IJHPCN). To appear.
• 21: Kenichi Watanabe , Tomoya Enokido , Makoto Takizawa , Kane Kim, Charge-Based Flooding Algorithm for Detecting Multimedia Objects in Peer-to-Peer Overlay Networks, Proceedings of the 19th International Conference on Advanced Information Networking and Applications, p.165-170, March 25-30, 2005 [doi>10.1109/AINA.2005.134]
• 22: Watanabe, K., Hayashibara, N., Enokido, T., and Takizawa, M. 2005b. CBF: Look-up protocol for distributed multimedia objects in peer-to-peer overlay networks. J. Intercon. Netw. 6, 3, 323--344.
• 23: Watanabe, K. and Takizawa, M. 2006. Service oriented cooperation among trustworthy peers. J. Intercon. Netw. 1, 4, 507--533.
• 24: Ben Y. Zhao , John D. Kubiatowicz , Anthony D. Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and, University of California at Berkeley, Berkeley, CA, 2001

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.4 Distributed Systems
          Subjects: Distributed applications

General Terms:
Reliability, Security

Keywords:
P2P overlay networks, acquaintances, ranking factor, satisfiability, trustworthiness