{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:16:30Z","timestamp":1649013390854},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8-10","license":[{"start":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T00:00:00Z","timestamp":1342137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00607-012-0199-7","type":"journal-article","created":{"date-parts":[[2012,7,12]],"date-time":"2012-07-12T01:24:34Z","timestamp":1342056274000},"page":"731-762","source":"Crossref","is-referenced-by-count":0,"title":["A novel robust on-line protocol for load-balancing in structured peer-to-peer systems"],"prefix":"10.1007","volume":"94","author":[{"given":"George","family":"Tsatsanifos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Samoladas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,13]]},"reference":[{"key":"199_CR1","unstructured":"The dblp data-set. http:\/\/dblp.uni-trier.de\/xml"},{"key":"199_CR2","unstructured":"The r-tree portal. http:\/\/www.rtreeportal.org"},{"key":"199_CR3","unstructured":"W3c rdfs rules of entailment. http:\/\/www.w3.org\/TR\/rdf-mt\/#rules"},{"key":"199_CR4","doi-asserted-by":"crossref","unstructured":"Aberer K (2001) P-grid: a self-organizing access structure for p2p information systems. In: CoopIS, pp 179\u2013194","DOI":"10.1007\/3-540-44751-2_15"},{"key":"199_CR5","unstructured":"Aberer K (2002) Scalable data access in peer-to-peer systems using unbalanced search trees. In: WDAS, pp 107\u2013120"},{"key":"199_CR6","doi-asserted-by":"crossref","unstructured":"Aberer K, Datta A, Hauswirth M (2004) Efficient, self-contained handling of identity in peer-to-peer systems. IEEE TKDE, 16","DOI":"10.1109\/TKDE.2004.1318567"},{"key":"199_CR7","doi-asserted-by":"crossref","unstructured":"Aberer K, Datta A, Hauswirth M (2005) Multifaceted simultaneous load balancing in DHT-based p2p systems: a new game with old balls and bins. In: Babaoglu \u00d6, Jelasity M, Montresor A, Fetzer C, Leonardi S, van Moorsel APA, van Steen M (eds) Self-star properties in complex information systems, pp 373\u2013391","DOI":"10.1007\/11428589_24"},{"key":"199_CR8","doi-asserted-by":"crossref","unstructured":"Aberer K, Datta A, Hauswirth M (2005) P-grid: dynamics of self-organizing processes in structured peer-to-peer systems. In: Steinmetz R, Wehrle K (eds) Peer-to-peer systems and applications, pp 137\u2013153","DOI":"10.1007\/11530657_10"},{"key":"199_CR9","doi-asserted-by":"crossref","unstructured":"Aspnes J, Kirsch J, Krishnamurthy A (2004) Load balancing and locality in range-queriable data structures. In: PODC, pp 115\u2013124","DOI":"10.1145\/1011767.1011785"},{"issue":"3","key":"199_CR10","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","author":"A Avidor","year":"2001","unstructured":"Avidor A, Azar Y, Sgall J (2001) Ancient and new algorithms for load balancing in the lp norm. Algorithmica 29(3): 422\u2013441","journal-title":"Algorithmica"},{"issue":"1","key":"199_CR11","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y Azar","year":"1994","unstructured":"Azar Y, Broder AZ, Karlin AR, Upfal E (1994) Balanced allocations. SIAM J Comp 29(1): 180\u2013200","journal-title":"SIAM J Comp"},{"key":"199_CR12","doi-asserted-by":"crossref","unstructured":"Bharambe AR, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp 353\u2013366","DOI":"10.1145\/1030194.1015507"},{"key":"199_CR13","doi-asserted-by":"crossref","unstructured":"Bienkowski M, Korzeniowski M, auf der Heide FM (2005) Dynamic load balancing in distributed hash tables. In: IPTPS, pp 217\u2013225","DOI":"10.1007\/11558989_20"},{"issue":"1","key":"199_CR14","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.future.2008.04.003","volume":"25","author":"S Blanas","year":"2009","unstructured":"Blanas S, Samoladas V (2009) Contention-based performance evaluation of multidimensional range search in peer-to-peer networks. Future Gener Comp Syst 25(1): 100\u2013108","journal-title":"Future Gener Comp Syst"},{"key":"199_CR15","doi-asserted-by":"crossref","unstructured":"Byers JW, Considine J, Mitzenmacher M (2003) Simple load balancing for distributed hash tables. In: IPTPS, pp 80\u201387","DOI":"10.1007\/978-3-540-45172-3_7"},{"issue":"1","key":"199_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10723-004-1184-y","volume":"2","author":"M Cai","year":"2004","unstructured":"Cai M, Frank MR, Chen J, Szekely PA (2004) Maan: a multi-attribute addressable network for grid information services. J Grid Comp 2(1): 3\u201314","journal-title":"J Grid Comp"},{"key":"199_CR17","doi-asserted-by":"crossref","unstructured":"Datta A, Hauswirth M, John R, Schmidt R, Aberer K (2005) Range queries in trie-structured overlays. In: P2P computing, pp 57\u201366","DOI":"10.1109\/P2P.2005.31"},{"key":"199_CR18","unstructured":"Datta A, Nejdl W, Aberer K (2006) Optimal caching for first-order query load-balancing in decentralized index structures. In: DBISP2P, pp 331\u2013342"},{"key":"199_CR19","doi-asserted-by":"crossref","unstructured":"Datta A, Schmidt R, Aberer K (2007) Query-load balancing in structured overlays. In: CCGRID, pp 453\u2013460","DOI":"10.1109\/CCGRID.2007.90"},{"key":"199_CR20","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, pp 444\u2013455","DOI":"10.1016\/B978-012088469-8.50041-3"},{"key":"199_CR21","doi-asserted-by":"crossref","unstructured":"Ganesan P, Yang B, Garcia-Molina H (2004) One torus to rule them all: Multidimensional queries in p2p systems. In: WebDB, pp 19\u201324","DOI":"10.1145\/1017074.1017081"},{"key":"199_CR22","unstructured":"Godfrey B, Lakshminarayanan K, Surana S, Karp RM, Stoica I (2004) Load balancing in dynamic structured p2p systems. In: INFOCOM"},{"key":"199_CR23","unstructured":"Godfrey PB (2008) Balls and bins with structure: balanced allocations on hypergraphs. In: SODA \u201908, pp 511\u2013517"},{"key":"199_CR24","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan V, Silaghi BD, Bhattacharjee B, Keleher PJ (2004) Adaptive replication in peer-to-peer systems. In: ICDCS, pp 360\u2013369","DOI":"10.1109\/ICDCS.2004.1281601"},{"issue":"2","key":"199_CR25","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2): 416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"199_CR26","unstructured":"Jagadish HV, Ooi BC, Vu QH (2005) Baton: a balanced tree structure for peer-to-peer networks. In: VLDB, pp 661\u2013672"},{"key":"199_CR27","doi-asserted-by":"crossref","unstructured":"Jagadish HV, Ooi BC, Vu QH, Zhang R, Zhou A (2006) Vbi-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: ICDE, p 34","DOI":"10.1109\/ICDE.2006.169"},{"key":"199_CR28","unstructured":"Jain R, Chiu D, Hawe W (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. In: DEC research report TR-301"},{"key":"199_CR29","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: ACM symposium on theory of computers, pp 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"199_CR30","doi-asserted-by":"crossref","unstructured":"Karger DR (2004) Simple efficient load balancing algorithms for peer-to-peer systems. In: ACM SPAA, pp 36\u201343","DOI":"10.1145\/1007912.1007919"},{"key":"199_CR31","doi-asserted-by":"crossref","unstructured":"Kenthapadi K, Panigrahy R (2006) Balanced allocation on graphs. In: SODA \u201906, pp 434\u2013443","DOI":"10.1145\/1109557.1109606"},{"issue":"8","key":"199_CR32","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1109\/TPDS.2010.200","volume":"22","author":"I Konstantinou","year":"2011","unstructured":"Konstantinou I, Tsoumakos D, Koziris N (2011) Fast and cost-effective online load-balancing in distributed range-queriable systems. IEEE Trans Parallel Distrib Syst 22(8): 1350\u20131364","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"199_CR33","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, pp 53\u201365","DOI":"10.1007\/3-540-45748-8_5"},{"issue":"10","key":"199_CR34","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans Parallel Distrib Syst 12(10): 1094\u20131104","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"199_CR35","doi-asserted-by":"crossref","unstructured":"Mondal A, Goda K, Kitsuregawa M (2003) Effective load-balancing via migration and replication in spatial grids. In: DEXA, pp 202\u2013211","DOI":"10.1007\/978-3-540-45227-0_21"},{"key":"199_CR36","doi-asserted-by":"crossref","unstructured":"Pitoura T, Ntarmos N, Triantafillou P (2006) Replication, load balancing and efficient range query processing in dhts. In: EDBT, pp 131\u2013148","DOI":"10.1007\/11687238_11"},{"key":"199_CR37","doi-asserted-by":"crossref","unstructured":"Raab M, Steger A (1998) Balls into bin\u2014a simple and tight analysis. In: RANDOM, pp 159\u2013170","DOI":"10.1007\/3-540-49543-6_13"},{"key":"199_CR38","doi-asserted-by":"crossref","unstructured":"Ramabhadran S, Ratnasamy S, Hellerstein JM, Shenker S (2004) Brief announcement: prefix hash tree. In: PODC, p 368","DOI":"10.1145\/1011767.1011823"},{"key":"199_CR39","doi-asserted-by":"crossref","unstructured":"Rao A, Lakshminarayanan K, Surana S, Karp RM, Stoica I (2003) Load balancing in structured p2p systems. In: IPTPS, pp 68\u201379","DOI":"10.1007\/978-3-540-45172-3_6"},{"key":"199_CR40","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: SIGCOMM \u201901, pp 161\u2013172","DOI":"10.1145\/383059.383072"},{"key":"199_CR41","unstructured":"Rowstron AIT, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware, pp 329\u2013350"},{"issue":"1","key":"199_CR42","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, Liben-Nowell D, Karger D, Kaashoek F, Dabek F, Balakrishnan H (2003) Chord a scalable p2p lookup protocol for internet applications. IEEE\/ACM Trans Netw 11(1): 17\u201332","journal-title":"IEEE\/ACM Trans Netw"},{"key":"199_CR43","doi-asserted-by":"crossref","unstructured":"Tsatsanifos G, Sacharidis D, Sellis TK (2011) Midas: multi-attribute indexing for distributed architecture systems. In: SSTD, pp 168\u2013185","DOI":"10.1007\/978-3-642-22922-0_11"},{"key":"199_CR44","doi-asserted-by":"crossref","unstructured":"Tsatsanifos G, Sacharidis D, Sellis TK (2011) On enhancing scalability for distributed rdf\/s stores. In: EDBT, pp 141\u2013152","DOI":"10.1145\/1951365.1951384"},{"issue":"4","key":"199_CR45","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TNET.2007.893881","volume":"15","author":"X Wang","year":"2007","unstructured":"Wang X, Loguinov D (2007) Load-balancing performance of consistent hashing: asymptotic analysis of random node join. IEEE\/ACM Trans Netw 15(4): 892\u2013905","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"199_CR46","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1021519509203","volume":"13","author":"K-L Wu","year":"2003","unstructured":"Wu K-L, Yu PS (2003) Replication for load balancing and hot-spot relief on proxy web caches with hash routing. Distrib Parallel Databases 13(2): 203\u2013220","journal-title":"Distrib Parallel Databases"},{"issue":"1","key":"199_CR47","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B Zhao","year":"2004","unstructured":"Zhao B, Kubiatowicz J, Joseph AD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE J Sel Areas Comm 22(1): 41\u201353","journal-title":"IEEE J Sel Areas Comm"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0199-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-012-0199-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-012-0199-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T17:13:52Z","timestamp":1561914832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-012-0199-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,13]]},"references-count":47,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["199"],"URL":"https:\/\/doi.org\/10.1007\/s00607-012-0199-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,13]]}}}