{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:17Z","timestamp":1750307897971,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2007,9]]},"abstract":"<jats:p>\n            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\n            <jats:italic>p<\/jats:italic>\n            is a peer about whose service the peer\n            <jats:italic>p<\/jats:italic>\n            knows and with which the peer\n            <jats:italic>p<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.1145\/1278460.1278465","type":"journal-article","created":{"date-parts":[[2007,10,14]],"date-time":"2007-10-14T12:41:11Z","timestamp":1192365671000},"page":"11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":74,"title":["Ranking factors in peer-to-peer overlay networks"],"prefix":"10.1145","volume":"2","author":[{"given":"Kenichi","family":"Watanabe","sequence":"first","affiliation":[{"name":"Tokyo Denki University, Hiki, Saitama, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshio","family":"Nakajima","sequence":"additional","affiliation":[{"name":"Tokyo Denki University, Hiki, Saitama, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoya","family":"Enokido","sequence":"additional","affiliation":[{"name":"Rissho University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Takizawa","sequence":"additional","affiliation":[{"name":"Tokyo Denki University, Hiki, Saitama, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,9]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1041680.1041681"},{"key":"e_1_2_1_2_1","volume-title":"Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability. 46--66.","author":"Clarke I.","year":"2000","unstructured":"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. 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."},{"volume-title":"Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS). 23--32","author":"Crespo A.","unstructured":"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 . 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.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","volume-title":"Tech. Rep. DCS-TR-494","author":"Cuenca-Acuna F. M.","year":"2002","unstructured":"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 . 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."},{"volume-title":"Proceedings of the National Conference on Digital Government Research. 21--28","author":"Egemen T.","unstructured":"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 . 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.","key":"e_1_2_1_5_1"},{"unstructured":"Ferraiolo F. D. Kuhn D. R. and Chandramouli R. 2003. Role-Based Access Control. Artech House Publishers.   Ferraiolo F. D. Kuhn D. R. and Chandramouli R. 2003. Role-Based Access Control. Artech House Publishers.","key":"e_1_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1145\/775152.775242"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1145\/357172.357176"},{"volume-title":"Proceedings of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS). 132--139","author":"Liu Y.","unstructured":"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 . 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.","key":"e_1_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1109\/SUTC.2006.140"},{"unstructured":"Napster. http:\/\/www.napster.com.  Napster. http:\/\/www.napster.com.","key":"e_1_2_1_11_1"},{"volume-title":"The Common Object Request Broker: Architecture and Specification","author":"OMG Inc. 1997.","unstructured":"OMG Inc. 1997. The Common Object Request Broker: Architecture and Specification . QED Publishing Co. OMG Inc. 1997. The Common Object Request Broker: Architecture and Specification. QED Publishing Co.","key":"e_1_2_1_12_1"},{"volume-title":"Oracle8i Concepts","author":"Oracle Corporation 1999.","unstructured":"Oracle Corporation 1999. Oracle8i Concepts Vol. 1 . Oracle Corporation 1999. Oracle8i Concepts Vol. 1.","key":"e_1_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of International Conference on Peer-to-Peer Computing (P2P'01)","author":"Ripeanu M.","year":"2001","unstructured":"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. 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."},{"volume-title":"Proceedings of IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware).","author":"Rowstron A.","unstructured":"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). 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).","key":"e_1_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1109\/TNET.2002.808407"},{"unstructured":"Sybase SQL Server. Sybase sql server. http:\/\/www.sybase.com\/.  Sybase SQL Server. Sybase sql server. http:\/\/www.sybase.com\/.","key":"e_1_2_1_18_1"},{"volume-title":"Proceedings of the 15th International Conference on Information Networking (ICOIN-15)","author":"Urban P.","unstructured":"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. 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.","key":"e_1_2_1_19_1"},{"doi-asserted-by":"crossref","unstructured":"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.  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.","key":"e_1_2_1_20_1","DOI":"10.1109\/ICDCSW.2006.112"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1109\/AINA.2005.134"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1142\/S0219265905001459"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1142\/S0219265906001831"},{"key":"e_1_2_1_24_1","volume-title":"Tapestry: An infrastructure for fault-resilient wide-area location and routing. Tech. rep. UCB\/CSD-01-1141","author":"Zhao B. Y.","year":"2001","unstructured":"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. 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."}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1278460.1278465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1278460.1278465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:29Z","timestamp":1750258049000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1278460.1278465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1278460.1278465"],"URL":"https:\/\/doi.org\/10.1145\/1278460.1278465","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}