Topology Sensitive Replica Selection
As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of "peer" systems rather than on dedicated high performance storage systems can provide comparable reliability and availability guarantees but at reduced cost and complexity. I...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 28 |
---|---|
container_issue | |
container_start_page | 18 |
container_title | |
container_volume | |
creator | Brodsky, D. Feeley, M.J. Hutchinson, N.C. |
description | As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of "peer" systems rather than on dedicated high performance storage systems can provide comparable reliability and availability guarantees but at reduced cost and complexity. In order to be adopted, peer-to-peer storage systems must be able to replicate data on hosts that are trusted, secure, and available. However, recent research has shown that the traditional model, where nodes are assumed to have identical levels of trust, to behave independently, and to have similar failure modes, is over simplified. Thus, there is a need for a mechanism that automatically and efficiently selects replica nodes from a large number of available hosts with varying capabilities and trust levels. In this paper we present an algorithm to handle replica node selection either for new replica groups or to replace failed replicas in a peer-to-peer storage system. We show through simulation that our algorithm maintains the node inter-connection topology minimizing the cost of recovery from a failed replica, measured by the number of nodes affected by the failure and the number of inter-node messages |
doi_str_mv | 10.1109/SRDS.2006.46 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4032465</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4032465</ieee_id><sourcerecordid>4032465</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-daa3b24a6df9af76fd0fc6d6fc1e09edf65e33c1517cad770eb5eff4f5a551bc3</originalsourceid><addsrcrecordid>eNotzEtLw0AUQOHBBxhqdu7cdOE28c7j3skspVoVCkJT12Uyc0dGYhOaIPTfK-jqwLc4QtxIqKUEd99uH9taAVBt6EwUCi1WjSF1LkpnG7DkUJG1eCEKCQSVa9BeiXKaPgFAOrJGykLc7YZx6IeP07Llw5Tn_M3LLY99Dv5Xeg5zHg7X4jL5fuLyvwvxvn7arV6qzdvz6-phU2Vpca6i97pTxlNMzidLKUIKFCkFyeA4JkLWOkiUNvhoLXCHnJJJ6BFlF_RC3P59MzPvx2P-8sfT3oBWhlD_ABAJQqY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Topology Sensitive Replica Selection</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Brodsky, D. ; Feeley, M.J. ; Hutchinson, N.C.</creator><creatorcontrib>Brodsky, D. ; Feeley, M.J. ; Hutchinson, N.C.</creatorcontrib><description>As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of "peer" systems rather than on dedicated high performance storage systems can provide comparable reliability and availability guarantees but at reduced cost and complexity. In order to be adopted, peer-to-peer storage systems must be able to replicate data on hosts that are trusted, secure, and available. However, recent research has shown that the traditional model, where nodes are assumed to have identical levels of trust, to behave independently, and to have similar failure modes, is over simplified. Thus, there is a need for a mechanism that automatically and efficiently selects replica nodes from a large number of available hosts with varying capabilities and trust levels. In this paper we present an algorithm to handle replica node selection either for new replica groups or to replace failed replicas in a peer-to-peer storage system. We show through simulation that our algorithm maintains the node inter-connection topology minimizing the cost of recovery from a failed replica, measured by the number of nodes affected by the failure and the number of inter-node messages</description><identifier>ISSN: 1060-9857</identifier><identifier>ISBN: 9780769526775</identifier><identifier>ISBN: 0769526772</identifier><identifier>EISSN: 2575-8462</identifier><identifier>DOI: 10.1109/SRDS.2006.46</identifier><language>eng</language><publisher>IEEE</publisher><subject>Availability ; Bandwidth ; Computer science ; Costs ; Microcomputers ; Peer to peer computing ; Protection ; Safety ; Secure storage ; Topology</subject><ispartof>2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06), 2006, p.18-28</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4032465$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4032465$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Brodsky, D.</creatorcontrib><creatorcontrib>Feeley, M.J.</creatorcontrib><creatorcontrib>Hutchinson, N.C.</creatorcontrib><title>Topology Sensitive Replica Selection</title><title>2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)</title><addtitle>SRDS</addtitle><description>As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of "peer" systems rather than on dedicated high performance storage systems can provide comparable reliability and availability guarantees but at reduced cost and complexity. In order to be adopted, peer-to-peer storage systems must be able to replicate data on hosts that are trusted, secure, and available. However, recent research has shown that the traditional model, where nodes are assumed to have identical levels of trust, to behave independently, and to have similar failure modes, is over simplified. Thus, there is a need for a mechanism that automatically and efficiently selects replica nodes from a large number of available hosts with varying capabilities and trust levels. In this paper we present an algorithm to handle replica node selection either for new replica groups or to replace failed replicas in a peer-to-peer storage system. We show through simulation that our algorithm maintains the node inter-connection topology minimizing the cost of recovery from a failed replica, measured by the number of nodes affected by the failure and the number of inter-node messages</description><subject>Availability</subject><subject>Bandwidth</subject><subject>Computer science</subject><subject>Costs</subject><subject>Microcomputers</subject><subject>Peer to peer computing</subject><subject>Protection</subject><subject>Safety</subject><subject>Secure storage</subject><subject>Topology</subject><issn>1060-9857</issn><issn>2575-8462</issn><isbn>9780769526775</isbn><isbn>0769526772</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotzEtLw0AUQOHBBxhqdu7cdOE28c7j3skspVoVCkJT12Uyc0dGYhOaIPTfK-jqwLc4QtxIqKUEd99uH9taAVBt6EwUCi1WjSF1LkpnG7DkUJG1eCEKCQSVa9BeiXKaPgFAOrJGykLc7YZx6IeP07Llw5Tn_M3LLY99Dv5Xeg5zHg7X4jL5fuLyvwvxvn7arV6qzdvz6-phU2Vpca6i97pTxlNMzidLKUIKFCkFyeA4JkLWOkiUNvhoLXCHnJJJ6BFlF_RC3P59MzPvx2P-8sfT3oBWhlD_ABAJQqY</recordid><startdate>200610</startdate><enddate>200610</enddate><creator>Brodsky, D.</creator><creator>Feeley, M.J.</creator><creator>Hutchinson, N.C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200610</creationdate><title>Topology Sensitive Replica Selection</title><author>Brodsky, D. ; Feeley, M.J. ; Hutchinson, N.C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-daa3b24a6df9af76fd0fc6d6fc1e09edf65e33c1517cad770eb5eff4f5a551bc3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Availability</topic><topic>Bandwidth</topic><topic>Computer science</topic><topic>Costs</topic><topic>Microcomputers</topic><topic>Peer to peer computing</topic><topic>Protection</topic><topic>Safety</topic><topic>Secure storage</topic><topic>Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Brodsky, D.</creatorcontrib><creatorcontrib>Feeley, M.J.</creatorcontrib><creatorcontrib>Hutchinson, N.C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Brodsky, D.</au><au>Feeley, M.J.</au><au>Hutchinson, N.C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Topology Sensitive Replica Selection</atitle><btitle>2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)</btitle><stitle>SRDS</stitle><date>2006-10</date><risdate>2006</risdate><spage>18</spage><epage>28</epage><pages>18-28</pages><issn>1060-9857</issn><eissn>2575-8462</eissn><isbn>9780769526775</isbn><isbn>0769526772</isbn><abstract>As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of "peer" systems rather than on dedicated high performance storage systems can provide comparable reliability and availability guarantees but at reduced cost and complexity. In order to be adopted, peer-to-peer storage systems must be able to replicate data on hosts that are trusted, secure, and available. However, recent research has shown that the traditional model, where nodes are assumed to have identical levels of trust, to behave independently, and to have similar failure modes, is over simplified. Thus, there is a need for a mechanism that automatically and efficiently selects replica nodes from a large number of available hosts with varying capabilities and trust levels. In this paper we present an algorithm to handle replica node selection either for new replica groups or to replace failed replicas in a peer-to-peer storage system. We show through simulation that our algorithm maintains the node inter-connection topology minimizing the cost of recovery from a failed replica, measured by the number of nodes affected by the failure and the number of inter-node messages</abstract><pub>IEEE</pub><doi>10.1109/SRDS.2006.46</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1060-9857 |
ispartof | 2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06), 2006, p.18-28 |
issn | 1060-9857 2575-8462 |
language | eng |
recordid | cdi_ieee_primary_4032465 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Availability Bandwidth Computer science Costs Microcomputers Peer to peer computing Protection Safety Secure storage Topology |
title | Topology Sensitive Replica Selection |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T11%3A04%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Topology%20Sensitive%20Replica%20Selection&rft.btitle=2006%2025th%20IEEE%20Symposium%20on%20Reliable%20Distributed%20Systems%20(SRDS'06)&rft.au=Brodsky,%20D.&rft.date=2006-10&rft.spage=18&rft.epage=28&rft.pages=18-28&rft.issn=1060-9857&rft.eissn=2575-8462&rft.isbn=9780769526775&rft.isbn_list=0769526772&rft_id=info:doi/10.1109/SRDS.2006.46&rft_dat=%3Cieee_6IE%3E4032465%3C/ieee_6IE%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_ieee_id=4032465&rfr_iscdi=true |