{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T15:11:03Z","timestamp":1686409863804},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T00:00:00Z","timestamp":1318982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s11432-011-4377-6","type":"journal-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T03:42:33Z","timestamp":1318909353000},"page":"2221-2235","source":"Crossref","is-referenced-by-count":9,"title":["Survey of DHT topology construction techniques in virtual computing environments"],"prefix":"10.1007","volume":"54","author":[{"given":"YiMing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiCheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DongSheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,19]]},"reference":[{"key":"4377_CR1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s11432-006-2030-6","volume":"49","author":"X. C. Lu","year":"2006","unstructured":"Lu X C, Wang H M, Wang J. Internet-based virtual computing environment (iVCE): concepts and architecture. Sci China Ser F-Inf, 2006, 49: 681\u2013701","journal-title":"Sci China Ser F-Inf"},{"key":"4377_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1005817.1005818","volume":"47","author":"D. Hoffman","year":"2004","unstructured":"Hoffman D, Novak T, Venkatesh A. Has the Internet become indispensable? Commun ACM, 2004, 47: 37\u201342","journal-title":"Commun ACM"},{"key":"4377_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/606272.606294","volume":"46","author":"D. Schoder","year":"2003","unstructured":"Schoder D, Fischbach K. Peer-to-peer prospects. Commun ACM, 2003, 46: 27\u201329","journal-title":"Commun ACM"},{"key":"4377_CR4","first-page":"20","volume-title":"From P2P to Web Services and Grids","author":"I. J. Taylor","year":"2005","unstructured":"Taylor I J. From P2P to Web Services and Grids. London: Springer-Verlag, 2005. 20\u201323"},{"key":"4377_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H. Balakrishnan","year":"2003","unstructured":"Balakrishnan H, Kaashoek M F, Karger D, et al. Looking up data in P2P systems. Commun ACM, 2003, 46: 43\u201348","journal-title":"Commun ACM"},{"key":"4377_CR6","first-page":"85","volume-title":"Proceedings of the 2nd NSDI","author":"M. Castro","year":"2005","unstructured":"Castro M, Costa M, Rowstron A. Debunking some myths about structured and unstructured overlays. In: Proceedings of the 2nd NSDI. Boston: USENIX Press, 2005. 85\u201398"},{"key":"4377_CR7","doi-asserted-by":"crossref","unstructured":"Daswani N, Molina H G, Yang B. Open problems in data-sharing peer-to-peer systems. ICDT 2003.","DOI":"10.1007\/3-540-36285-1_1"},{"key":"4377_CR8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/1041680.1041681","volume":"36","author":"S. A. Theotokis","year":"2004","unstructured":"Theotokis S A, Spinellis D. Survey of peer-to-peer content distribution technologies. ACM Comput Surv, 2004, 36: 335\u2013371","journal-title":"ACM Comput Surv"},{"key":"4377_CR9","first-page":"21","volume-title":"Research on peer-to-peer resource location in large-scale distributed systems","author":"D. S. Li","year":"2005","unstructured":"Li D S. Research on peer-to-peer resource location in large-scale distributed systems. PhD Thesis. Changsha: National University of Defense Technology, 2005. 21\u201322"},{"key":"4377_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica I, Morris R, Karger D R, et al. Chord: a scalable peer-to-peer lookup service for Internet applications. IEEE ACM Trans Netw, 2003, 11: 17\u201332","journal-title":"IEEE ACM Trans Netw"},{"key":"4377_CR11","first-page":"160","volume-title":"Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS\u201903)","author":"I. Gupta","year":"2003","unstructured":"Gupta I, Birman K, Linga P, et al. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek M F, Stoica I, eds. Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS\u201903). Berkeley: Springer, 2003. 160\u2013169"},{"key":"4377_CR12","first-page":"99","volume-title":"Proceedings of the 2nd NSDI","author":"J. Li","year":"2005","unstructured":"Li J, Stribling J, Morris R, et al. Bandwidth-efficient management of DHT routing tables. In: Proceedings of the 2nd NSDI. Boston: USENIX Press, 2005. 99\u2013114"},{"key":"4377_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"SIGCOMM 2001","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy S, Francis P, Handley M, et al. A scalable content addressable network. In: SIGCOMM 2001. San Diego: ACM Press, 2001. 161\u2013172"},{"key":"4377_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.peva.2005.01.004","volume":"63","author":"H. Y. Shen","year":"2005","unstructured":"Shen H Y, Xu C Z, Chen G H. Cycloid: a scalable constant-degree p2p overlay network. Perform Evaluation, 2005, 63: 195\u2013216","journal-title":"Perform Evaluation"},{"key":"4377_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/258492.258523","volume-title":"Proceedings of SPAA","author":"C. G. Plaxton","year":"1997","unstructured":"Plaxton C G, Rajaraman R, Richa A W. Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of SPAA. Newport: ACM Press, 1997. 311\u2013320"},{"key":"4377_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B. Y. Zhao","year":"2004","unstructured":"Zhao B Y, Huang L, Stribling J, et al. Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Area Comm, 2004, 22: 41\u201353","journal-title":"IEEE J Sel Area Comm"},{"key":"4377_CR17","first-page":"329","volume-title":"IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware)","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. IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware). Heidelberg: Springer, 2001. 329\u2013350"},{"key":"4377_CR18","doi-asserted-by":"crossref","unstructured":"Castro M, Costa M, Rowstron A. Performance and Dependability of Structured Peer-to-Peer Overlays. Technical Report MSR-TR-2003-94, Microsoft Research. 2003","DOI":"10.1109\/DSN.2004.1311872"},{"key":"4377_CR19","first-page":"127","volume-title":"Proceedings of USENIX Annual Technical Conference","author":"S. Rhea","year":"2004","unstructured":"Rhea S, Geels D, Roscoe T, et al. Handling churn in a DHT. In: Proceedings of USENIX Annual Technical Conference. Boston: USENIX Press, 2004. 127\u2013140"},{"key":"4377_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/1080091.1080102","volume-title":"Proceedings of ACM SIGCOMM","author":"S. Rhea","year":"2005","unstructured":"Rhea S, Godfrey B, Karp B, et al. OpenDHT: a public DHT service and its uses. In: Gu\u00e9rin R, Govindan R, Minshall G, eds. Proceedings of ACM SIGCOMM. Philadelphia: ACM Press, 2005. 73\u201384"},{"key":"4377_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Proceedings of International Workshop on Peer-to-Peer Systems (IPTPS\u201902)","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov P, Mazieres D. Kademlia: a peer-to-peer information system based on the xor metric. In: Druschel P, Kaashoek M F, Rowstron A I, eds. Proceedings of International Workshop on Peer-to-Peer Systems (IPTPS\u201902). Cambridge: Springer, 2002. 53\u201365"},{"key":"4377_CR22","first-page":"258","volume-title":"Proceedings of ICNP 2003","author":"A. Kumar","year":"2003","unstructured":"Kumar A, Merugu S, Xu J, et al. Ulysses: a robust, low-diameter, low-latency peer-to-peer network. In: Proceedings of ICNP 2003. Atlanta: IEEE Press, 2003. 258\u2013267"},{"key":"4377_CR23","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/571825.571857","volume-title":"Proceedings of PODC","author":"D. Malkhi","year":"2002","unstructured":"Malkhi D, Naor M, Ratajczak D. Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of PODC. Monterey: ACM Press, 2002. 183\u2013192"},{"key":"4377_CR24","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/3-540-51542-9_36","volume-title":"Workshop on Algorithms and Data Structures","author":"W. Pugh","year":"1989","unstructured":"Pugh W. Skip lists: a probabilistic alternative to balanced trees. In: Dehne F, Sack J, Santoro N, eds. Workshop on Algorithms and Data Structures. Ottawa: Springer, 1989. 437\u2013449"},{"key":"4377_CR25","volume-title":"Proceedings of USITS 2003","author":"N. J. A. Harvey","year":"2003","unstructured":"Harvey N J A, Jones M B, Saroiu S, et al. Skipnet: a scalable overlay network with practical locality properties. In: Proceedings of USITS 2003. Seattle: USENIX Press, 2003."},{"key":"4377_CR26","first-page":"758","volume":"A49","author":"N. G. Bruijn de","year":"1946","unstructured":"de Bruijn N G. A combinatorial problem. Koninklijke Nederlandse Akademie van Wetenschappen P, 1946, A49: 758\u2013764","journal-title":"Koninklijke Nederlandse Akademie van Wetenschappen P"},{"key":"4377_CR27","first-page":"98","volume-title":"Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS\u201903)","author":"F. Kaashoek","year":"2003","unstructured":"Kaashoek F, Karger D. Koorde: a simple degree-optimal distributed hash table. In: Kaashoek M F, Stoica I, eds. Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS\u201903). Berkeley: Springer, 2003. 98\u2013107"},{"key":"4377_CR28","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.tcs.2005.12.006","volume":"355","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud P, Gauron P. D2B: a De Bruijn based content-addressable network. Theor Comput Sci, 2006, 355: 65\u201379","journal-title":"Theor Comput Sci"},{"key":"4377_CR29","first-page":"395","volume-title":"Proceedings of ACM SIGCOMM 2003","author":"D. Loguinov","year":"2003","unstructured":"Loguinov D, Kumar A, Rai V, et al. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: Feldmann A, Zitterbart M, Crowcroft J, et al., eds. Proceedings of ACM SIGCOMM 2003. Karlsruhe: ACM Press, 2003. 395\u2013406"},{"key":"4377_CR30","first-page":"167","volume-title":"Proceedings the International Conference on Peer-to-Peer Computing","author":"A. T. Gai","year":"2004","unstructured":"Gai A T, Viennot L. Broose: a practical distributed Hash table based on the de Bruijn Topology. In: Caronni G, Weiler N, Shahmehri N, eds. Proceedings the International Conference on Peer-to-Peer Computing. Switzerland: IEEE Computer Society, 2004. 167\u2013174"},{"key":"4377_CR31","first-page":"249","volume-title":"Architecture and Design of Digital Computer","author":"W. H. Kautz","year":"1969","unstructured":"Kautz W H. The design of optimum interconnection networks for multiprocessors. In: Architecture and Design of Digital Computer. USA: Springer, 1969. 249\u2013277"},{"key":"4377_CR32","first-page":"1677","volume-title":"Proceedings of IEEE INFOCOM","author":"D. S. Li","year":"2005","unstructured":"Li D S, Lu X C, Wu J. FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs. In: Proceedings of IEEE INFOCOM. Miami: IEEE Computer Society, 2005. 1677\u20131688"},{"key":"4377_CR33","volume-title":"Proceedings of ICDCS 2006","author":"D. S. Li","year":"2006","unstructured":"Li D S, Cao J N, Chan K, et al. Delay-bounded range queries in DHT-based peer-to-peer systems. In: Proceedings of ICDCS 2006. Lisboa: IEEE Computer Society, 2006"},{"key":"4377_CR34","unstructured":"Gupta A, Agrawal D, Abbadi A E. Approximate range selection queries in peer-to-peer systems. In: Proceedings of the 1st Biennial Conference on Innovative Data Systems Research (CIDR). Asilomar, 2003"},{"key":"4377_CR35","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/MIC.2004.1297269","volume":"8","author":"C. Schmidt","year":"2004","unstructured":"Schmidt C, Parashar M. Enabling flexible queries with guarantees in P2P systems. IEEE Internet Comput, 2004, 8: 19\u201326","journal-title":"IEEE Internet Comput"},{"key":"4377_CR36","first-page":"19","volume-title":"Proceedings of WebDB\u201904","author":"P. Ganesan","year":"2004","unstructured":"Ganesan P, Yang B, Molina H G. One torus to rule them all: multidimensional queries in P2P systems. In: Amer-Yahia S, Gravano L, eds. Proceedings of WebDB\u201904. Paris: ACM Press, 2004. 19\u201324"},{"key":"4377_CR37","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1080091.1080104","volume-title":"Proceedings of ACM SIGCOMM","author":"Y. Chawathe","year":"2005","unstructured":"Chawathe Y, Ramabhadran S, Ratnasamy S, et al. A case study in building layered DHT applications. In: Gu\u00e9rin R, Govindan R, Minshall G, eds. Proceedings of ACM SIGCOMM. Philadelphia: ACM Press, 2005. 97\u2013108"},{"key":"4377_CR38","first-page":"13","volume-title":"Proceedings of www 2004","author":"A. Crainiceanu","year":"2004","unstructured":"Crainiceanu A, Linga P, Gehrke J, et al. PTree: a P2P index for resource discovery applications. In: Feldman S, Uretsky M, Najork M, et al., eds. Proceedings of www 2004. New York: ACM Press, 2004. 13\u201319"},{"key":"4377_CR39","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/1015467.1015507","volume-title":"Proceedings of SIGCOMM 2004","author":"A. R. Bharambe","year":"2004","unstructured":"Bharambe A R, Agrawal M, Seshan S. Mercury: supporting scalable multi-attribute range queries. In: Yavatkar R, Zegura E, Rexford J, eds. Proceedings of SIGCOMM 2004. Portland: ACM Press, 2004. 353\u2013366"},{"key":"4377_CR40","volume-title":"Proceedings of the 1st Workshop on Real Large Distributed Systems (WORLDS\u201904)","author":"D. Oppenheimer","year":"2004","unstructured":"Oppenheimer D, Albrecht J, Patterson D, et al. Distributed resource discovery on planetlab with SWORD. In: Proceedings of the 1st Workshop on Real Large Distributed Systems (WORLDS\u201904). Santa Francisco: USENIX Press, 2004"},{"key":"4377_CR41","first-page":"184","volume-title":"Proceedings of the 4th International Workshop on Grid Computing (Grid\u20192003)","author":"M. Cai","year":"2003","unstructured":"Cai M, Frank M, Chen J, et al. MAAN: a multi-attribute addressable network for grid information services. In: Stockinger H, ed. Proceedings of the 4th International Workshop on Grid Computing (Grid\u20192003). Phoenix: IEEE Computer Society, 2003. 184\u2013191"},{"key":"4377_CR42","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/1247480.1247507","volume-title":"Proceedings of SIGMOD 2007","author":"A. Crainiceanu","year":"2007","unstructured":"Crainiceanu A, Linga P, Machanavajjhala A, et al. P-ring: an efficient and robust P2P range index structure. In: Chan C, Beng Ooi C, Zhou A, eds. Proceedings of SIGMOD 2007. Beijing: ACM Press, 2007. 223\u2013234"},{"key":"4377_CR43","first-page":"141","volume-title":"Proceedings of IEEE ICDCS 2008","author":"Y. Tang","year":"2008","unstructured":"Tang Y, Zhou S. LHT: a low-maintenance indexing scheme over DHTs. In: Proceedings of IEEE ICDCS 2008. Beijing: IEEE Computer Society, 2008. 141\u2013151"},{"key":"4377_CR44","first-page":"661","volume-title":"Proceedings of VLDB 2005","author":"H. V. Jagadish","year":"2005","unstructured":"Jagadish H V, Ooi B C, Vu Q H. Baton: a balanced tree structure for peer-to-peer networks. In: B\u00f6hm K, Jensen C, Haas L, eds. Proceedings of VLDB 2005. Trondheim: ACM Press, 2005. 661\u2013672"},{"key":"4377_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1142473.1142475","volume-title":"Proceedings of SIGMOD 2006","author":"H. V. Jagadish","year":"2006","unstructured":"Jagadish H V, Ooi B C, Tan K L, et al. Speeding up search in peer-to-peer networks with a multi-way tree structure. In: Chaudhuri S, Hristidis V, Polyzotis N, eds. Proceedings of SIGMOD 2006. Chicago: ACM Press, 2006. 1\u201312"},{"key":"4377_CR46","unstructured":"Risson J, Moors T. Survey of Research towards Robust Peer-to-Peer Networks: Search Methods. Technical Report UNSW-EE-P2P-1-1. 2004"},{"key":"4377_CR47","first-page":"227","volume-title":"Proceedings of P2P Computing 2004","author":"K. Albrecht","year":"2004","unstructured":"Albrecht K, Arnold R, Gahwiler M, et al. Aggregating information in peer-to-peer systems for improved join and leave. In: Caronni G, Weiler N, Shahmehri N, eds. Proceedings of P2P Computing 2004. Zurich: IEEE Computer Society, 2004. 227\u2013234"},{"key":"4377_CR48","volume-title":"Augmenting DHTs to Support Distributed Resource Discovery","author":"R. Bhagwan","year":"2003","unstructured":"Bhagwan R, Varghese G, Voelker G M. Cone: Augmenting DHTs to Support Distributed Resource Discovery. Technical Report. San Diego: University of California, 2003"},{"key":"4377_CR49","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/1015467.1015509","volume-title":"Proceedings of SIGCOMM 2004","author":"P. Yalagandula","year":"2004","unstructured":"Yalagandula P, Dahlin M. A scalable distributed information management system. In: Yavatkar R, Zegura E, Rexford J, eds. Proceedings of SIGCOMM 2004. Portland: ACM Press, 2004. 379\u2013390"},{"key":"4377_CR50","first-page":"206","volume-title":"Proceedings of PODC 2004","author":"P. Cao","year":"2004","unstructured":"Cao P, Wang Z. Efficient top-K query calculation in distributed networks. In: Chaudhuri S, Kutten S, eds. Proceedings of PODC 2004. Newfoundland: ACM Press, 2004. 206\u2013215"},{"key":"4377_CR51","unstructured":"Huebsch R, Chun B, Hellerstein J M, et al. The architecture of PIER: an internet-scale query processor. In: Proceedings of CIDR 2005. Asilomar, 2005. 28\u201343"},{"key":"4377_CR52","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1360\/jos181933","volume":"18","author":"Y. M. Zhang","year":"2007","unstructured":"Zhang Y M, Li D S, Lu X C. Scalable distributed resource information service for Internet-based virtual computing environment(in Chinese). J Softw, 2007, 18: 1933\u20131942","journal-title":"J Softw"},{"key":"4377_CR53","first-page":"112","volume-title":"Proceedings of EDBT 2006","author":"P. Wu","year":"2006","unstructured":"Wu P, Zhang C, Feng Y, et al. Parallelizing skyline queries for scalable distribution. In: Ioannidis Y, Scholl M, Schmidt J, et al., eds. Proceedings of EDBT 2006. Munich: Spinger Press, 2006. 112\u2013130"},{"key":"4377_CR54","first-page":"160","volume-title":"Proceedings of IEEE ICDCS 2008","author":"L. Chen","year":"2008","unstructured":"Chen L, Cui B, Lu H, et al. iSky: efficient and progressive skyline computing in a structured P2P network. In: Proceedings of IEEE ICDCS 2008. Beijing: IEEE Computer Society, 2008. 160\u2013167"},{"key":"4377_CR55","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/ICWS.2009.124","volume-title":"Proceedings of IEEE International Conference on Web Services 2009 (ICWS\u201909)","author":"Y. M. Zhang","year":"2009","unstructured":"Zhang Y M, Liu L, Li D S, et al. DHT-based range query processing for web service discovery. In: Proceedings of IEEE International Conference on Web Services 2009 (ICWS\u201909). Los Angeles: IEEE Computer Society, 2009. 477\u2013484"},{"key":"4377_CR56","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/93597.98742","volume-title":"Proceedings of ACM International Conference on Management of Data (SIGMOD 1990)","author":"H. V. Jagadish","year":"1990","unstructured":"Jagadish H V. Linear clustering of objects with multiple attributes. In: Garcia-Molina H, Jagadish H, eds. Proceedings of ACM International Conference on Management of Data (SIGMOD 1990). Atlantic City: ACM Press, 1990. 332\u2013342"},{"key":"4377_CR57","unstructured":"Yalagandula P, Dahlin M. Administrative Autonomy in Structured Overlays. Technical Report, University of Texas at Austin. 2006"},{"key":"4377_CR58","first-page":"263","volume-title":"Proceedings of IEEE ICDCS 2004","author":"P. Ganesan","year":"2004","unstructured":"Ganesan P, Gummadi K, Molina H G. Canon in G major: designing DHTs with hierarchical structure. In: Proceedings of IEEE ICDCS 2004. Tokyo: IEEE Computer Society, 2004. 263\u2013272"},{"key":"4377_CR59","doi-asserted-by":"crossref","unstructured":"Karger D, Ruhl M. Diminished chord: a protocol for heterogeneous sub-group formation in peer-to-peer networks. In: Voelker G, Shenker S, eds. IEEE IPTPS 2004. 288\u2013297","DOI":"10.1007\/978-3-540-30183-7_28"},{"key":"4377_CR60","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/JSAC.2010.100104","volume":"28","author":"Y. M. Zhang","year":"2010","unstructured":"Zhang Y M, Li D S, Chen L, et al. Enabling routing control in a DHT. IEEE J Sel Area Comm, 2010, 28: 28\u201338","journal-title":"IEEE J Sel Area Comm"},{"key":"4377_CR61","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-45748-8_4","volume-title":"Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS\u201902)","author":"S. Ratnasamy","year":"2002","unstructured":"Ratnasamy S, Shenker S, Stoica I. Routing algorithms for DHTs: some open questions. In: Druschel P, Kaashoek M, Rowstron A, eds. Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS\u201902). Cambridge: Springer Press, 2002. 45\u201352"},{"key":"4377_CR62","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/JSAC.2003.818805","volume":"22","author":"J. Xu","year":"2004","unstructured":"Xu J, Kumar A, Yu X X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J Sel Area Comm, 2004, 22: 151\u2013163","journal-title":"IEEE J Sel Area Comm"},{"key":"4377_CR63","volume-title":"Proceedings of ICDCS 2006","author":"H. Y. Shen","year":"2006","unstructured":"Shen H Y, Xu C Z. Elastic routing table with probable performance for congestion control in DHT networks. In: Proceedings of ICDCS 2006. Lisboa: IEEE Computer Society, 2006"},{"key":"4377_CR64","first-page":"277","volume-title":"Proceedings of ACM SIGCOMM 2003","author":"H. Y. Zhang","year":"2003","unstructured":"Zhang H Y, Liu B H, Dou W H. Design of a robust active queue management algorithm based on feedback compensation. In: Feldmann A, Zitterbart M, Crowcroft J, et al., eds. Proceedings of ACM SIGCOMM 2003. Karlsruhe: ACM Press, 2003. 277\u2013285"},{"key":"4377_CR65","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1145\/1247480.1247535","volume-title":"Proceedings of SIGMOD 2007","author":"R. Huebsch","year":"2007","unstructured":"Huebsch R, Garofalakis M, Hellerstein J M, et al. Sharing aggregate computation for distributed queries. In: Chan C, Beng Ooi C, Zhou A, eds. Proceedings of SIGMOD 2007. Beijing: ACM Press, 2007. 485\u2013496"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4377-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4377-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4377-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T14:31:15Z","timestamp":1686407475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4377-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,19]]},"references-count":65,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["4377"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4377-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,19]]}}}