{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T07:16:05Z","timestamp":1717139765436},"reference-count":141,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T00:00:00Z","timestamp":1286236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s12083-010-0093-z","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T10:53:58Z","timestamp":1286189638000},"page":"346-375","source":"Crossref","is-referenced-by-count":9,"title":["Survey on hierarchical routing schemes in\u00a0\u201cflat\u201d distributed hash tables"],"prefix":"10.1007","volume":"4","author":[{"given":"Dmitry","family":"Korzun","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Gurtov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,5]]},"reference":[{"issue":"2","key":"93_CR1","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","volume":"7","author":"EK Lua","year":"2005","unstructured":"Lua EK, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials 7(2):72\u201393","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"4","key":"93_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/1041680.1041681","volume":"36","author":"S Androutsellis-Theotokis","year":"2004","unstructured":"Androutsellis-Theotokis S, Spinellis D (2004) A survey of peer-to-peer content distribution technologies. ACM Comput Surv 36(4):335\u2013371","journal-title":"ACM Comput Surv"},{"issue":"17","key":"93_CR3","doi-asserted-by":"crossref","first-page":"3485","DOI":"10.1016\/j.comnet.2006.02.001","volume":"50","author":"J Risson","year":"2006","unstructured":"Risson J, Moors T (2006) Survey of research towards robust peer-to-peer networks: search methods. Comput Networks 50(17):3485\u20133521","journal-title":"Comput Networks"},{"key":"93_CR4","doi-asserted-by":"crossref","unstructured":"Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: Proc. of ACM SIGCOMM\u201903. ACM Press, pp 381\u2013394","DOI":"10.1145\/863955.863998"},{"issue":"1","key":"93_CR5","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 (2004) On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J Sel Areas Commun 22(1):151\u2013163","journal-title":"IEEE J Sel Areas Commun"},{"key":"93_CR6","doi-asserted-by":"crossref","unstructured":"Manku GS (2003) Routing networks for distributed hash tables. In: PODC \u201903: proc. 22nd annual symp. on principles of distributed computing. ACM, pp 133\u2013142","DOI":"10.1145\/872035.872054"},{"key":"93_CR7","unstructured":"Li J, Stribling J, Morris R, Kaashoek MF, Gil TM (2005) A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: Proc. of IEEE INFOCOM\u201905, vol\u00a01. IEEE, pp 225\u2013236"},{"issue":"2","key":"93_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H Balakrishnan","year":"2003","unstructured":"Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I (2003) Looking up data in P2P systems. Commun ACM 46(2):43\u201348","journal-title":"Commun ACM"},{"key":"93_CR9","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Handley PFM, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proc. of ACM SIGCOMM\u201901. ACM Press, pp 161\u2013172","DOI":"10.1145\/383059.383072"},{"key":"93_CR10","unstructured":"Manku GS, Bawa M, Raghavan P (2003) Symphony: distributed hashing in a small world. In: USITS\u201903: proc. 4th USENIX symp. on internet technologies and systems. USENIX Association, pp 127\u2013140"},{"key":"93_CR11","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM\u201901. ACM Press, pp 149\u2013160","DOI":"10.1145\/383059.383071"},{"key":"93_CR12","doi-asserted-by":"crossref","unstructured":"Maymounkov P, Mazi\u00e8res D (2002) Kademlia: a peer-to-peer information system based on the XOR metric. In: IPTPS \u201902: proc. 1st int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 2429. Springer, pp\u00a053\u201365","DOI":"10.1007\/3-540-45748-8_5"},{"key":"93_CR13","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Middleware\u201901: proc. of IFIP\/ACM int\u2019l conf. on distributed systems platforms. Lecture notes in computer science, vol 2218. Springer-Verlag, pp 329\u2013350","DOI":"10.1007\/3-540-45518-3_18"},{"issue":"1","key":"93_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"BY Zhao","year":"2004","unstructured":"Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Commun 22(1):41\u201353","journal-title":"IEEE J Sel Areas Commun"},{"key":"93_CR15","unstructured":"Kaashoek MF, Karger DR (2003) Koorde: a simple degree-optimal distributed hash table. In: IPTPS \u201903: proc. 2nd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 2735. Springer, pp 98\u2013107"},{"key":"93_CR16","unstructured":"Gai AT, Viennot L (2004) Broose: a practical distributed hashtable based on the De-Bruijn topology. In: IEEE P2P \u201904: proc. 4th int\u2019l conf. on peer-to-peer computing. IEEE Computer Society, pp 167\u2013164"},{"key":"93_CR17","doi-asserted-by":"crossref","unstructured":"Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC \u201902: Proc. 21st annual symp. on principles of distributed computing. ACM Press, pp 183\u2013192","DOI":"10.1145\/571825.571857"},{"key":"93_CR18","doi-asserted-by":"crossref","unstructured":"Abraham I, Malkhi D, Manku GS (2005) Papillon: greedy routing in rings. In: DISC \u201905: proc. of 19th int. conf. on distributed computing. Lecture notes in computer science, vol 3724. Springer, pp 514\u2013515","DOI":"10.1007\/11561927_47"},{"key":"93_CR19","doi-asserted-by":"crossref","unstructured":"Krishnamurthy B, Wang J, Xie Y (2001) Early measurements of a cluster-based architecture for P2P systems. In: IMW \u201901: proc. 1st ACM SIGCOMM workshop on internet measurement. ACM, pp 105\u2013109","DOI":"10.1145\/505202.505216"},{"key":"93_CR20","unstructured":"Yang B, Garcia-Molina H (2003) Designing a super-peer network. In: ICDE\u201903: proc. 19th int\u2019l conf. on data engineering, pp 49\u201360"},{"key":"93_CR21","doi-asserted-by":"crossref","unstructured":"Zhao BY, Duan Y, Joseph LHAD, Huang L, Joseph AD, Kubiatowicz JD (2002) Brocade: lAndmark routing on overlay networks. In: IPTPS \u201902: proc. 1st int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol\u00a02429. Springer, pp 34\u201344","DOI":"10.1007\/3-540-45748-8_3"},{"key":"93_CR22","unstructured":"Zhu Y, Wang H, Hu Y (2003) A super-peer based lookup in structured peer-to-peer systems. In: ISCA PDCS 2003: proc. of ISCA 16th int\u2019l conf. on parallel and distributed computing systems, pp 465\u2013470"},{"key":"93_CR23","doi-asserted-by":"crossref","unstructured":"Freedman MJ, Mazi\u00e8res D (2003) Sloppy hashing and self-organizing clusters. In: IPTPS \u201903: proc. 2nd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 2735. Springer, pp 45\u201355","DOI":"10.1007\/978-3-540-45172-3_4"},{"key":"93_CR24","unstructured":"Xu Z, Min R, Hu Y (2003) HIERAS: a DHT based hierarchical P2P routing algorithm. In: ICPP 2003: proc. 32nd int\u2019l conf. on parallel processing. IEEE Computer Society, pp 187\u2013194"},{"key":"93_CR25","doi-asserted-by":"crossref","unstructured":"Garc\u00e9s-Erice L, Biersack E, Felber PA, Ross KW, Urvoy-Keller G (2003) Hierarchical peer-to-peer systems. In: Euro-Par 2003: proc. of ACM\/IFIP int\u2019l conf. on parallel and distributed computing, pp 643\u2013657","DOI":"10.1007\/978-3-540-45209-6_166"},{"key":"93_CR26","doi-asserted-by":"crossref","unstructured":"Garc\u00e9s-Erice L, Ross KW, Biersack EW, Felber P, Urvoy-Keller G (2003) Topology-centric look-up service. In: Group communications and charges. NGC 2003: proc. of the 5th int. workshop on networked group communication. Lecture notes in computer science, vol 2816. Springer, pp 58\u201369","DOI":"10.1007\/978-3-540-39405-1_6"},{"key":"93_CR27","doi-asserted-by":"crossref","unstructured":"Gupta I, Birman K, Linga P, Demers A, van Renesse R (2003) Kelips: building an efficient and stable P2P DHT through increased memory and background overhead. In: IPTPS \u201903: proc. 2nd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 2735. Springer, pp\u00a0160\u2013169","DOI":"10.1007\/978-3-540-45172-3_15"},{"key":"93_CR28","doi-asserted-by":"crossref","unstructured":"Mizrak AT, Cheng Y, Kumar V, Savage S (2003) Structured superpeers: leveraging heterogeneity to provide constant-time lookup. In: WIAPP 2003: proc. 3rd IEEE workshop on internet applications, pp 104\u2013111","DOI":"10.1109\/WIAPP.2003.1210294"},{"key":"93_CR29","unstructured":"Gupta A, Liskov B, Rodrigues R (2004) Efficient routing for peer-to-peer overlays. In: Proc. 1st symp. on networked systems design and implementation (NSDI \u201904)"},{"issue":"9","key":"93_CR30","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/TPDS.2008.222","volume":"20","author":"P Fonseca","year":"2009","unstructured":"Fonseca P, Rodrigues R, Gupta A, Liskov B (2009) Full-information lookups for peer-to-peer overlays. IEEE Trans Parallel Distrib Syst 20(9):1339\u20131351","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"93_CR31","unstructured":"Ganesan P, Gummadi K, Garcia-Molina H (2004) Canon in G major: designing DHTs with hierarchical structure. In: ICDCS \u201904: proc. 24th int\u2019l conf. on distributed computing systems. IEEE Computer Society, pp 263\u2013272"},{"key":"93_CR32","unstructured":"Karger DR, Ruhl M (2004) Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks. In: IPTPS \u201904: proc. 3rd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 3279. Springer, pp 288\u2013297"},{"key":"93_CR33","doi-asserted-by":"crossref","unstructured":"Zhang Y, Li D, Chen L, Lu X (2008) Flexible routing in grouped DHTs. In: IEEE P2P \u201908: proc. 8th int\u2019l conf. on peer-to-peer computing. IEEE Computer Society, pp 109\u2013118","DOI":"10.1109\/P2P.2008.43"},{"key":"93_CR34","doi-asserted-by":"crossref","unstructured":"Singh A, Liu L (2004) A hybrid topology architecture for P2P systems. In: ICCCN 2004: proc. 13th int\u2019l conf. on computer communications and networks, pp 475\u2013480","DOI":"10.1109\/ICCCN.2004.1401711"},{"key":"93_CR35","unstructured":"Mislove A, Druschel P (2004) Providing administrative control and autonomy in structured peer-to-peer overlays. In: IPTPS \u201904: proc. 3rd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 3279. Springer, pp\u00a0162\u2013172"},{"key":"93_CR36","doi-asserted-by":"crossref","unstructured":"Artigas MS, Lopez PG, Ahullo JP, Skarmeta AFG (2005) Cyclone: a novel design schema for hierarchical DHTs. In: IEEE P2P \u201905: proc. 5th int\u2019l conf. on peer-to-peer computing. IEEE Computer Society, pp 49\u201356","DOI":"10.1109\/P2P.2005.5"},{"key":"93_CR37","doi-asserted-by":"crossref","unstructured":"Zoels S, Despotovic Z, Kellerer W (2006) Cost-based analysis of hierarchical DHT design. In: IEEE P2P \u201906: proc. 6th int\u2019l conf. on peer-to-peer computing. IEEE Computer Society, pp 233\u2013239","DOI":"10.1109\/P2P.2006.13"},{"key":"93_CR38","doi-asserted-by":"crossref","unstructured":"Zoels S, Despotovic Z, Kellerer W (2007) Load balancing in a hierarchical DHT-based P2P system. In: COLCOM \u201907: proc. of 2007 int\u2019l conf. on collaborative computing: networking, applications and worksharing. IEEE Computer Society, pp 353\u2013361","DOI":"10.1109\/COLCOM.2007.4553855"},{"issue":"3","key":"93_CR39","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.comcom.2007.08.033","volume":"31","author":"S Zoels","year":"2008","unstructured":"Zoels S, Despotovic Z, Kellerer W (2008) On hierarchical DHT systems\u2014an analytical approach for optimal designs. Comput Commun 31(3):576\u2013590","journal-title":"Comput Commun"},{"key":"93_CR40","doi-asserted-by":"crossref","unstructured":"Zoels S, Eichhorn M, Tarlano A, Kellerer W (2006) Content-based hierarchies in DHT-based peer-to-peer systems. In: SAINT workshops 2006: proc. int\u2019l symp. on applications and the internet workshops. IEEE Computer Society, pp 105\u2013108","DOI":"10.1109\/SAINT-W.2006.12"},{"key":"93_CR41","doi-asserted-by":"crossref","unstructured":"Tian R, Xiong Y, Zhang Q, Li B, Zhao BY, Li, X (2005) Hybrid overlay structure based on random walks. In: IPTPS \u201905: proc. 4th int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 3640. Springer, pp 152\u2013162","DOI":"10.1007\/11558989_14"},{"key":"93_CR42","doi-asserted-by":"crossref","unstructured":"Park K, Pack S, Kwon T (2008) Proximity based peer-to-peer overlay networks (P3ON) with load distribution. In: ICOIN 2007: int. conf. on information networking. Towards ubiquitous networking and services. Revised selected papers. Springer-Verlag, pp 234\u2013243","DOI":"10.1007\/978-3-540-89524-4_24"},{"issue":"3","key":"93_CR43","first-page":"712","volume":"51","author":"YJ Joung","year":"2007","unstructured":"Joung YJ, Wang JC (2007) Chord2: a two-layer chord for reducing maintenance overhead via heterogeneity. Comput Commun 51(3):712\u2013731","journal-title":"Comput Commun"},{"key":"93_CR44","doi-asserted-by":"crossref","unstructured":"Zhang XM, Wang YJ, Li Z (2007) Research of routing algorithm in hierarchy-adaptive P2P systems. In: ISPA 2007: proc. 5th int\u2019l symp. on parallel and distributed processing and applications. Lecture notes in computer science, vol\u00a04742. Springer, pp 728\u2013739","DOI":"10.1007\/978-3-540-74742-0_65"},{"key":"93_CR45","doi-asserted-by":"crossref","unstructured":"Martinez-Yelmo I, Cuevas R, Guerrero C, Mauthe A (2008) Routing performance in a hierarchical DHT-based overlay network. In: PDP 2008: proc. 16th euromicro conf. on parallel, distributed and network-based processing. IEEE Computer Society, pp 508\u2013515","DOI":"10.1109\/PDP.2008.79"},{"issue":"4","key":"93_CR46","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1504\/IJIPT.2008.023772","volume":"3","author":"I Martinez-Yelmo","year":"2008","unstructured":"Martinez-Yelmo I, Bikfalvi A, Guerrero C, Rumin RC, Mauthe A (2008) Enabling global multimedia distributed services based on hierarchical DHT overlay networks. Int\u2019l J Internet Protocol Technol (IJIPT) 3(4):234\u2013244","journal-title":"Int\u2019l J Internet Protocol Technol (IJIPT)"},{"key":"93_CR47","doi-asserted-by":"crossref","unstructured":"Martinez-Yelmo I, Guerrero C, Rum\u00edn RC, Mauthe A (2009) A hierarchical P2PSIP architecture to support skype-like services. In: PDP 2009: proc. of 17th Euromicro int. conf. on parallel, distributed and network-based processing. IEEE Computer Society, pp 316\u2013322","DOI":"10.1109\/PDP.2009.27"},{"key":"93_CR48","doi-asserted-by":"crossref","unstructured":"Guisheng Y, Jie S, Xianghui W (2008) Hierarchical small-world P2P networks. In: ICICSE \u201908: proc. int\u2019l conf. on internet computing in science and engineering. IEEE Computer Society, pp 452\u2013458","DOI":"10.1109\/ICICSE.2008.94"},{"issue":"5","key":"93_CR49","first-page":"729","volume":"15","author":"Z Ou","year":"2010","unstructured":"Ou Z, Harjula E, Koskela T, Ylianttila M (2010) GTPP: general truncated pyramid peer-to-peer architecture over structured DHT networks. MONET 15(5):729\u2013749. doi: 10.1007\/s11036-009-0193-2","journal-title":"MONET"},{"key":"93_CR50","unstructured":"Xu Z, Zhang Z (2002) Building low-maintenance expressways for P2P systems. Techical report HPL-2002-41, HP Labs, Palo Alto"},{"issue":"3","key":"93_CR51","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1273340.1273350","volume":"3","author":"M Naor","year":"2007","unstructured":"Naor M, Wieder U (2007) Novel architectures for P2P applications: the continuous-discrete approach. ACM Trans Algorithms 3(3):37","journal-title":"ACM Trans Algorithms"},{"key":"93_CR52","doi-asserted-by":"crossref","unstructured":"Naor M, Wieder U (2003) A simple fault tolerant distributed hash table. In: IPTPS \u201903: proc. 2nd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol\u00a02735. Springer, pp 88\u201397","DOI":"10.1007\/978-3-540-45172-3_8"},{"issue":"1","key":"93_CR53","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. :(2006) D2B: a de Bruijn based content-addressable network. Theor Comput Sci 355(1):65\u201379","journal-title":"Theor Comput Sci"},{"issue":"5","key":"93_CR54","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/TNET.2005.857072","volume":"13","author":"D Loguinov","year":"2005","unstructured":"Loguinov D, Kumar A, Rai V, Ganesh S (2005) Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. IEEE\/ACM Trans Netw 13(5):1107\u20131120","journal-title":"IEEE\/ACM Trans Netw"},{"key":"93_CR55","doi-asserted-by":"crossref","unstructured":"Zhang H, Goel A, Govindan R (2003) Incrementally improving lookup latency in distributed hash table systems. In: Proc. 2003 ACM SIGMETRICS int\u2019l conf. on measurement and modeling of computer systems. ACM, pp 114\u2013125","DOI":"10.1145\/781027.781042"},{"key":"93_CR56","unstructured":"Dabek F, Li J, Sit E, Robertson J, Kaashoek MF, Morris R (2004) Designing a DHT for low latency and high throughput. In: Proc. 1st symp. on networked systems design and implementation (NSDI \u201904), pp 85\u201398"},{"key":"93_CR57","doi-asserted-by":"crossref","unstructured":"Zhao BY, Huang L, Stribling J, Joseph AD, Kubiatowicz JD (2003) Exploiting routing redundancy via structured peer-to-peer overlays. In: ICNP \u201903: proc. 11th IEEE int\u2019l conf. on network protocols, pp 246\u2013257","DOI":"10.1109\/ICNP.2003.1249775"},{"key":"93_CR58","unstructured":"Castro M, Drushel P, Hu Y, Rowstron A (2003) Proximity neighbor selection in tree-based structured peer-to-peer overlays. Technical report MSR-TR-2002-52, Microsoft research"},{"key":"93_CR59","doi-asserted-by":"crossref","unstructured":"Hildrum K, Kubiatowicz J (2003) Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: DISC \u201903: proc. 17th int\u2019l symp. on distributed computing, pp 321\u2013336","DOI":"10.1007\/978-3-540-39989-6_23"},{"key":"93_CR60","doi-asserted-by":"crossref","unstructured":"Korzun D, Nechaev B, Gurtov A (2009) Cyclic routing: generalizing lookahead in peer-to-peer networks. In: AICCSA2009: proc. 7th IEEE\/ACS int\u2019l conf. on computer systems and applications. IEEE Computer Society, pp 697\u2013704","DOI":"10.1109\/AICCSA.2009.5069403"},{"key":"93_CR61","doi-asserted-by":"crossref","unstructured":"Danezis G, Lesniewski-Laas C, Kaashoek MF, Anderson R (2005) Sybil-resistant DHT routing. In: Proc. 10th European symp. on research in computer security, pp 305\u2013318","DOI":"10.1007\/11555827_18"},{"issue":"4","key":"93_CR62","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/MIC.2007.81","volume":"11","author":"S Serbu","year":"2007","unstructured":"Serbu S, Bianchi S, Kropf P, Felber P (2007) Dynamic load sharing in peer-to-peer systems: when some peers are more equal than others. IEEE Internet Computing 11(4):53\u201361","journal-title":"IEEE Internet Computing"},{"key":"93_CR63","doi-asserted-by":"crossref","unstructured":"Manku GS, Naor M, Wieder U (2004) Know thy neighbor\u2019s neighbor: the power of lookahead in randomized P2P networks. In: STOC \u201904: proc. 36th annual acm symp. on theory of computing. ACM, pp 54\u201363","DOI":"10.1145\/1007352.1007368"},{"key":"93_CR64","doi-asserted-by":"crossref","unstructured":"Naor M, Wieder U (2004) Know thy neighbor\u2019s neighbor: better routing for skip-graphs and small worlds. In: IPTPS \u201904: proc. 3rd int\u2019l workshop on peer-to-peer systems. Lecture notes in computer science, vol 3279. Springer","DOI":"10.1007\/978-3-540-30183-7_26"},{"key":"93_CR65","unstructured":"Freedman MJ, Vingralek R (2002) Efficient peer-to-peer lookup based on a distributed trie. In: IPTPS\u00a0\u201901: revised papers from 1st int\u2019l workshop on peer-to-peer systems. Springer-Verlag, pp 66\u201375"},{"key":"93_CR66","doi-asserted-by":"crossref","unstructured":"Leong B, Liskov B, Demaine E (2004) Epichord: parallelizing the Chord lookup algorithm with reactive routing state management. In: ICON 2004: proc. 12th int\u2019l conf. on networks, pp 270\u2013276","DOI":"10.1109\/ICON.2004.1409145"},{"key":"93_CR67","unstructured":"Li J, Stribling J, Morris R, Kaashoek MF (2005) Bandwidth-efficient management of DHT routing tables. In: Proc. of the 2nd symposium on networked systems design and implementation (NSDI \u201905), pp 99\u2013114"},{"key":"93_CR68","unstructured":"Hu J, Li M, Zheng W, Wang D, Ning N, Dong H (2004) Smartboa: constructing P2P overlay network in the heterogeneous internet using irregular routing tables. In: IPTPS \u201904: proc. 3rd int\u2019l workshop on peer-to-peer systems. Lecture Notes in Computer Science, vol 3279. Springer, pp 278\u2013287"},{"issue":"1","key":"93_CR69","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1071690.1064216","volume":"33","author":"C Tang","year":"2005","unstructured":"Tang C, Buco MJ, Chang RN, Dwarkadas S, Luan LZ, So E, Ward C (2005) Low traffic overlay networks with large routing tables. SIGMETRICS Perform Eval Rev 33(1):14\u201325","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"93_CR70","doi-asserted-by":"crossref","unstructured":"Monnerat LR, Amorim CL (2006) D1HT: a distributed one hop hash table. In: IPDPS 2006: proc. 20th IEEE int\u2019l symp. on parallel and distributed processing. IEEE Computer Society","DOI":"10.1109\/IPDPS.2006.1639278"},{"key":"93_CR71","doi-asserted-by":"crossref","unstructured":"Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I (2001) Wide-area cooperative storage with CFS. In: SOSP \u201901: proc. 18th ACM symp. operating systems principles. ACM Press, pp 202\u2013215","DOI":"10.1145\/502034.502054"},{"key":"93_CR72","unstructured":"Ramasubramanian V, Sirer EG (2004) Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In: Proc. 1st symp. on networked systems design and implementation (NSDI \u201904), pp 99\u2013112"},{"key":"93_CR73","doi-asserted-by":"crossref","unstructured":"Zhang H, Jin H, Zhang Q (2009) Yarqs: yet another range queries schema in DHT based P2P network. In: CIT \u201909: proc. 9th IEEE int\u2019l conf. on computer and information technology. IEEE Computer Society, pp 51\u201356","DOI":"10.1109\/CIT.2009.78"},{"key":"93_CR74","unstructured":"Fiat A, Saia J (2002) Censorship resistant peer-to-peer content addressable networks. In: SODA \u201902: proc. 13th annual ACM-SIAM symp. on discrete algorithms. Society for Industrial and Applied Mathematics, 94\u2013103"},{"key":"93_CR75","doi-asserted-by":"crossref","unstructured":"Saia J, Fiat A, Gribble SD, Karlin AR, Saroiu S (2002) Dynamically fault-tolerant content addressable networks. In: IPTPS \u201901: revised papers from 1st int. workshop on peer-to-peer systems. Springer-Verlag, pp 270\u2013279","DOI":"10.1007\/3-540-45748-8_26"},{"issue":"3","key":"93_CR76","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.peva.2005.01.004","volume":"63","author":"H Shen","year":"2006","unstructured":"Shen H, Xu CZ, Chen G (2006) Cycloid: a constant-degree and lookup-efficient p2p overlay network. Perform Eval 63(3):195\u2013216","journal-title":"Perform Eval"},{"key":"93_CR77","doi-asserted-by":"crossref","unstructured":"Konstantinou I, Tsoumakos D, Koziris N (2009) Measuring the cost of online load-balancing in distributed range-queriable systems. In: IEEE P2P\u00a0\u201909: proc. 9th int\u2019l conf. on peer-to-peer computing. IEEE, pp 135\u2013138","DOI":"10.1109\/P2P.2009.5284544"},{"key":"93_CR78","unstructured":"Abraham I, Awerbuch B, Azar Y, Bartal Y, Malkhi D, Pavlov E (2003) A generic scheme for building overlay networks in adversarial scenarios. In: IPDPS \u201903: proc. 17th int\u2019l symp. on parallel and distributed processing. IEEE Computer Society, p 40.2"},{"key":"93_CR79","unstructured":"Karger DR, Ruhl M (2004) Simple efficient load balancing algorithms for peer-to-peer systems. In: SPAA \u201904: proc. 16th annual ACM symp. on parallelism in algorithms and architectures. ACM, pp 36\u201343"},{"key":"93_CR80","doi-asserted-by":"crossref","unstructured":"Risson J, Harwood A, Moors T (2006) Stable high-capacity one-hop distributed hash tables. In: ISCC \u201906: proc. 11th IEEE symp. on computers and communications. IEEE Computer Society, pp 687\u2013694","DOI":"10.1109\/ISCC.2006.152"},{"key":"93_CR81","unstructured":"Aspnes J, Shah G (2003) Skip graphs. In: SODA \u201903: proc. 14th annual ACM-SIAM symp. on discrete algorithms. Society for Industrial and Applied Mathematics, pp 384\u2013393"},{"key":"93_CR82","unstructured":"Harvey NJA, Jones MB, Saroiu S, Theimer M, Wolman A (2003) SkipNet: a scalable overlay network with practical locality properties. In: USITS\u201903: proc. 4th USENIX symp. on internet technologies and systems. USENIX Association"},{"issue":"3","key":"93_CR83","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/945721.945729","volume":"32","author":"K Aberer","year":"2003","unstructured":"Aberer K, Cudr\u00e9-Mauroux P, Datta A, Despotovic Z, Hauswirth M, Punceva M, Schmidt R (2003) P-Grid: a self-organizing structured P2P system. SIGMOD Rec 32(3):29\u201333","journal-title":"SIGMOD Rec"},{"key":"93_CR84","unstructured":"Li D, Lu X, Wu J (2005) FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs. In: Proc. of IEEE INFOCOM\u201905. IEEE, pp 1677\u20131688"},{"key":"93_CR85","doi-asserted-by":"crossref","unstructured":"Guo D, Wu J, Chen H, Luo X (2007) Moore: an extendable peer-to-peer network based on incomplete Kautz digraph with constant degree. In: Proc. of IEEE INFOCOM\u201907. IEEE, pp 821\u2013829","DOI":"10.1109\/INFCOM.2007.101"},{"key":"93_CR86","doi-asserted-by":"crossref","unstructured":"Guo D, Liu Y, Li XY (2008) BAKE: a balanced Kautz tree structure for peer-to-peer networks. In: Proc. of IEEE INFOCOM\u201908. IEEE, pp 2450\u20132457","DOI":"10.1109\/INFOCOM.2008.315"},{"issue":"4","key":"93_CR87","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/s11432-009-0016-x","volume":"52","author":"Y Zhang","year":"2009","unstructured":"Zhang Y, Lu X, Li D (2009) SKY: efficient peer-to-peer networks based on distributed Kautz graphs. Sci China, F Inf Sci 52(4):588\u2013601","journal-title":"Sci China, F Inf Sci"},{"key":"93_CR88","unstructured":"Godfrey PB, Stoica I (2005) Heterogeneity and load balance in distributed hash tables. In: Proc. of IEEE INFOCOM\u201905. IEEE, pp 596\u2013606"},{"issue":"3","key":"93_CR89","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.peva.2005.01.003","volume":"63","author":"S Surana","year":"2006","unstructured":"Surana S, Godfrey B, Lakshminarayanan K, Karp R, Stoica I (2006) Load balancing in dynamic structured peer-to-peer systems. Perform Eval 63(3):217\u2013240","journal-title":"Perform Eval"},{"key":"93_CR90","unstructured":"Rufino J, Alves A, Exposto J, Pina A (2004) A cluster oriented model for dynamically balanced DHTs. In: IPDPS\u201904: proc. 18th int\u2019l symp. on parallel and distributed processing. IEEE Computer Society"},{"key":"93_CR91","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Handley M, Karp R, Shenker S (2002) Topologically-aware overlay construction and server selection. In: Proc. of IEEE INFOCOM\u201902","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"93_CR92","doi-asserted-by":"crossref","unstructured":"Ratti S, Hariri B, Shirmohammadi S (2008) NL-DHT: a non-uniform locality sensitive DHT architecture for massively multi-user virtual environment applications. In: ICPADS \u201908: proc. 14th IEEE int\u2019l conf. on parallel and distributed systems. IEEE Computer Society, pp 793\u2013798","DOI":"10.1109\/ICPADS.2008.32"},{"key":"93_CR93","doi-asserted-by":"crossref","unstructured":"Xu Z, Mahalingam M, Karlsson M (2003) Turning heterogeneity into an advantage in overlay routing. In: Proc. of IEEE INFOCOM\u201903, pp 1499\u20131509","DOI":"10.1109\/INFCOM.2003.1208985"},{"issue":"5","key":"93_CR94","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1016\/j.jpdc.2007.10.005","volume":"68","author":"H Shen","year":"2008","unstructured":"Shen H, Xu CZ (2008) Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks. J Parallel Distrib Comput 68(5):686\u2013702","journal-title":"J Parallel Distrib Comput"},{"key":"93_CR95","doi-asserted-by":"crossref","unstructured":"Tang C, Xu Z, Dwarkadas S (2003) Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proc. of ACM SIGCOMM\u201903. ACM Press, pp\u00a0175\u2013186","DOI":"10.1145\/863955.863976"},{"key":"93_CR96","doi-asserted-by":"crossref","unstructured":"Wan Y, Asaka T, Takahashi T (2008) A hybrid P2P overlay network for non-strictly hierarchically categorized contents. In: CCGRID \u201908: proc. 8th IEEE int\u2019l symp. on cluster computing and the Grid. IEEE Computer Society, pp 41\u201348","DOI":"10.1109\/CCGRID.2008.10"},{"key":"93_CR97","unstructured":"Li J, Vuong S (2005) Ontology-based clustering and routing in peer-to-peer networks. In: PDCAT \u201905: proc. 6th int\u2019l conf. on parallel and distributed computing applications and technologies. IEEE Computer Society, pp 791\u2013795"},{"issue":"4","key":"93_CR98","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.comnet.2006.07.005","volume":"51","author":"J Lee","year":"2007","unstructured":"Lee J, Lee H, Kang S, Kim SM, Song J (2007) CISS: an efficient object clustering framework for DHT-based peer-to-peer applications. Comput Netw 51(4):1072\u20131094","journal-title":"Comput Netw"},{"issue":"5","key":"93_CR99","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.jpdc.2007.01.005","volume":"67","author":"Y Zhu","year":"2007","unstructured":"Zhu Y, Hu Y (2007) Efficient semantic search on DHT overlays. J Parallel Distrib Comput 67(5):604\u2013616","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"93_CR100","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/1030194.1015507","volume":"34","author":"AR Bharambe","year":"2004","unstructured":"Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. SIGCOMM Comput Commun Rev 34(4):353\u2013366","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"93_CR101","doi-asserted-by":"crossref","unstructured":"Bejan A, Ghosh S (2005) Self-optimizing DHTs using request profiling. In: OPODIS 2004: proc. 8th int\u2019l conf. on principles of distributed systems. Revised selected papers. Lecture notes in computer science, vol 3544. Springer, pp\u00a0140\u2013153","DOI":"10.1007\/11516798_10"},{"key":"93_CR102","doi-asserted-by":"crossref","unstructured":"Kleinberg JM (2006) Complex networks and decentralized search algorithms. In: ICM 2006: proc. int\u2019l congress of mathematicians. European Mathematical Society","DOI":"10.4171\/022-3\/50"},{"key":"93_CR103","doi-asserted-by":"crossref","unstructured":"Kleinberg JM (2000) The small-world phenomenon: an algorithm perspective. In: STOC \u201900: proc. 32nd annual ACM symp. theory of computing. ACM Press, pp 163\u2013170","DOI":"10.1145\/335305.335325"},{"key":"93_CR104","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re L, Fraigniaud P, Kranakis E, Krizanc D (2001) Efficient routing in networks with long range contacts. In: DISC \u201901: proc. 15th int\u2019l conf. on distributed computing. Springer-Verlag, pp 270\u2013284","DOI":"10.1007\/3-540-45414-4_19"},{"key":"93_CR105","doi-asserted-by":"crossref","unstructured":"Duchon P, Hanusse N, Lebhar E, Schabanel N (2006) Towards small world emergence. In: SPAA \u201906: proc. 18th annual ACM symp. on parallelism in algorithms and architectures. ACM, pp 225\u2013232","DOI":"10.1145\/1148109.1148145"},{"key":"93_CR106","doi-asserted-by":"crossref","unstructured":"Plaxton CG, Rajaraman R, Richa AW (1997) Accessing nearby copies of replicated objects in a distributed environment. In: Proc. 9th annual symp. on parallel algorithms and architectures (SPAA \u201997), pp 311\u2013320","DOI":"10.1145\/258492.258523"},{"key":"93_CR107","unstructured":"Kleinberg JM (2001) Small-world phenomena and the dynamics of information. In: NIPS: advances in neural information processing systems 14. MIT Press, pp 431\u2013438"},{"key":"93_CR108","unstructured":"Ng TSE, Chu YH, Rao SG, Sripanidkulchai K, Zhang H (2003) Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems. In: Proc. of IEEE INFOCOM\u201903, vol\u00a03, pp 2199\u20132209"},{"key":"93_CR109","unstructured":"Ledlie, J, Shneidman, J, Amis, M, Mitzenmacher M, Seltzer M (2003) Reliability- and capacity-based selection in distributed hash tables. Computer science technical report, Harvard University"},{"issue":"1","key":"93_CR110","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00224-007-9074-x","volume":"45","author":"G Chiola","year":"2009","unstructured":"Chiola G, Cordasco G, Gargano L, Hammar M, Negro A, Scarano V (2009) Degree-optimal routing for P2P systems. Theor Comput Syst 45(1):43\u201363","journal-title":"Theor Comput Syst"},{"issue":"4","key":"93_CR111","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/1364644.1364646","volume":"35","author":"D Korzun","year":"2008","unstructured":"Korzun D, Gurtov A (2008) A diophantine model of routes in structured P2P overlays. ACM SIGMETRICS Perform Eval Rev 35(4):52\u201361","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"key":"93_CR112","unstructured":"Monnerat LR, Amorim CL (2009) Peer-to-peer single hop distributed hash tables. In: Proc. of IEEE Globecom\u201909"},{"issue":"5","key":"93_CR113","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TPDS.2008.145","volume":"20","author":"J Risson","year":"2009","unstructured":"Risson J, Harwood A, Moors T (2009) Topology dissemination for reliable one-hop distributed hash tables. IEEE Trans Parallel Distrib Syst 20(5):680\u2013694","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"93_CR114","unstructured":"Roussopoulos M, Baker M (2003) CUP: controlled update propagation in peer-to-peer networks. In: Proc. of the USENIX annual technical conference, pp 167\u2013180"},{"key":"93_CR115","doi-asserted-by":"crossref","unstructured":"Kenthapadi K, Manku GS (2005) Decentralized algorithms using both local and random probes for P2P load balancing. In: SPAA \u201905: proc. 17th annual ACM symp. on parallelism in algorithms and architectures. ACM, pp 135\u2013144","DOI":"10.1145\/1073970.1073990"},{"key":"93_CR116","doi-asserted-by":"crossref","unstructured":"Ledlie J, Seltzer MI (2005) Distributed, secure load balancing with skew, heterogeneity and churn. In: Proc. of IEEE INFOCOM\u201905. IEEE, pp 1419\u20131430","DOI":"10.1109\/INFCOM.2005.1498366"},{"key":"93_CR117","doi-asserted-by":"crossref","unstructured":"Castro M, Drushel P, Ganesh A, Rowstron A, Wallach DS (2002) Secure routing for structured peer-to-peer overlay networks. In: Proc. 5th USENIX symp. on operating system design and implementation (OSDI 2002). ACM Press, Boston, MA, pp 299\u2013314","DOI":"10.1145\/1060289.1060317"},{"key":"93_CR118","doi-asserted-by":"crossref","unstructured":"Ganesan P, Bawa M, Garcia-Molina H (2004) Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB \u201904: proc. 30th int\u2019l conf. on very large data bases. VLDB Endowment, pp 444\u2013455","DOI":"10.1016\/B978-012088469-8.50041-3"},{"issue":"4","key":"93_CR119","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/TKDE.2008.182","volume":"21","author":"QH Vu","year":"2009","unstructured":"Vu QH, Ooi BC, Rinard M, Tan KL (2009) Histogram-based global load balancing in structured peer-to-peer systems. IEEE Trans Knowl Data Eng 21(4):595\u2013608","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"93_CR120","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: STOC \u201997: proc. 29th annual ACM symp. on theory of computing. ACM, pp 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"93_CR121","doi-asserted-by":"crossref","unstructured":"Aspnes J, Wieder U (2005) The expansion and mixing time of skip graphs with applications. In: SPAA \u201905: proc. 17th annual ACM symp. on parallelism in algorithms and architectures. ACM, pp 126\u2013134","DOI":"10.1145\/1073970.1073989"},{"issue":"4","key":"93_CR122","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.ipl.2004.01.019","volume":"90","author":"NJA Harvey","year":"2004","unstructured":"Harvey NJA, Munro JI (2004) Deterministic SkipNet. Inf Process Lett 90(4):205\u2013208","journal-title":"Inf Process Lett"},{"key":"93_CR123","doi-asserted-by":"crossref","unstructured":"Aspnes J, Kirsch J, Krishnamurthy A (2004) Load balancing and locality in range-queriable data structures. In: PODC \u201904: proc. 23rd annual ACM symp. on principles of distributed computing. ACM, pp 115\u2013124","DOI":"10.1145\/1011767.1011785"},{"key":"93_CR124","doi-asserted-by":"crossref","unstructured":"Hengkui W, Fuhong L, Hongke Z (2009) Reducing maintenance overhead via heterogeneity in skip graphs. In: IC-BNMT \u201909: proc. 2nd IEEE int\u2019l conf. on broadband network & multimedia technology. IEEE, pp 638\u2013642","DOI":"10.1109\/ICBNMT.2009.5347832"},{"key":"93_CR125","doi-asserted-by":"crossref","unstructured":"Jacob R, Richa A, Scheideler C, Schmid S, T\u00e4ubig H (2009) A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: PODC \u201909: proc. 28th ACM symp. on principles of distributed computing. ACM, pp 131\u2013140","DOI":"10.1145\/1582716.1582741"},{"key":"93_CR126","doi-asserted-by":"crossref","unstructured":"Huang X, Chen L, Huang L, Li M (2005) Routing algorithm using SkipNet and small-world for peer-to-peer system. In: GCC 2005: proc. 4th int\u2019l conf. on grid and cooperative computing. Lecture Notes in Computer Science, vol 3795. Springer, pp 984\u2013989","DOI":"10.1007\/11590354_119"},{"key":"93_CR127","doi-asserted-by":"crossref","unstructured":"Fujita S, Ohtsubo A, Mito M (2005) Extended skip graphs for efficient key search in P2P environment. In: ISPAN \u201905: proc. 8th int\u2019l symp. on parallel architectures,algorithms and networks. IEEE Computer Society, pp 256\u2013261","DOI":"10.1109\/ISPAN.2005.45"},{"key":"93_CR128","unstructured":"Zatloukal KC, Harvey NJA (2004) Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. In: SODA \u201904: proc. 15th annual ACM-SIAM symp. on discrete algorithms. Society for Industrial and Applied Mathematics, pp 308\u2013317"},{"key":"93_CR129","doi-asserted-by":"crossref","unstructured":"Goodrich MT, Nelson MJ, Sun JZ (2006) The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. In: SODA \u201906: proc. 17th annual ACM-SIAM symp. on discrete algorithm. ACM, pp 384\u2013393","DOI":"10.1145\/1109557.1109601"},{"key":"93_CR130","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Scheideler C (2003) Peer-to-peer systems for prefix search. In: PODC \u201903: proc. 21st annual symp. on principles of distributed computing. ACM, pp 123\u2013132","DOI":"10.1145\/872035.872053"},{"key":"93_CR131","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Handurukande SB, Huguenin K, Kermarrec AM, Le\u00a0Fessant F, Riviere E (2006) Gosskip, an efficient, fault-tolerant and self organizing overlay using gossip-based construction and skip-lists principles. In: IEEE P2P \u201906: proc. 6th int\u2019l conf. on peer-to-peer computing. IEEE Computer Society, pp 12\u201322","DOI":"10.1109\/P2P.2006.19"},{"key":"93_CR132","doi-asserted-by":"crossref","unstructured":"Arge L, Eppstein D, Goodrich MT (2005) Skip-webs: efficient distributed data structures for multi-dimensional data sets. In: PODC \u201905: proc. 24th annual ACM symp. on principles of distributed computing. ACM, pp 69\u201376","DOI":"10.1145\/1073814.1073827"},{"key":"93_CR133","doi-asserted-by":"crossref","unstructured":"Zhou G, Yu J (2009) pService: towards similarity search on peer-to-peer web services discovery. In: Conf. on advances in P2P systems. IEEE Computer Society, pp 111\u2013115","DOI":"10.1109\/AP2PS.2009.25"},{"key":"93_CR134","first-page":"159","volume-title":"IEEE P2P \u201904: proc","author":"A Datta","year":"2004","unstructured":"Datta A, Girdzijauskas S, Aberer K (2004) On de bruijn routing in distributed hash tables: there and back again. In: IEEE P2P \u201904: proc. 4th int. conf. on peer-to-peer computing. IEEE Computer Society, pp 159\u2013166"},{"key":"93_CR135","doi-asserted-by":"crossref","unstructured":"Wepiwe G, Simeonov PL (2005) A concentric multi-ring overlay for highly reliable P2P networks. In: NCA \u201905: proc. 4th IEEE int\u2019l symp. on network computing and applications. IEEE Computer Society, pp 83\u201390","DOI":"10.1109\/NCA.2005.1"},{"key":"93_CR136","doi-asserted-by":"crossref","unstructured":"Zhang Y, Liu L, Li D, Lu X (2008) Distributed line graphs: a universal framework for building DHTs based on arbitrary constant-degree graphs. In: ICDCS 2008: proc. 28th IEEE int\u2019l conf. on distributed computing systems. IEEE Computer Society, pp 152\u2013159","DOI":"10.1109\/ICDCS.2008.35"},{"key":"93_CR137","unstructured":"Liu B, Lee WC, Lee DL (2005) Supporting complex multi-dimensional queries in P2P systems. In: ICDCS \u201905: proc. 25th IEEE int\u2019l conf. on distributed computing systems. IEEE Computer Society, pp 155\u2013164"},{"issue":"2","key":"93_CR138","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1639562.1639572","volume":"37","author":"D Korzun","year":"2009","unstructured":"Korzun D, Gurtov A (2009) A local equilibrium model for P2P resource ranking. ACM SIGMETRICS Perform. Eval. Rev. 37(2):27\u201329","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"93_CR139","doi-asserted-by":"crossref","unstructured":"Yu Q, Xu T, Ye B, Lu S, Chen D (2009) SkipStream: a clustered skip graph based on-demand streaming scheme over ubiquitous environments. In: ICPP \u201909: proc. 2009 int\u2019l conference on parallel processing. IEEE Computer Society, pp 269\u2013276","DOI":"10.1109\/ICPP.2009.57"},{"issue":"4","key":"93_CR140","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers SB, Krishnamurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE Trans Comput 38(4):555\u2013566","journal-title":"IEEE Trans Comput"},{"key":"93_CR141","doi-asserted-by":"crossref","unstructured":"Qu C, Nejdl W, Kriesell M (2004) Cayley DHTs\u2014a group-theoretic framework for analyzing DHTs based on Cayley graphs. In: ISPA 2004: proc. 2nd int\u2019l symp. on parallel and distributed processing and applications. Lecture notes in computer science, vol 3358. Springer, pp 914\u2013925","DOI":"10.1007\/978-3-540-30566-8_105"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-010-0093-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-010-0093-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-010-0093-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T22:22:01Z","timestamp":1711837321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-010-0093-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,5]]},"references-count":141,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["93"],"URL":"https:\/\/doi.org\/10.1007\/s12083-010-0093-z","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,5]]}}}