Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints

To improve the reliability of data storage systems, certain data placement schemes spread replicas corresponding to data stored on each node across several other nodes. When node failures occur, this enables parallelizing the rebuild process which in turn results in reducing the rebuild times. Howev...

Full description

Saved in:
Bibliographic Details
Main Authors: Venkatesan, V., Iliadis, I., Haas, R.
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Approximation methods
Bandwidth
Data models
Distributed databases
Redundancy
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 197
container_issue
container_start_page 189
container_title
container_volume
creator Venkatesan, V.
Iliadis, I.
Haas, R.
description To improve the reliability of data storage systems, certain data placement schemes spread replicas corresponding to data stored on each node across several other nodes. When node failures occur, this enables parallelizing the rebuild process which in turn results in reducing the rebuild times. However, the underlying assumption is that the parallel rebuild process is facilitated by sufficient availability of network bandwidth to transfer data across nodes at full speed. In a large-scale data storage system where the network bandwidth for rebuild is constrained, such placement schemes will not be as effective. In this paper, it is shown through analysis and simulation how the spread of replicas across nodes affects system reliability under a network bandwidth constraint. Efficient placement schemes that can achieve high reliability in the presence of bandwidth constraints are proposed. Furthermore, in a dynamically changing storage system, in which the number of nodes and the network rebuild bandwidth can change over time, the data placement can be accordingly adapted to maintain a high level of reliability.
doi_str_mv 10.1109/MASCOTS.2012.31
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6298179</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6298179</ieee_id><sourcerecordid>6298179</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-1c56fead786726effc19dbf71692944698c14ebb91aa278604cac092469943743</originalsourceid><addsrcrecordid>eNotjMtOwzAQRS0eEqV0zYKNfyDFM3bseFlCeUiFSE33lZNMwJAmKHZV9e-pBHdzFufoMnYLYg4g7P3bosyLTTlHATiXcMYmKE2aCERzzq5BaSNRpRIu2ARS1IlJpb1isxC-xGkmAxRywoo1dd5VvvPxyIeWP7roeBmH0X0QL48h0i7wfd_QyN8pHobxm6-p2vuu4Q-ubw6-iZ88H_oQR-f7GG7YZeu6QLN_TtnmabnJX5JV8fyaL1aJtyImUKe6JdeYTBvU1LY12KZqDWiLViltsxoUVZUF5_AUCVW7Wlg8GaukUXLK7v5uPRFtf0a_c-Nxq9FmYKz8BcjrUEA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Venkatesan, V. ; Iliadis, I. ; Haas, R.</creator><creatorcontrib>Venkatesan, V. ; Iliadis, I. ; Haas, R.</creatorcontrib><description>To improve the reliability of data storage systems, certain data placement schemes spread replicas corresponding to data stored on each node across several other nodes. When node failures occur, this enables parallelizing the rebuild process which in turn results in reducing the rebuild times. However, the underlying assumption is that the parallel rebuild process is facilitated by sufficient availability of network bandwidth to transfer data across nodes at full speed. In a large-scale data storage system where the network bandwidth for rebuild is constrained, such placement schemes will not be as effective. In this paper, it is shown through analysis and simulation how the spread of replicas across nodes affects system reliability under a network bandwidth constraint. Efficient placement schemes that can achieve high reliability in the presence of bandwidth constraints are proposed. Furthermore, in a dynamically changing storage system, in which the number of nodes and the network rebuild bandwidth can change over time, the data placement can be accordingly adapted to maintain a high level of reliability.</description><identifier>ISSN: 1526-7539</identifier><identifier>ISBN: 1467324531</identifier><identifier>ISBN: 9781467324533</identifier><identifier>EISSN: 2375-0227</identifier><identifier>DOI: 10.1109/MASCOTS.2012.31</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Approximation methods ; Bandwidth ; Data models ; Distributed databases ; Redundancy</subject><ispartof>2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2012, p.189-197</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/6298179$$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/6298179$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Venkatesan, V.</creatorcontrib><creatorcontrib>Iliadis, I.</creatorcontrib><creatorcontrib>Haas, R.</creatorcontrib><title>Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints</title><title>2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems</title><addtitle>MASCOT</addtitle><description>To improve the reliability of data storage systems, certain data placement schemes spread replicas corresponding to data stored on each node across several other nodes. When node failures occur, this enables parallelizing the rebuild process which in turn results in reducing the rebuild times. However, the underlying assumption is that the parallel rebuild process is facilitated by sufficient availability of network bandwidth to transfer data across nodes at full speed. In a large-scale data storage system where the network bandwidth for rebuild is constrained, such placement schemes will not be as effective. In this paper, it is shown through analysis and simulation how the spread of replicas across nodes affects system reliability under a network bandwidth constraint. Efficient placement schemes that can achieve high reliability in the presence of bandwidth constraints are proposed. Furthermore, in a dynamically changing storage system, in which the number of nodes and the network rebuild bandwidth can change over time, the data placement can be accordingly adapted to maintain a high level of reliability.</description><subject>Analytical models</subject><subject>Approximation methods</subject><subject>Bandwidth</subject><subject>Data models</subject><subject>Distributed databases</subject><subject>Redundancy</subject><issn>1526-7539</issn><issn>2375-0227</issn><isbn>1467324531</isbn><isbn>9781467324533</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjMtOwzAQRS0eEqV0zYKNfyDFM3bseFlCeUiFSE33lZNMwJAmKHZV9e-pBHdzFufoMnYLYg4g7P3bosyLTTlHATiXcMYmKE2aCERzzq5BaSNRpRIu2ARS1IlJpb1isxC-xGkmAxRywoo1dd5VvvPxyIeWP7roeBmH0X0QL48h0i7wfd_QyN8pHobxm6-p2vuu4Q-ubw6-iZ88H_oQR-f7GG7YZeu6QLN_TtnmabnJX5JV8fyaL1aJtyImUKe6JdeYTBvU1LY12KZqDWiLViltsxoUVZUF5_AUCVW7Wlg8GaukUXLK7v5uPRFtf0a_c-Nxq9FmYKz8BcjrUEA</recordid><startdate>201208</startdate><enddate>201208</enddate><creator>Venkatesan, V.</creator><creator>Iliadis, I.</creator><creator>Haas, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201208</creationdate><title>Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints</title><author>Venkatesan, V. ; Iliadis, I. ; Haas, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-1c56fead786726effc19dbf71692944698c14ebb91aa278604cac092469943743</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Analytical models</topic><topic>Approximation methods</topic><topic>Bandwidth</topic><topic>Data models</topic><topic>Distributed databases</topic><topic>Redundancy</topic><toplevel>online_resources</toplevel><creatorcontrib>Venkatesan, V.</creatorcontrib><creatorcontrib>Iliadis, I.</creatorcontrib><creatorcontrib>Haas, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (Online service)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Venkatesan, V.</au><au>Iliadis, I.</au><au>Haas, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints</atitle><btitle>2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems</btitle><stitle>MASCOT</stitle><date>2012-08</date><risdate>2012</risdate><spage>189</spage><epage>197</epage><pages>189-197</pages><issn>1526-7539</issn><eissn>2375-0227</eissn><isbn>1467324531</isbn><isbn>9781467324533</isbn><coden>IEEPAD</coden><abstract>To improve the reliability of data storage systems, certain data placement schemes spread replicas corresponding to data stored on each node across several other nodes. When node failures occur, this enables parallelizing the rebuild process which in turn results in reducing the rebuild times. However, the underlying assumption is that the parallel rebuild process is facilitated by sufficient availability of network bandwidth to transfer data across nodes at full speed. In a large-scale data storage system where the network bandwidth for rebuild is constrained, such placement schemes will not be as effective. In this paper, it is shown through analysis and simulation how the spread of replicas across nodes affects system reliability under a network bandwidth constraint. Efficient placement schemes that can achieve high reliability in the presence of bandwidth constraints are proposed. Furthermore, in a dynamically changing storage system, in which the number of nodes and the network rebuild bandwidth can change over time, the data placement can be accordingly adapted to maintain a high level of reliability.</abstract><pub>IEEE</pub><doi>10.1109/MASCOTS.2012.31</doi><tpages>9</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1526-7539
ispartof 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2012, p.189-197
issn 1526-7539
2375-0227
language eng
recordid cdi_ieee_primary_6298179
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Analytical models
Approximation methods
Bandwidth
Data models
Distributed databases
Redundancy
title Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T12%3A14%3A58IST&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=Reliability%20of%20Data%20Storage%20Systems%20under%20Network%20Rebuild%20Bandwidth%20Constraints&rft.btitle=2012%20IEEE%2020th%20International%20Symposium%20on%20Modeling,%20Analysis%20and%20Simulation%20of%20Computer%20and%20Telecommunication%20Systems&rft.au=Venkatesan,%20V.&rft.date=2012-08&rft.spage=189&rft.epage=197&rft.pages=189-197&rft.issn=1526-7539&rft.eissn=2375-0227&rft.isbn=1467324531&rft.isbn_list=9781467324533&rft.coden=IEEPAD&rft_id=info:doi/10.1109/MASCOTS.2012.31&rft_dat=%3Cieee_6IE%3E6298179%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-1c56fead786726effc19dbf71692944698c14ebb91aa278604cac092469943743%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6298179&rfr_iscdi=true