{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:40:08Z","timestamp":1748832008525,"version":"3.41.0"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transcom.2015adp0011","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T22:19:10Z","timestamp":1459462750000},"page":"830-840","source":"Crossref","is-referenced-by-count":1,"title":["Living Will for Resilient Structured Overlay Networks"],"prefix":"10.23919","volume":"E99.B","author":[{"given":"Kimihiro","family":"MIZUTANI","sequence":"first","affiliation":[{"name":"NTT Network Innovation Labs, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeru","family":"INOUE","sequence":"additional","affiliation":[{"name":"NTT Network Innovation Labs, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toru","family":"MANO","sequence":"additional","affiliation":[{"name":"NTT Network Innovation Labs, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"AKASHI","sequence":"additional","affiliation":[{"name":"NTT Network Innovation Labs, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"MATSUURA","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutoshi","family":"FUJIKAWA","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] A. Rowstron and P. Druschel, \u201cPastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,\u201d Middleware 2001, Lecture Notes in Computer Science, vol.2218, pp.329-350, Springer, 2001."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] A.R. Bharambe, M. Agrawal, and S. Seshan, \u201cMercury: Supporting scalable multi-attribute range queries,\u201d SIGCOMM Comput. Commun. Rev., vol.34, no.4, pp.353-366, 2004.","DOI":"10.1145\/1030194.1015507"},{"key":"3","unstructured":"[3] G.S. Manku, M. Bawa, and P. Raghavan, \u201cSymphony: Distributed hashing in a small world,\u201d Proc. USENIX Symposium on Internet Technologies and Systems, USITS, pp.127-140, USENIX Association, Berkeley, CA, USA, 2003."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, \u201cTapestry: A resilient global-scale overlay for service deployment,\u201d IEEE J. Sel. Areas. Commun., vol.22, no.1, pp.41-53, 2004.","DOI":"10.1109\/JSAC.2003.818784"},{"key":"5","unstructured":"[5] M. Castro, M. Costa, and A. Rowstron, \u201cDebunking some myths about structured and unstructured overlays,\u201d Proc. 2nd Conference on Symposium on Networked Systems Design & Implementation, vol.2, pp.85-98, 2005"},{"key":"6","unstructured":"[6] S.Q. Zhuang, D. Geels, I. Stoica, and R.H. Katz, \u201cOn failure detection algorithms in overlay networks,\u201d Proc. IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., pp.2112-2123, 2005."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] I. Dedinski, A. Hofmann, and B. Sick, \u201cCooperative keep-alives: An efficient outage detection algorithm for P2P overlay networks,\u201d Proc. Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), pp.140-150, 2007.","DOI":"10.1109\/P2P.2007.26"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] K. Mizutani, S. Matsuura, S. Doi, K. Fujikawa, and H. Sunahara, \u201cAn implementation and its evaluation of a framework for managing states of nodes among structured overlay networks,\u201d 2010 Sixth International Conference on Networking and Services (ICNS), pp.282-287, 2010.","DOI":"10.1109\/ICNS.2010.46"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] G. Ghinita and Y.M. Teo, \u201cAn adaptive stabilization framework for distributed hash tables,\u201d Proc. 20th IEEE International Parallel & Distributed Processing Symposium, 2006.","DOI":"10.1109\/IPDPS.2006.1639269"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D. Stutzbach and R. Rejaie, \u201cUnderstanding churn in peer-to-peer networks,\u201d Proc. 6th ACM SIGCOMM on Internet Measurement, IMC'06, pp.189-202, 2006.","DOI":"10.1145\/1177080.1177105"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C. Chi and K. Koyanagi, \u201cA flexible maintenance approach for structured P2P networks under churn,\u201d 2012 IEEE 14th International Conference on Communication Technology, pp.273-278, 2012.","DOI":"10.1109\/ICCT.2012.6511228"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R. Price, P. Tino, and G. Theodoropoulos, \u201cStill alive: Extending keep-alive intervals in P2P overlay networks,\u201d Mobile Netw. Appl., vol.17, no.3, pp.378-394, 2012.","DOI":"10.1007\/s11036-011-0317-3"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] K.C.W. So and E.G. Sirer, \u201cLatency and bandwidth-minimizing failure detectors,\u201d SIGOPS Oper. Syst. Rev., vol.41, no.3, pp.89-99, 2007.","DOI":"10.1145\/1272998.1273008"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A. Demers, D. Greene, C. Hauser, W. Irish, and J. Larson, \u201cEpidemic algorithms for replicated database maintenance,\u201d Proc. Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC'87, pp.1-12, 1987.","DOI":"10.1145\/41840.41841"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. Koubarakis, C. Tryfonopoulos, S. Idreos, and Y. Drougas, \u201cSelective information dissemination in P2P networks: Problems and solutions,\u201d ACM SIGMOD Record, vol.32, no.3, pp.71-76, Sept. 2003.","DOI":"10.1145\/945721.945736"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] P.T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulie, \u201cEpidemic information dissemination in distributed systems,\u201d Computer, vol.37, no.5, pp.60-67, 2004.","DOI":"10.1109\/MC.2004.1297243"},{"key":"17","unstructured":"[17] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, \u201cHandling churn in a DHT,\u201d Proc. USENIX Technical Conference, ATEC'04, pp.127-140, USENIX Association, 2004."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M. Hefeeda and O. Saleh, \u201cTraffic modeling and proportional partial caching for peer-to-peer systems,\u201d IEEE\/ACM Trans. Netw., vol.16, no.6, pp.1447-1460, 2008.","DOI":"10.1109\/TNET.2008.918081"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] B. Leong, B. Liskov, and E.D. Demaine, \u201cEpiChord: Parallelizing the chord lookup algorithm with reactive routing state management,\u201d Comput. Commun., vol.29, no.9, pp.1243-1259, 2006.","DOI":"10.1016\/j.comcom.2005.10.002"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] L.R. Monnerat and C.L. Amorim, \u201cD1HT: A distributed one hop hash table,\u201d Proc. 20th IEEE International Parallel & Distributed Processing Symposium, 2006.","DOI":"10.1109\/IPDPS.2006.1639278"},{"key":"21","unstructured":"[21] P. Maymounkov and D. Mazi\u00e8res, \u201cKademlia: A peer-to-peer information system based on the XOR metric,\u201d Peer-to-Peer Systems, Lecture Notes in Computer Science, vol.2429, pp.53-65, Springer, 2002."},{"key":"22","unstructured":"[22] N.J. Harvey, M.B. Jones, S. Saroiu, M. Theimer, and A. Wolman, \u201cSkipNet: A scalable overlay network with practical locality properties,\u201d Proc. USENIX Symposium on Internet Technologies and Systems, pp.1-9, 2003."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/4\/E99.B_2015ADP0011\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:11:26Z","timestamp":1748830286000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/4\/E99.B_2015ADP0011\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2015adp0011","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"type":"print","value":"0916-8516"},{"type":"electronic","value":"1745-1345"}],"subject":[],"published":{"date-parts":[[2016]]}}}