{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:16:52Z","timestamp":1649024212823},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s11227-007-0126-4","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T23:22:49Z","timestamp":1175210569000},"page":"183-198","source":"Crossref","is-referenced-by-count":6,"title":["Insight into redundancy schemes in DHTs"],"prefix":"10.1007","volume":"43","author":[{"given":"Guihai","family":"Chen","sequence":"first","affiliation":[]},{"given":"Tongqing","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"126_CR1","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) a scalabe content addressable network. In: Proc of ACM SIGCOMM, 2001, pp 161\u2013172"},{"key":"126_CR2","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, 2001, pp 149\u2013160","DOI":"10.1145\/383059.383071"},{"key":"126_CR3","unstructured":"Rowstron A, Druschel P (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer system. In: Proc of Middleware, 2001, pp 329\u2013350"},{"issue":"1","key":"126_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B Zhao","year":"2004","unstructured":"Zhao B, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD (2004) Tapestry: a resilient global-scale overlay for service deployment. IEEE Trans Select Areas Commun 22(1):41\u201353","journal-title":"IEEE Trans Select Areas Commun"},{"key":"126_CR5","doi-asserted-by":"crossref","unstructured":"Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the buttterfly. In: Proc of Principles of Distributed Computing, 2002, pp 183\u2013192","DOI":"10.1145\/571825.571857"},{"key":"126_CR6","unstructured":"Shen H, Xu CZ, Ghen G (2004) Cycloid a constant-degree and lookup-efficient P2P overlay network. In: Proc of IPDPS, 2004, pp 26\u201330"},{"key":"126_CR7","doi-asserted-by":"crossref","unstructured":"Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I (2001) Wide-area cooperative storage with CFS. In: Proc of ACM SOSP, 2001, pp 202\u2013215","DOI":"10.1145\/502034.502054"},{"key":"126_CR8","unstructured":"Dabek F, Li J, Sit E, Robertson J, Kaashoek F, Morris R (2004) Designing a DHT for low latency and high throughput. In: Proc of NSDI, 2004, pp 85\u201398"},{"key":"126_CR9","doi-asserted-by":"crossref","unstructured":"Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, Eaton P, Geels D, Gummadi R, Rhea S, Weatherspoon H, Weimer W, Wells C, Zhao B (2000) Oceanstore: an architecture for global-scale persistent storage. In: Proc of ASPLOS, 2000, pp 190\u2013201","DOI":"10.1145\/378993.379239"},{"key":"126_CR10","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc of SOSP, 2001, pp 188\u2013201","DOI":"10.1145\/502034.502053"},{"key":"126_CR11","unstructured":"Bhagwan R, Tati K, Cheng Y, Savage S, Voelker G (2004) Total recall: system support for automated avalability management. In: Proc of NSDI, 2004, pp 337\u2013350"},{"key":"126_CR12","doi-asserted-by":"crossref","unstructured":"Weatherspoon H, Kubiatowicz J (2002) Erasure coding vs. replication: a quantitative comparison. In: Proc of IPTPS, 2002, pp 328\u2013338","DOI":"10.1007\/3-540-45748-8_31"},{"key":"126_CR13","unstructured":"Blake C, Rodrigues R (2003) High availability, scalable storage, dynamic peer networks: pick two. In: Proc of HotOS-IX, 2003, pp 1\u20136"},{"key":"126_CR14","doi-asserted-by":"crossref","unstructured":"Rodrigues R, Liskow B (2005) High availability in DHTs: erasure coding vs. replication. In: Proc of IPTPS, 2005, pp 226\u2013239","DOI":"10.1007\/11558989_21"},{"key":"126_CR15","doi-asserted-by":"crossref","unstructured":"Bolosky WJ, Douceur JR, Ely D, Theimer M (2000) Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: Proc of SIGMETRICS, 2000, pp 34\u201343","DOI":"10.1145\/339331.339345"},{"key":"126_CR16","doi-asserted-by":"crossref","unstructured":"Patterson D, Gibson G, Katz R (1988) The case of raid Redundant arrays of inexpensive disks. In: Proc of SIGMOD, 1988, pp 109\u2013116","DOI":"10.1145\/50202.50214"},{"key":"126_CR17","first-page":"300","volume":"8","author":"S Reed","year":"1960","unstructured":"Reed S, Solomon G (1960) Polynomial codes over certain finite fields. J SIAM 8:300\u2013304","journal-title":"J SIAM"},{"key":"126_CR18","unstructured":"Ranganathan K, Iamnitchi A, Foster I (2002) Improving data availability through dynamic model-driven replicatiion in large peer-to-peer communities. In: Proc of CCGRID, 2002, p 376"},{"key":"126_CR19","unstructured":"Cuenca-Acuna FM, Martin RP, Nguyen TD (2003) Autonomous replication for high availability in unstructured P2P systems. In: Proc of SRDS, 2003, pp 99\u2013108"},{"key":"126_CR20","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton F, Levine M, Lewin D, Panigrahy R (1997) Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on world wide web. In: Proc of STC, 1997, pp 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"126_CR21","unstructured":"Bhagwan R, Savage S, Voelker G (2002) Replication strategies for highly available peer-to-peer storage systems. UCSD Technical Report CS2002-0726"},{"key":"126_CR22","doi-asserted-by":"crossref","unstructured":"Byers JW, Luby M, Mitzenmacher M, Rege A (1998) a digital fountain approach to reliable distribtuion of bulk data. In: Proc of SIGCOMM, 1998, pp 56\u201367","DOI":"10.1145\/285237.285258"},{"key":"126_CR23","unstructured":"Gil T, Kaashoek F, Li J, Morris R, Stribling J p2psim: a simulator for peer-to-peer protocols. http:\/\/www.pdos.lcs.mit.edu\/p2psim\/"},{"key":"126_CR24","doi-asserted-by":"crossref","unstructured":"Breslau L, Cao P, Fan L, Phillips G, Schenker S (1999) Web-caching and zipf-like distribution: evidence and implications. In: Proc of INFOCOM, 1999, pp 126\u2013134","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"126_CR25","doi-asserted-by":"crossref","unstructured":"Merzbacher M, Patterson D (2002) Measuring end-user availability on the web: practical experience. In: Proc of IPDS, 2002, pp 473\u2013477","DOI":"10.1109\/DSN.2002.1028932"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0126-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0126-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0126-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:55Z","timestamp":1559384635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-007-0126-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["126"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0126-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}