Computer Science Department, Peking University, Beijing 100871, China
Due to the prevalence of peer departures, P2P storage systems need to constantly generate replicas for high durability. However, few existing systems are able to select the right replication rate that balances replication cost and durability, e.g., minimizing replication cost without threatening the...
Gespeichert in:
| Veröffentlicht in: | 中国科学：信息科学（英文版） 2011, Vol.54 (6), p.1151-1160 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1160 |
|---|---|
| container_issue | 6 |
| container_start_page | 1151 |
| container_title | 中国科学：信息科学（英文版） |
| container_volume | 54 |
| creator | YANG Zhi ＆ DAI YaFei |
| description | Due to the prevalence of peer departures, P2P storage systems need to constantly generate replicas for high durability. However, few existing systems are able to select the right replication rate that balances replication cost and durability, e.g., minimizing replication cost without threatening the durability target. In this paper, we propose a method called AutoProc to automate the replication process in P2P storage systems. AutoProc employs two key techniques to enable cost-effective replication： correctly adapting replication rate with a reliability model, and replicating objects at the right order with a reliability indicator. Extensive simulations based on the real system failure trace show that AutoProc achieves the near-optimal performance. |
| format | Article |
| fullrecord | <record><control><sourceid>chongqing</sourceid><recordid>TN_cdi_chongqing_primary_37881980</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>37881980</cqvip_id><sourcerecordid>37881980</sourcerecordid><originalsourceid>FETCH-chongqing_primary_378819803</originalsourceid><addsrcrecordid>eNqNitEKgjAYRkcUJOU7rHuFrYXbbltGl0EF3cmQP53ltG0Fvn0GPUDn5jt8nAmKqMhkSiWV09Ezvkk5Y9c5ir1vyAhjZM1FhHLVtf0rgMOn0oAtAe-g1y60YEOCj3A3tsIXa97gvAlDgrdgmu9HCRGcJljVxuolmt30w0P82wVa7fOzOqRl3dnqOfZF70yr3VAwLgSVgrB_mg9dFDn6</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Computer Science Department, Peking University, Beijing 100871, China</title><source>Alma/SFX Local Collection</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>YANG Zhi ＆ DAI YaFei</creator><creatorcontrib>YANG Zhi ＆ DAI YaFei</creatorcontrib><description>Due to the prevalence of peer departures, P2P storage systems need to constantly generate replicas for high durability. However, few existing systems are able to select the right replication rate that balances replication cost and durability, e.g., minimizing replication cost without threatening the durability target. In this paper, we propose a method called AutoProc to automate the replication process in P2P storage systems. AutoProc employs two key techniques to enable cost-effective replication： correctly adapting replication rate with a reliability model, and replicating objects at the right order with a reliability indicator. Extensive simulations based on the real system failure trace show that AutoProc achieves the near-optimal performance.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><language>eng</language><subject>中国 ; 北京大学 ; 可靠性模型 ; 复制对象 ; 存储系统 ; 成本效益 ; 计算机科学系 ; 高耐久性</subject><ispartof>中国科学：信息科学（英文版）, 2011, Vol.54 (6), p.1151-1160</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><link.rule.ids>314,776,780,4010</link.rule.ids></links><search><creatorcontrib>YANG Zhi ＆ DAI YaFei</creatorcontrib><title>Computer Science Department, Peking University, Beijing 100871, China</title><title>中国科学：信息科学（英文版）</title><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>Due to the prevalence of peer departures, P2P storage systems need to constantly generate replicas for high durability. However, few existing systems are able to select the right replication rate that balances replication cost and durability, e.g., minimizing replication cost without threatening the durability target. In this paper, we propose a method called AutoProc to automate the replication process in P2P storage systems. AutoProc employs two key techniques to enable cost-effective replication： correctly adapting replication rate with a reliability model, and replicating objects at the right order with a reliability indicator. Extensive simulations based on the real system failure trace show that AutoProc achieves the near-optimal performance.</description><subject>中国</subject><subject>北京大学</subject><subject>可靠性模型</subject><subject>复制对象</subject><subject>存储系统</subject><subject>成本效益</subject><subject>计算机科学系</subject><subject>高耐久性</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNqNitEKgjAYRkcUJOU7rHuFrYXbbltGl0EF3cmQP53ltG0Fvn0GPUDn5jt8nAmKqMhkSiWV09Ezvkk5Y9c5ir1vyAhjZM1FhHLVtf0rgMOn0oAtAe-g1y60YEOCj3A3tsIXa97gvAlDgrdgmu9HCRGcJljVxuolmt30w0P82wVa7fOzOqRl3dnqOfZF70yr3VAwLgSVgrB_mg9dFDn6</recordid><startdate>2011</startdate><enddate>2011</enddate><creator>YANG Zhi ＆ DAI YaFei</creator><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope></search><sort><creationdate>2011</creationdate><title>Computer Science Department, Peking University, Beijing 100871, China</title><author>YANG Zhi ＆ DAI YaFei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-chongqing_primary_378819803</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>中国</topic><topic>北京大学</topic><topic>可靠性模型</topic><topic>复制对象</topic><topic>存储系统</topic><topic>成本效益</topic><topic>计算机科学系</topic><topic>高耐久性</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>YANG Zhi ＆ DAI YaFei</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><jtitle>中国科学：信息科学（英文版）</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YANG Zhi ＆ DAI YaFei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computer Science Department, Peking University, Beijing 100871, China</atitle><jtitle>中国科学：信息科学（英文版）</jtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2011</date><risdate>2011</risdate><volume>54</volume><issue>6</issue><spage>1151</spage><epage>1160</epage><pages>1151-1160</pages><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>Due to the prevalence of peer departures, P2P storage systems need to constantly generate replicas for high durability. However, few existing systems are able to select the right replication rate that balances replication cost and durability, e.g., minimizing replication cost without threatening the durability target. In this paper, we propose a method called AutoProc to automate the replication process in P2P storage systems. AutoProc employs two key techniques to enable cost-effective replication： correctly adapting replication rate with a reliability model, and replicating objects at the right order with a reliability indicator. Extensive simulations based on the real system failure trace show that AutoProc achieves the near-optimal performance.</abstract></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1674-733X |
| ispartof | 中国科学：信息科学（英文版）, 2011, Vol.54 (6), p.1151-1160 |
| issn | 1674-733X 1869-1919 |
| language | eng |
| recordid | cdi_chongqing_primary_37881980 |
| source | Alma/SFX Local Collection; SpringerLink Journals - AutoHoldings; ProQuest Central |
| subjects | 中国 北京大学 可靠性模型 复制对象 存储系统 成本效益 计算机科学系 高耐久性 |
| title | Computer Science Department, Peking University, Beijing 100871, China |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T22%3A32%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-chongqing&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computer%20Science%20Department,%20Peking%20University,%20Beijing%20100871,%20China&rft.jtitle=%E4%B8%AD%E5%9B%BD%E7%A7%91%E5%AD%A6%EF%BC%9A%E4%BF%A1%E6%81%AF%E7%A7%91%E5%AD%A6%EF%BC%88%E8%8B%B1%E6%96%87%E7%89%88%EF%BC%89&rft.au=YANG%20Zhi%20%EF%BC%86%20DAI%20YaFei&rft.date=2011&rft.volume=54&rft.issue=6&rft.spage=1151&rft.epage=1160&rft.pages=1151-1160&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/&rft_dat=%3Cchongqing%3E37881980%3C/chongqing%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_cqvip_id=37881980&rfr_iscdi=true |