{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:50Z","timestamp":1725543410103},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540367079"},{"type":"electronic","value":"9783540368601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11802372_37","type":"book-chapter","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T06:26:36Z","timestamp":1153722396000},"page":"386-397","source":"Crossref","is-referenced-by-count":2,"title":["Cactus: A New Constant-Degree and Fault Tolerate P2P Overlay"],"prefix":"10.1007","author":[{"family":"ShuiChao","sequence":"first","affiliation":[]},{"given":"Huaiming","family":"Wang","sequence":"additional","affiliation":[]},{"family":"ZhouPen","sequence":"additional","affiliation":[]},{"family":"JiaYan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_4","volume-title":"Peer-to-Peer Systems","author":"S. Ratnasamy","year":"2002","unstructured":"Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, Springer, Heidelberg (2002)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Fancis, P., Handley, M.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, San Diego, CA, USA (2001)","DOI":"10.1145\/383059.383072"},{"key":"37_CR3","unstructured":"Chord, S.I.: A scalable peer-to-peer lookup protocol for Internet applications. In: Proceedings of SIGCOMM, San Diego (2001)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peeer-to-peer systems. In: Proceedings of the 18th IFIP\/ACM Internatinal conference on Distributed Systems Platforms, Heidelberg, Germany (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., Tapestry.: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in communications, 22(1) (2004)","DOI":"10.1109\/JSAC.2003.818784"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Shen, H.Y., Xu, C.Z., Chen, G.C.: A new constant-degree and lookup efficient P2P overlay network. In: Proceedings of International Parallel and Distributed Symposium (IPDPS 2004), Santa Fe, USA (2004)","DOI":"10.1109\/IPDPS.2004.1302935"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Malkhi d., Viceroy, R.D.: A scalable and dynamic emulation of the butterfly. In: Proceedings of Principles of Distributed Computing (PODC 2002), Monterey, CA, USA (2002)","DOI":"10.1145\/571825.571857"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Kaashoek, M.F., Koorde, K.R.: A simple degree optimal distributed hash table. In: Proceeding of the 2nd International Workshop on P2P Systems(IPIPS 2003), Berkeley,CA, USA (2003)","DOI":"10.1007\/978-3-540-45172-3_9"},{"issue":"5","key":"37_CR9","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Perparata","year":"1981","unstructured":"Perparata, F.P., Vuillemin, J.: The cube-connented cycles: A versatile network for parallel computation. Communications of the ACM\u00a024(5), 300\u2013309 (1981)","journal-title":"Communications of the ACM"},{"key":"37_CR10","first-page":"248","volume-title":"International Parallel and Distributed Processing Symposium (IPDPS 2003)","author":"D. Wen","year":"2003","unstructured":"Wen, D., Yan, J., Wen-qiang, S., Peng, Z.: A P2P Approach for Global Computing. In: International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France, vol.\u00a04, pp. 248\u2013255. IEEE Computer Society, Los Alamitos (2003)"},{"key":"37_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45074-2_11","volume-title":"Agents and Peer-to-Peer Computing","author":"M. Schlosser","year":"2003","unstructured":"Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: HyperCuP\u2014Hypercubes, Ontologies and Efficient Search on P2P Networks. In: Moro, G., Koubarakis, M. (eds.) AP2PC 2002. LNCS (LNAI), vol.\u00a02530, Springer, Heidelberg (2003)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Aberer, K., Cudre-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: A Self-organizing Structured P2P System. ACM SIGMOD Record, 32(3) (2003)","DOI":"10.1145\/945721.945729"},{"issue":"1","key":"37_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/71.262585","volume":"5","author":"M. Qutaibah","year":"1994","unstructured":"Qutaibah, M., Malluhi, Magdy, A.: The Hierarchical Hypercube: A new Interconnection Topology for Massively parallel systems. IEEE Trans. Parallel Distrib. Syst.\u00a05(1), 17\u201330 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM, San Diego, California, USA (2001)","DOI":"10.1145\/383059.383072"},{"key":"37_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/863955.863998","volume-title":"Proceedings of ACM SIGCOMM","author":"K. Gummadi","year":"2003","unstructured":"Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Schenker, S., Stoica, I.: The Impact of DHT Routing Geometry on Resilience and Proximity. In: Proceedings of ACM SIGCOMM, Germany, pp. 381\u2013394. ACM Press, Karlsruhe (2003)"}],"container-title":["Lecture Notes in Computer Science","Agent Computing and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11802372_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T01:42:56Z","timestamp":1683510176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11802372_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540367079","9783540368601"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11802372_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}