{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:12Z","timestamp":1760597772366,"version":"3.41.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transcom.2017ebp3024","type":"journal-article","created":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T22:11:14Z","timestamp":1505340674000},"page":"740-749","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Content Search Method Based on Local Link Replacement in Unstructured Peer-to-Peer Networks"],"prefix":"10.23919","volume":"E101.B","author":[{"given":"Nagao","family":"OGINO","sequence":"first","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"KITAHARA","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"crossref","unstructured":"[1] R. Roverso, R. Reale, S. El-Ansary, and S. Haridi, \u201cSmoothCache 2.0: CDN-quality adaptive HTTP live streaming on peer-to-peer overlays,\u201d Proc. ACM MMSys'15, pp.61-72, March 2015. 10.1145\/2713168.2713182","key":"1","DOI":"10.1145\/2713168.2713182"},{"doi-asserted-by":"crossref","unstructured":"[2] M. Zhao, P. Aditya, A. Chen, Y. Lin, A. Haeberlen, P. Druschel, B. Maggs, B. Wishon, and M. Ponec, \u201cPeer-assisted content distribution in Akamai NetSession,\u201d Proc. ACM ICM'13, pp.31-42, Oct. 2013. 10.1145\/2504730.2504752","key":"2","DOI":"10.1145\/2504730.2504752"},{"doi-asserted-by":"crossref","unstructured":"[3] Y. Jin, Y. Yi, G. Kesidis, F. Kocak, and J. Shin, \u201cHybrid client-server and peer-to-peer caching systems with selfish peers,\u201d Proc. IEEE Infocom 2013, May 2013. 10.1109\/infcom.2013.6566972","key":"3","DOI":"10.1109\/INFCOM.2013.6566972"},{"doi-asserted-by":"publisher","unstructured":"[4] S. Traverso, L. Abeni, R. Birke, C. Kiraly, E. Leonardi, R.L. Cigno, and M. Mellia, \u201cNeighborhood filtering strategies for overlay construction in P2P-TV systems: Design and experimental comparison,\u201d IEEE\/ACM Trans. Netw., vol.23, no.3, pp.741-754, June 2015. 10.1109\/tnet.2014.2307157","key":"4","DOI":"10.1109\/TNET.2014.2307157"},{"doi-asserted-by":"publisher","unstructured":"[5] A.S. Tigelaar, D. Hiemstra, and D. Trieschnigg, \u201cPeer-to-peer information retrieval: An overview,\u201d ACM Trans. Inf. Syst., vol.30, no.2, pp.9.1-9.34, May 2012. 10.1145\/2180868.2180871","key":"5","DOI":"10.1145\/2180868.2180871"},{"doi-asserted-by":"crossref","unstructured":"[6] Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, \u201cModeling peer-to-peer file sharing systems,\u201d Proc. IEEE Infocom 2003, pp.2188-2198, April 2003. 10.1109\/infcom.2003.1209239","key":"6","DOI":"10.1109\/INFCOM.2003.1209239"},{"unstructured":"[7] Open Source Community, \u201cGnutella protocol development,\u201d in http:\/\/rfc-gnutella.sourceforge.net\/, 2011.","key":"7"},{"doi-asserted-by":"crossref","unstructured":"[8] A. Vlachou, C. Doulkeridis, K. N\u00f8rv\u00f8ag, and M. Vazirgiannis, \u201cOn efficient top-k query processing in highly distributed environments,\u201d Proc. ACM SIGMOD'08, pp.753-764, June 2008. 10.1145\/1376616.1376692","key":"8","DOI":"10.1145\/1376616.1376692"},{"doi-asserted-by":"crossref","unstructured":"[9] Y. Yang, R. Dunlap, M. Rexroad, and B.F. Cooper, \u201cPerformance of full text search in structured and unstructured peer-to-peer systems,\u201d Proc. IEEE Infocom 2006, April 2006. 10.1109\/infocom.2006.309","key":"9","DOI":"10.1109\/INFOCOM.2006.309"},{"doi-asserted-by":"crossref","unstructured":"[10] M. Bawa, G.S. Manku, and P. Raghvan, \u201cSETS: Search enhanced by topic segmentation,\u201d Proc. ACM SIGIR'03, pp.306-313, Aug. 2003. 10.1145\/860435.860491","key":"10","DOI":"10.1145\/860435.860491"},{"doi-asserted-by":"publisher","unstructured":"[11] Y. Zhu and Y. Hu, \u201cEnhancing search performance on Gnutella-like P2P systems,\u201d IEEE Trans. Parallel Distrib. Syst., vol.17, no.12, pp.1482-1495, Oct. 2006. 10.1109\/tpds.2006.173","key":"11","DOI":"10.1109\/TPDS.2006.173"},{"doi-asserted-by":"publisher","unstructured":"[12] K.C.-J. Lin, C.-P. Wang, C.-F. Chou, and L. Golubchik, \u201cSocioNet: A social-based multimedia access system for unstructured P2P networks,\u201d IEEE Trans. Parallel Distrib. Syst., vol.21, no.7, pp.1027-1041, July 2010. 10.1109\/tpds.2009.134","key":"12","DOI":"10.1109\/TPDS.2009.134"},{"doi-asserted-by":"publisher","unstructured":"[13] M. Li, W.-C. Lee, A. Sivasubramaniam, and J. Zhao, \u201cSSW: A small-world-based overlay for peer-to-peer search,\u201d IEEE Trans. Parallel Distrib. Syst., vol.19, no.6, pp.735-749, June 2008. 10.1109\/tpds.2007.70757","key":"13","DOI":"10.1109\/TPDS.2007.70757"},{"doi-asserted-by":"publisher","unstructured":"[14] G. Chen, C.P. Low, and Z. Yang, \u201cEnhancing search performance in unstructured P2P networks based on user's common interest,\u201d IEEE Trans. Parallel Distrib. Syst., vol.19, no.6, pp.821-836, June 2008. 10.1109\/tpds.2008.42","key":"14","DOI":"10.1109\/TPDS.2008.42"},{"doi-asserted-by":"publisher","unstructured":"[15] H.-C. Hsiao and H.-W. Su, \u201cOn optimizing overlay topologies for search in unstructured peer-to-peer networks,\u201d IEEE Trans. Parallel Distrib. Syst., vol.23, no.5, pp.924-935, May 2012. 10.1109\/tpds.2011.241","key":"15","DOI":"10.1109\/TPDS.2011.241"},{"doi-asserted-by":"crossref","unstructured":"[16] D.M.R. Himali, S.B. Navathe, and S.K. Prasad, \u201cSAS: Semantics aware search in P2P networks,\u201d Proc. IEEE ICDCSW 2013, 2013. 10.1109\/icdcsw.2013.57","key":"16","DOI":"10.1109\/ICDCSW.2013.57"},{"doi-asserted-by":"crossref","unstructured":"[17] K. Sripanidkulchai, B. Maggs, and H. Zhang, \u201cEfficient content location using interest-based locality in peer-to-peer systems,\u201d Proc. IEEE Infocom 2003, pp.2166-2176, April 2003. 10.1109\/infcom.2003.1209237","key":"17","DOI":"10.1109\/INFCOM.2003.1209237"},{"doi-asserted-by":"crossref","unstructured":"[18] S.K.A. Khan and L.N. Tokarchuk, \u201cInterest-based self-organization in group-structured P2P networks,\u201d Proc. IEEE CCNC 2009, 2009. 10.1109\/ccnc.2009.4784959","key":"18","DOI":"10.1109\/CCNC.2009.4784959"},{"doi-asserted-by":"crossref","unstructured":"[19] J. Zheng and G. Zheng, \u201cISW: Interest-based small-world network of P2P,\u201d Proc. IEEE ICCI_CC 2012, 2012. 10.1109\/icci-cc.2012.6311178","key":"19","DOI":"10.1109\/ICCI-CC.2012.6311178"},{"doi-asserted-by":"publisher","unstructured":"[20] J. Risson and T. Moors, \u201cSurvey of research towards robust peer-to-peer networks: Search methods,\u201d Computer Networks, vol.50, no.17, pp.3485-3521, 2006. 10.1016\/j.comnet.2006.02.001","key":"20","DOI":"10.1016\/j.comnet.2006.02.001"},{"doi-asserted-by":"publisher","unstructured":"[21] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, \u201cA scalable content-addressable network,\u201d Proc. ACM SIGCOMM, pp.161-172, Aug. 2001. 10.1145\/964723.383072","key":"21","DOI":"10.1145\/964723.383072"},{"doi-asserted-by":"publisher","unstructured":"[22] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, \u201cChord: A scalable peer-to-peer lookup service for internet applications,\u201d Proc. ACM SIGCOMM, pp.149-160, Aug. 2001. 10.1145\/964723.383071","key":"22","DOI":"10.1145\/964723.383071"},{"doi-asserted-by":"crossref","unstructured":"[23] C. Tang, Z. Xu, and S. Dwarkadas, \u201cPeer-to-peer information retrieval using self-organizing semantic overlay networks,\u201d Proc. ACM SIGCOMM, pp.175-186, Aug. 2003. 10.1145\/863973.863976","key":"23","DOI":"10.1145\/863955.863976"},{"doi-asserted-by":"crossref","unstructured":"[24] C. Gkantsidis, M. Mihail, and A. Saberi, \u201cRandom walks in peer-to-peer networks,\u201d Proc. IEEE Infocom 2004, pp.120-130, April 2004. 10.1109\/infcom.2004.1354487","key":"24","DOI":"10.1109\/INFCOM.2004.1354487"},{"doi-asserted-by":"crossref","unstructured":"[25] R. Dorrigiv, A. Lopez-Ortiz, and P. Pralat, \u201cSearch algorithms for unstructured peer-to-peer networks,\u201d Proc. IEEE LCN 2007, pp.343-352, Oct. 2007. 10.1109\/lcn.2007.65","key":"25","DOI":"10.1109\/LCN.2007.65"},{"doi-asserted-by":"publisher","unstructured":"[26] T. Lin, P. Lin, H. Wang, and C. Chen, \u201cDynamic search algorithm in unstructured peer-to-peer networks,\u201d IEEE Trans. Parallel Distrib. Syst., vol.20, no.5, pp.654-666, May 2009. 10.1109\/tpds.2008.134","key":"26","DOI":"10.1109\/TPDS.2008.134"},{"doi-asserted-by":"crossref","unstructured":"[27] A. Crespo and H. Garcia-Molina, \u201cRouting indices for peer-to-peer systems,\u201d Proc. IEEE ICDCS'02, pp.23-32, July 2002. 10.1109\/icdcs.2002.1022239","key":"27","DOI":"10.1109\/ICDCS.2002.1022239"},{"doi-asserted-by":"crossref","unstructured":"[28] E. Cohen, A. Fiat, and H. Kaplan, \u201cAssociative search in peer to peer networks: Harnessing latent semantics,\u201d Proc. IEEE Infocom 2003, pp.1261-1271, April 2003. 10.1109\/infcom.2003.1208962","key":"28","DOI":"10.1109\/INFCOM.2003.1208962"},{"doi-asserted-by":"crossref","unstructured":"[29] X. Cao and M. Klusch, \u201cS2P2P: Semantic search in unstructured peer-to-peer networks,\u201d Proc. IEEE HPCC_EUC 2013, 2013. 10.1109\/hpcc.and.euc.2013.138","key":"29","DOI":"10.1109\/HPCC.and.EUC.2013.138"},{"doi-asserted-by":"crossref","unstructured":"[30] B. Bollobas, Random Graphs, 2nd ed., Cambridge University Press, 2001. 10.1017\/cbo9780511814068","key":"30","DOI":"10.1017\/CBO9780511814068"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E101.B\/3\/E101.B_2017EBP3024\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T18:50:50Z","timestamp":1750877450000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E101.B\/3\/E101.B_2017EBP3024\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2017ebp3024","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"type":"print","value":"0916-8516"},{"type":"electronic","value":"1745-1345"}],"subject":[],"published":{"date-parts":[[2018]]}}}