{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:20Z","timestamp":1744217420173},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1073990","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"135-144","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Decentralized algorithms using both local and random probes for P2P load balancing"],"prefix":"10.1145","author":[{"given":"Krishnaram","family":"Kenthapadi","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Gurmeet Singh","family":"Manku","sequence":"additional","affiliation":[{"name":"Google Inc."}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/838237.838599"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"e_1_3_2_1_3_1","volume-title":"II. Available as http:\/\/www.math.tau.ac.il\/~nogaa\/PDFFS\/publications.html","author":"Alon Noga","year":"2004","unstructured":"Noga Alon . Problems and results in extremal combinatorics , II. Available as http:\/\/www.math.tau.ac.il\/~nogaa\/PDFFS\/publications.html , 2004 .]] Noga Alon. Problems and results in extremal combinatorics, II. Available as http:\/\/www.math.tau.ac.il\/~nogaa\/PDFFS\/publications.html, 2004.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011785"},{"key":"e_1_3_2_1_5_1","first-page":"384","volume-title":"Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003","author":"Aspnes James","year":"2003","unstructured":"James Aspnes and Gauri Shah . Skip graphs . In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003 ), pages 384 -- 393 , January 2003 .]] James Aspnes and Gauri Shah. Skip graphs. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pages 384--393, January 2003.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007921"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-37795-6_19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199809)13:2%3C99::AID-RSA1%3E3.0.CO;2-M"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872056"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316729"},{"key":"e_1_3_2_1_14_1","first-page":"169","volume-title":"Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004","author":"Ganesan Prasanna","year":"2004","unstructured":"Prasanna Ganesan and Gurmeet Singh Manku . Optimal routing in Chord . In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004 ), pages 169 -- 178 , January 2004 .]] Prasanna Ganesan and Gurmeet Singh Manku. Optimal routing in Chord. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pages 169--178, January 2004.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073872"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354648"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. IEEE INFOCOM 2005","author":"Brighten Godfrey P.","year":"2004","unstructured":"P. Brighten Godfrey and Ion Stoica . Heterogeneity and load balance in distributed hash tables . In Proc. IEEE INFOCOM 2005 , March 2004 .]] P. Brighten Godfrey and Ion Stoica. Heterogeneity and load balance in distributed hash tables. In Proc. IEEE INFOCOM 2005, March 2004.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322254"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003)","author":"Harvey Nicholas J A","year":"2003","unstructured":"Nicholas J A Harvey , Michael Jones , Stefan Saroiu , Marvin Theimer , and Alec Wolman . SkipNet : A scalable overlay network with practical locality properties . In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003) , 2003 .]] Nicholas J A Harvey, Michael Jones, Stefan Saroiu, Marvin Theimer, and Alec Wolman. SkipNet: A scalable overlay network with practical locality properties. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003), 2003.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_22_1","volume-title":"Urn Models and their Applications: An Approach to Modern Discrete Probability Theory","author":"Johnson Norman Lloyd","year":"1977","unstructured":"Norman Lloyd Johnson and Samuel Kotz . Urn Models and their Applications: An Approach to Modern Discrete Probability Theory . John Wiley and Sons , 1977 .]] Norman Lloyd Johnson and Samuel Kotz. Urn Models and their Applications: An Approach to Modern Discrete Probability Theory. John Wiley and Sons, 1977.]]"},{"key":"e_1_3_2_1_23_1","first-page":"98","volume-title":"Proc. 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS 2003","author":"Frans Kaashoek M.","year":"2003","unstructured":"M. Frans Kaashoek and David R Karger . Koorde : A simple degree-optimal hash table . In Proc. 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS 2003 ), pages 98 -- 107 , 2003 .]] M. Frans Kaashoek and David R Karger. Koorde: A simple degree-optimal hash table. In Proc. 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS 2003), pages 98--107, 2003.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007919"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011786"},{"key":"e_1_3_2_1_27_1","volume-title":"Random Allocations. V H Winston & Sons","author":"Kolchin Valentin F","year":"1978","unstructured":"Valentin F Kolchin , Boris A Sevast'yanov , and Vladimir P Chistyakov . Random Allocations. V H Winston & Sons , 1978 .]] Valentin F Kolchin, Boris A Sevast'yanov, and Vladimir P Chistyakov. Random Allocations. V H Winston & Sons, 1978.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/951950.952227"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863999"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872054"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011797"},{"key":"e_1_3_2_1_34_1","first-page":"127","volume-title":"Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003","author":"Manku Gurmeet Singh","year":"2003","unstructured":"Gurmeet Singh Manku , Mayank Bawa , and Prabhakar Raghavan . Symphony : Distributed hashing in a small world . In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003 ), pages 127 -- 140 , 2003 .]] Gurmeet Singh Manku, Mayank Bawa, and Prabhakar Raghavan. Symphony: Distributed hashing in a small world. In Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS 2003), pages 127--140, 2003.]]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687801"},{"key":"e_1_3_2_1_38_1","series-title":"Vol 1","volume-title":"Handbook of Randomized Computing","author":"Mitzenmacher Michael","year":"2001","unstructured":"Michael Mitzenmacher , Andrea W Richa , and R Sitaraman . The power of two random choices: A survey of techniques and results . In Handbook of Randomized Computing ( Vol 1 ) . Kluwer Academic Press , 2001 .]] Michael Mitzenmacher, Andrea W Richa, and R Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing (Vol 1). Kluwer Academic Press, 2001.]]"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"Motwani Rajeev","year":"1995","unstructured":"Rajeev Motwani and Prabhakar Raghavan . Randomized Algorithms . Cambridge University Press , 1995 .]] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.]]"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_3_2_1_41_1","series-title":"Lecture Notes in Computer Science 1518","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-49543-6_13","volume-title":"Randomization and Approximation Techniques in Computer Science (RANDOM","author":"Raab Martin","year":"1998","unstructured":"Martin Raab and Angelika Steger . Balls into bins -- a simple and tight analysis . In Randomization and Approximation Techniques in Computer Science (RANDOM 1998 ), Lecture Notes in Computer Science 1518 , pages 159 -- 170 , October 1998.]] Martin Raab and Angelika Steger. Balls into bins -- a simple and tight analysis. In Randomization and Approximation Techniques in Computer Science (RANDOM 1998), Lecture Notes in Computer Science 1518, pages 159--170, October 1998.]]"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_43_1","first-page":"127","volume-title":"Proc. 2004 USENIX Annual Technical Conference","author":"Rhea Sean","year":"2004","unstructured":"Sean Rhea , Denis Geels , Timothy Roscoe , and John Kubiatowicz . Handling churn in a DHT . In Proc. 2004 USENIX Annual Technical Conference , pages 127 -- 140 , June 2004 .]] Sean Rhea, Denis Geels, Timothy Roscoe, and John Kubiatowicz. Handling churn in a DHT. In Proc. 2004 USENIX Annual Technical Conference, pages 127--140, June 2004.]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781042"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818784"}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Las Vegas Nevada USA","acronym":"SPAA05"},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1073990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:25:00Z","timestamp":1673144700000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1073990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":45,"alternative-id":["10.1145\/1073970.1073990","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1073990","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}