{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:54:28Z","timestamp":1791140068290,"version":"4.1.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354648","type":"proceedings-article","created":{"date-parts":[[2005,2,22]],"date-time":"2005-02-22T15:29:50Z","timestamp":1109086190000},"page":"2253-2262","source":"Crossref","is-referenced-by-count":147,"title":["Load balancing in dynamic structured P2P systems"],"prefix":"10.1109","volume":"4","author":[{"given":"B.","family":"Godfrey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K.","family":"Lakshminarayanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Surana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Karp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I.","family":"Stoica","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61332-3_133"},{"key":"16","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/BFb0029569","author":"azar","year":"1998","journal-title":"Online Algorithms - The State of the Art"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777460"},{"key":"14","first-page":"355","article-title":"Load balancing for response time","author":"westbrook","year":"1995","journal-title":"European Symposium on Algorithms"},{"key":"11","article-title":"Competitive hill-climbing strategies for replica placement in a distributed file system","author":"douceur","year":"2001","journal-title":"Proc DISCEX"},{"key":"12","article-title":"Towards high performance peer-to-peer content and resource sharing systems","author":"triantafillou","year":"2003","journal-title":"Proc CIDR"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/564875.564877"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383072"},{"key":"10","article-title":"New algorithms for load balancing in peer-to-peer systems","volume":"mit lcs tr 911","author":"karger","year":"2003","journal-title":"Tech Rep"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/502051.502054"},{"key":"6","article-title":"Simple load balancing for distributed hash tables","author":"byers","year":"2003","journal-title":"Proc IPTPS"},{"key":"5","article-title":"Load balancing in structured P2P systems","author":"rao","year":"2003","journal-title":"Proc IPTPS"},{"key":"4","article-title":"Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems","author":"rowstron","year":"2001","journal-title":"Proc Middleware"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780626"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"}],"event":{"name":"IEEE INFOCOM 2004","location":"Hong Kong, China","acronym":"INFCOM-04"},"container-title":["IEEE INFOCOM 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9369\/29753\/01354648.pdf?arnumber=1354648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T12:08:53Z","timestamp":1497614933000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354648\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354648","relation":{},"subject":[]}}