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.
- Androutsellis-Theotokis, S. and Spinellis, D. 2004. A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36, 4, 335--371. Google Scholar
Digital Library
- Clarke, I., Sandberg, O., Wiley, B., and 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. 46--66. Google Scholar
Digital Library
- Crespo, A. and Garcia-Molina, H. 2002. Routing indices for peer-to-peer systems. In Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS). 23--32. Google Scholar
Digital Library
- 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.Google Scholar
- Egemen, T., Deepa, N., and Hanan, S. 2005. An efficient nearest neighbor algorithm for P2P settings. In Proceedings of the National Conference on Digital Government Research. 21--28. Google Scholar
Digital Library
- Ferraiolo, F. D., Kuhn, D. R., and Chandramouli, R. 2003. Role-Based Access Control. Artech House Publishers. Google Scholar
Digital Library
- Kamvar, D. S., Schlosser, T. M., and Garcia-Molina, H. 2003. The Eigentrust Algorithm for reputation management in P2P networks. In Proceedings of the 12th IEEE International Conference on World Wide Web. 640--651. Google Scholar
Digital Library
- Lamport, L., Shostak, R., and Pease, M. 1982. The Byzantine generals problem. In ACM Trans. Program. Lang. Syst. 382--401. Google Scholar
Digital Library
- Liu, Y., Zhuang, Z., Li, X., and Lionel, M. N. 2004. A distributed approach to solving overlay mismatching problem. In Proceedings of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS). 132--139. Google Scholar
Digital Library
- Nakajima, Y., Watanabe, K., Hayashibara, N., Enokido, T., Takizawa, M., and Deen, S. M. 2006. Trustworthiness in peer-to-peer overlay networks. In Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC). 86--93 Google Scholar
Cross Ref
- Napster. http://www.napster.com.Google Scholar
- OMG Inc. 1997. The Common Object Request Broker: Architecture and Specification. QED Publishing Co.Google Scholar
- Oracle Corporation 1999. Oracle8i Concepts Vol. 1.Google Scholar
- Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. 2001. A scalable content-addressable network. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 161--172. Google Scholar
Digital Library
- Ripeanu, M. 2001. Peer-to-peer architecture case study: gnutella network. In Proceedings of International Conference on Peer-to-Peer Computing (P2P'01). 99--100. Google Scholar
Digital Library
- Rowstron, A. and Druschel, P. 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Google Scholar
Digital Library
- Stoica, I., Morris, R., Karger, D., Kaashoek, F., and Balakrishnan, H. 2003. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. on Netw. (TON) 11, 1, 17--32. Google Scholar
Digital Library
- Sybase SQL Server. Sybase sql server. http://www.sybase.com/.Google Scholar
- Urban, P., Defago, X., and Schiper, A. 2001. Neko: A single environment to simulate and prototype distributed algorithms. In Proceedings of the 15th International Conference on Information Networking (ICOIN-15). 503--511. Google Scholar
Digital Library
- 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.Google Scholar
- Watanabe, K., Enokido, T., Takizawa, M., and Kim, K. 2005a. Charge-based flooding algorithm for detecting multimedia objects in peer-to-peer overlay networks. In Proceedings of IEEE 19th Conference on Advanced Information Networking and Applications (AINA'05). 1, 165--170. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- Watanabe, K. and Takizawa, M. 2006. Service oriented cooperation among trustworthy peers. J. Intercon. Netw. 1, 4, 507--533.Google Scholar
Cross Ref
- Zhao, B. Y., Kubiatowicz, J., and Joseph, A. D. 2001. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Tech. rep. UCB/CSD-01-1141, University of California, Berkeley. Google Scholar
Digital Library
Index Terms
Ranking factors in peer-to-peer overlay networks
Recommendations
Trustworthiness of acquaintances in Peer-to-Peer overlay networks
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 ...
Satisfiability and trustworthiness of acquaintances in peer-to-peer overlay networks
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 ...
Subjective and Objective Types of Trustworthiness in Peer-to-Peer(P2P) Overlay Networks
WAINA '10: Proceedings of the 2010 IEEE 24th International Conference on Advanced Information Networking and Applications WorkshopsSystems using peer-to-peer (P2P) overlay networks are getting a central position in information systems. P2P systems are in nature fully distributed with no centralized coordinator and each peer is autonomous. Each peer has to obtain information on ...






Comments