{"id":"https://openalex.org/W2127441060","doi":"https://doi.org/10.1145/1007912.1007919","title":"Simple efficient load balancing algorithms for peer-to-peer systems","display_name":"Simple efficient load balancing algorithms for peer-to-peer systems","publication_year":2004,"publication_date":"2004-06-27","ids":{"openalex":"https://openalex.org/W2127441060","doi":"https://doi.org/10.1145/1007912.1007919","mag":"2127441060"},"language":"en","primary_location":{"id":"doi:10.1145/1007912.1007919","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":["MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA","MIT, Computer Science and Artificial Intelligence Laboratory, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"MIT, Computer Science and Artificial Intelligence Laboratory, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048492425","display_name":"Matthias R\u00fchl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthias Ruhl","raw_affiliation_strings":["IBM Almaden Research Center, San Jose, CA","IBM Almaden Research Center San Jose , CA"],"affiliations":[{"raw_affiliation_string":"IBM Almaden Research Center, San Jose, CA","institution_ids":["https://openalex.org/I4210085935"]},{"raw_affiliation_string":"IBM Almaden Research Center San Jose , CA","institution_ids":["https://openalex.org/I4210085935"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":23.1755,"has_fulltext":false,"cited_by_count":324,"citation_normalized_percentile":{"value":0.99560052,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7882067561149597},{"id":"https://openalex.org/keywords/chord","display_name":"Chord (peer-to-peer)","score":0.7592841386795044},{"id":"https://openalex.org/keywords/distributed-hash-table","display_name":"Distributed hash table","score":0.7489340901374817},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.7173165082931519},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6420755386352539},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5971615314483643},{"id":"https://openalex.org/keywords/peer-to-peer","display_name":"Peer-to-peer","score":0.5787718296051025},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5389310717582703},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.515002965927124},{"id":"https://openalex.org/keywords/consistent-hashing","display_name":"Consistent hashing","score":0.48006996512413025},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47061091661453247},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4417165219783783},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4282609522342682},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36755043268203735},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3503645062446594},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.34981489181518555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18575987219810486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11309877038002014},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.07833519577980042}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7882067561149597},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.7592841386795044},{"id":"https://openalex.org/C2780224649","wikidata":"https://www.wikidata.org/wiki/Q863506","display_name":"Distributed hash table","level":3,"score":0.7489340901374817},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.7173165082931519},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6420755386352539},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5971615314483643},{"id":"https://openalex.org/C534932454","wikidata":"https://www.wikidata.org/wiki/Q161410","display_name":"Peer-to-peer","level":2,"score":0.5787718296051025},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5389310717582703},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.515002965927124},{"id":"https://openalex.org/C56856351","wikidata":"https://www.wikidata.org/wiki/Q1757218","display_name":"Consistent hashing","level":5,"score":0.48006996512413025},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47061091661453247},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4417165219783783},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4282609522342682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36755043268203735},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3503645062446594},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.34981489181518555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18575987219810486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11309877038002014},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.07833519577980042},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007912.1007919","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1523214132","https://openalex.org/W1528545897","https://openalex.org/W1535873424","https://openalex.org/W1566777210","https://openalex.org/W1701068577","https://openalex.org/W1970564778","https://openalex.org/W1981535405","https://openalex.org/W2020765652","https://openalex.org/W2063844956","https://openalex.org/W2086604416","https://openalex.org/W2099844038","https://openalex.org/W2104210894","https://openalex.org/W2108386843","https://openalex.org/W2112990205","https://openalex.org/W2119245106","https://openalex.org/W2153752068","https://openalex.org/W2158049821","https://openalex.org/W2163059190","https://openalex.org/W2165840727","https://openalex.org/W2167898414","https://openalex.org/W2168886131","https://openalex.org/W2295289557","https://openalex.org/W2484653057","https://openalex.org/W3162105941","https://openalex.org/W4236944670","https://openalex.org/W6696924551"],"related_works":["https://openalex.org/W2356769024","https://openalex.org/W2383817659","https://openalex.org/W2382217896","https://openalex.org/W2113399775","https://openalex.org/W2565414638","https://openalex.org/W2359900089","https://openalex.org/W2141390590","https://openalex.org/W2358163560","https://openalex.org/W2072510243","https://openalex.org/W2354997133"],"abstract_inverted_index":{"Load":[0],"balancing":[1],"is":[2,58,172],"a":[3,25,74,83,114,188,218],"critical":[4],"issue":[5],"for":[6,68,152,222],"the":[7,33,40,62,97,103,106,118,124,132,156,164,169,175,180,209],"efficient":[8],"operation":[9],"of":[10,28,61,105,155,166,177,217],"peer-to-peer":[11,75],"networks.":[12],"We":[13,186],"give":[14,187,213],"two":[15,154],"new":[16],"load-balancing":[17],"protocols":[18,31],"whose":[19],"provable":[20],"performance":[21],"guarantees":[22],"are":[23,80,202],"within":[24],"constant":[26],"factor":[27],"optimal.":[29],"Our":[30],"refine":[32],"consistent":[34],"hashing":[35,57],"data":[36,54,220],"structure":[37,221],"that":[38,191],"underlies":[39],"Chord":[41],"(and":[42],"Koorde)":[43],"P2P":[44,134],"network.":[45],"Both":[46],"preserve":[47],"Chord's":[48],"logarithmic":[49],"query":[50],"time":[51],"and":[52,78,87,145],"near-optimal":[53],"migration":[55],"cost.Consistent":[56],"an":[59,205,214],"instance":[60],"distributed":[63,219],"hash":[64],"table":[65],"(DHT)":[66],"paradigm":[67],"assigning":[69],"items":[70,77,93,121,167,178],"to":[71,82,90,110,161,197,212],"nodes":[72,79,88,196],"in":[73,96,179],"system:":[76],"mapped":[81],"common":[84],"address":[85,98,108,125,181],"space,":[86],"have":[89],"store":[91],"all":[92],"residing":[94],"closeby":[95],"space.Our":[99],"first":[100,133],"protocol":[101,159,190,211],"balances":[102,192],"distribution":[104,165,176],"key":[107],"space":[109,182],"nodes,":[111],"which":[112],"yields":[113,131],"load-balanced":[115],"system":[116],"when":[117,174],"DHT":[119],"maps":[120],"\"randomly\"":[122],"into":[123],"space.":[126],"To":[127],"our":[128],"knowledge,":[129],"this":[130],"scheme":[135],"simultaneously":[136],"achieving":[137],"O(log":[138,141],"n)":[139,142],"degree,":[140],"look-up":[143],"cost,":[144],"constant-factor":[146],"load":[147,193],"balance":[148,163],"(previous":[149],"schemes":[150],"settled":[151],"any":[153],"three).Our":[157],"second":[158],"aims":[160],"directly":[162],"among":[168],"nodes.":[170],"This":[171],"useful":[173],"cannot":[183],"be":[184],"randomized.":[185],"simple":[189],"by":[194],"moving":[195],"arbitrary":[198],"locations":[199],"\"where":[200],"they":[201],"needed.\"":[203],"As":[204],"application,":[206],"we":[207],"use":[208],"last":[210],"optimal":[215],"implementation":[216],"range":[223],"searches":[224],"on":[225],"ordered":[226],"data.":[227]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":23}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}