{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:57Z","timestamp":1725558957206},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142451"},{"type":"electronic","value":"9783642142468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14246-8_8","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T10:09:26Z","timestamp":1278410966000},"page":"47-61","source":"Crossref","is-referenced-by-count":0,"title":["FISH: A Novel Peer-to-Peer Overlay Network Based on Hyper-deBruijn"],"prefix":"10.1007","author":[{"given":"Ye","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yongjiao","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Chawathe, Y., Ratnasamy, S., Breslau, L., et al.: Making gnutella-like P2P systems scalable. In: Proceedings of ATAPCC 2003 (2003)","DOI":"10.1145\/863955.864000"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-44751-2_15","volume-title":"Cooperative Information Systems","author":"K. Aberer","year":"2001","unstructured":"Aberer, K.: P-Grid: A self-organizing access structure for P2P information systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol.\u00a02172, p. 179. Springer, Heidelberg (2001)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383072"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object ocation and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383071"},{"key":"8_CR6","unstructured":"Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. In: Proceedings of the ACM SIGCOMM"},{"key":"8_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"112","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-Hypercubes, Ontologies and P2P Networks. In: Moro, G., Koubarakis, M. (eds.) AP2PC 2002. LNCS (LNAI), vol.\u00a02530, pp. 112\u2013124. Springer, Heidelberg (2003)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b11823","volume-title":"Peer-to-Peer Systems II","author":"F. Kaashoek","year":"2003","unstructured":"Kaashoek, F., Karger, D.R.: Koorde: A simple degreeoptimal hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"8_CR9","unstructured":"Fraigniaud, P., Gauron, P.: The content-addressable network d2b. Technical Report LRI 1349, Univ. Paris-Sud (2003)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Peer-to-Peer Systems II","author":"M. Naor","year":"2003","unstructured":"Naor, M., Wieder, U.: A Simple Fault Tolerant Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ganesan, E., Pradhan, D.K.: The Hyper-deBruijn Multiprocessor networks. IEEE Transaction (1991)","DOI":"10.1109\/ICDCS.1991.148716"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. Texas A&M Technical Report (2003)","DOI":"10.1145\/863955.863999"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"C.L. Seitz","year":"1985","unstructured":"Seitz, C.L.: The cosmic cube. Commun. ACM\u00a028, 22\u201333 (1985)","journal-title":"Commun. ACM"},{"key":"8_CR14","first-page":"758","volume":"49","author":"N.D. Bruijn de","year":"1946","unstructured":"de Bruijn, N.D.: A combinatorial problem. Koninklijke Nederlandse academie van Wetenschappen\u00a049, 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse academie van Wetenschappen"},{"key":"8_CR15","unstructured":"Schlumberger, M.L.: De Bruijn communication networks. Doctoral Dissertation, Dept. of Computer Science, Stanford University, PALO Alto, CA (1974)"},{"issue":"6","key":"8_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TC.1981.1675809","volume":"C30","author":"M. Imase","year":"1981","unstructured":"Imase, M., Itoh, M.: Design to minimized diameter on build-block network. IEEE Transactions on Computers\u00a0C30(6), 439\u2013443 (1981)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Ganesan, E., Pradhan, D.K.: Wormhole routing in de Bruijn networks and hyper-de Bruijn networks. In: Circuits and Systems, ISCAS 2003 (2003)","DOI":"10.1109\/ISCAS.2003.1205158"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Bridges, W.G., Toueg, S.: On the Impossibility of Directed Moore Graphs. Journal of Combinatorial Theory, series\u00a0B29(3) (1980)","DOI":"10.1016\/0095-8956(80)90091-X"},{"key":"8_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/11530657","volume-title":"Peer-to-Peer System and Applications","author":"Steinmetz","year":"2005","unstructured":"Steinmetz, Wehrle: Peer-to-Peer System and Applications. Springer, Heidelberg (2005)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (2002)","DOI":"10.1145\/571825.571857"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Crainiceanu, A., Linga, P., et al.: P-Ring: An efficient and roubust P2P range index structure. In: Proceedings of SIGMOD 2007 (2007)","DOI":"10.1145\/1247480.1247507"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Physical Review E\u00a064(046135) (2001)","DOI":"10.1103\/PhysRevE.64.046135"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: the power of lookahead in randomized P2P networks. In: STOC 2004 (2004)","DOI":"10.1145\/1007352.1007368"},{"key":"8_CR24","unstructured":"Caro, G.D., Ducatelle, F., Heegaard, P., Jelasity, M., Montemanni, R., Montresor, A.: Evaluation of basic services in ahn, p2p and grid networks (February 2005), http:\/\/www.cs.unibo.it\/bison\/deliverables\/D07.pdf"},{"key":"8_CR25","first-page":"171","volume-title":"Proceedings of the 32nd Annual ACM Symposium on Theory of Computing","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 171\u2013180. ACM Press, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14246-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:49:59Z","timestamp":1606168199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14246-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142451","9783642142468"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14246-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}