{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T10:10:55Z","timestamp":1790849455760,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540290681","type":"print"},{"value":"9783540319061","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558989_14","type":"book-chapter","created":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T08:51:51Z","timestamp":1130921511000},"page":"152-162","source":"Crossref","is-referenced-by-count":25,"title":["Hybrid Overlay Structure Based on Random Walks"],"prefix":"10.1007","author":[{"given":"Ruixiong","family":"Tian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongqiang","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben Y.","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"The pinger project"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00259-9","volume":"181","author":"T. Asano","year":"1997","unstructured":"Asano, T., et al.: Space-filling curves and their use in the design of geometric data structures. Theoretical Computer Science\u00a0181(1), 3\u201315 (1997)","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","unstructured":"Castro, M., Druschel, P., Hu, Y., Rowstron, A.: Exploiting network proximity in distributed hash tables. In: International Workshop on Peer-to-Peer Systems (2002)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chu, Y., Rao, S., Seshan, S., Zhang, H.: Enabling conferencing applications on the internet using an overlay multicast architecture. In: ACM SIGCOMM (August 2001)","DOI":"10.1145\/383059.383064"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: a decentralized network coordinate system. In: ACM SIGCOMM (2004)","DOI":"10.1145\/1015467.1015471"},{"key":"14_CR6","unstructured":"Fill, A.: Reversible markov chains and random walks on graphs"},{"key":"14_CR7","unstructured":"Ganesan, P., Gummadi, K., Garcia-Molina, H.: Canon in g major: Designing dhts with hierarchical structure. In: ICDCS (March 2004)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: IEEE INFOCOM (March 2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"issue":"3","key":"14_CR9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/TPDS.2003.1189583","volume":"14","author":"A.-M. Kermarrec","year":"2003","unstructured":"Kermarrec, A.-M., Massoulie, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed systems 14(3), 248\u2013258 (2003)","journal-title":"IEEE Transactions on Parallel and Distributed systems"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Knutsson, B., Lu, H., Xu, W., Hopkins, B.: Peer-to-peer support for massively multiplayer games. In: IEEE INFOCOM (March 2004)","DOI":"10.1109\/INFCOM.2004.1354485"},{"key":"14_CR11","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. In: ACM SIGCOMM (August 2003)","DOI":"10.1145\/863955.863999"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Ng, T.S.E., Zhang, H.: Towards global network positioning. In: ACM SIGCOMM IMW (2001)","DOI":"10.1145\/505202.505206"},{"key":"14_CR13","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, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Kermarrec, A.-M., Castro, M., Druschel, P.: Scribe: The design of a large-scale event notification infrastructure. In: NGC (UCL, London) (November 2001)","DOI":"10.1007\/3-540-45546-9_3"},{"issue":"2","key":"14_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TNET.2004.826277","volume":"12","author":"S. Sen","year":"2004","unstructured":"Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. IEEE\/ACM Trans. on Networking 12(2), 219\u2013232 (2004)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Xu, Z., Mathalingam, M., Karlsson, M.: Turning heterogeneity into an advantage in overlay routing. In: IEEE INFOCOM (June 2003)","DOI":"10.1109\/INFCOM.2003.1208985"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, X., et al.: A construction of locality-aware overlay network: moverlay and its performance. IEEE JSAC (January 2004)","DOI":"10.1109\/JSAC.2003.818780"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-45748-8_3","volume-title":"Peer-to-Peer Systems","author":"B.Y. Zhao","year":"2002","unstructured":"Zhao, B.Y., et al.: Brocade: Landmark routing on overlay networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A., et al. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 34. Springer, Heidelberg (2002)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., et al.: Tapestry: A resilient global-scale overlay for service deployment. IEEE JSAC 22(1), 41\u201353 (January 2004)","DOI":"10.1109\/JSAC.2003.818784"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Zhuang, S.Q., et al.: Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: NOSSDAV (2001)","DOI":"10.21236\/ADA603200"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558989_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T16:09:24Z","timestamp":1586534964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558989_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290681","9783540319061"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11558989_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}