View in EDS PDF Full Text

Probability-Symmetric Storage Allocation for Distributed Storage Systems based on Network Coding.

Saved in:
Bibliographic Details
Title: Probability-Symmetric Storage Allocation for Distributed Storage Systems based on Network Coding.
Authors: Qingtao Wu1 wqt8921@126.com, Xulong Zhang1 daleloogn@126.com, Ruijuan Zheng1 rjwo@163.com, Mingchuan Zhang1 zhlzmc@163.com
Source: International Journal of Online Engineering. May2013 Special Issue 4, Vol. 9, p64-68. 5p.
Subjects: Probability theory, Dynamic storage allocation (Computer science), Information storage & retrieval systems, Coding theory, Mathematical optimization, Resource allocation, Data transmission systems
Abstract: The goal of optimal allocation is to increase stored data availability subject to minimizing the storage budget. Symmetric allocation based on the network coding has been proved to be optimal for distributed storage systems if node availability is not considered. However, because of network conditions and the inherent properties of nodes, each node will have a different availability. This paper focuses on the problem of optimizing distributed data storage when considering node availability. Using a probability model for storage systems, we redefine symmetric allocation in terms of probability-symmetric allocation and propose a probability-symmetric allocation model and strategy based on network coding. These are shown to be optimal in general. Compared with the symmetric allocation scheme proposed by Leong et al., the proposed probability-symmetric allocation scheme not only improves data availability in distributed storage systems but also is more practical. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Online Engineering is the property of International Journal of Online Engineering and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 87747994
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Probability-Symmetric Storage Allocation for Distributed Storage Systems based on Network Coding.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Qingtao+Wu%22">Qingtao Wu</searchLink><relatesTo>1</relatesTo><i> wqt8921@126.com</i><br /><searchLink fieldCode="AR" term="%22Xulong+Zhang%22">Xulong Zhang</searchLink><relatesTo>1</relatesTo><i> daleloogn@126.com</i><br /><searchLink fieldCode="AR" term="%22Ruijuan+Zheng%22">Ruijuan Zheng</searchLink><relatesTo>1</relatesTo><i> rjwo@163.com</i><br /><searchLink fieldCode="AR" term="%22Mingchuan+Zhang%22">Mingchuan Zhang</searchLink><relatesTo>1</relatesTo><i> zhlzmc@163.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Online+Engineering%22">International Journal of Online Engineering</searchLink>. May2013 Special Issue 4, Vol. 9, p64-68. 5p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Probability+theory%22">Probability theory</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamic+storage+allocation+%28Computer+science%29%22">Dynamic storage allocation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22Coding+theory%22">Coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Resource+allocation%22">Resource allocation</searchLink><br /><searchLink fieldCode="DE" term="%22Data+transmission+systems%22">Data transmission systems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The goal of optimal allocation is to increase stored data availability subject to minimizing the storage budget. Symmetric allocation based on the network coding has been proved to be optimal for distributed storage systems if node availability is not considered. However, because of network conditions and the inherent properties of nodes, each node will have a different availability. This paper focuses on the problem of optimizing distributed data storage when considering node availability. Using a probability model for storage systems, we redefine symmetric allocation in terms of probability-symmetric allocation and propose a probability-symmetric allocation model and strategy based on network coding. These are shown to be optimal in general. Compared with the symmetric allocation scheme proposed by Leong et al., the proposed probability-symmetric allocation scheme not only improves data availability in distributed storage systems but also is more practical. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Online Engineering is the property of International Journal of Online Engineering and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=87747994
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3991/ijoe.v9iS4.2659
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 5
        StartPage: 64
    Subjects:
      – SubjectFull: Probability theory
        Type: general
      – SubjectFull: Dynamic storage allocation (Computer science)
        Type: general
      – SubjectFull: Information storage & retrieval systems
        Type: general
      – SubjectFull: Coding theory
        Type: general
      – SubjectFull: Mathematical optimization
        Type: general
      – SubjectFull: Resource allocation
        Type: general
      – SubjectFull: Data transmission systems
        Type: general
    Titles:
      – TitleFull: Probability-Symmetric Storage Allocation for Distributed Storage Systems based on Network Coding.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Qingtao Wu
      – PersonEntity:
          Name:
            NameFull: Xulong Zhang
      – PersonEntity:
          Name:
            NameFull: Ruijuan Zheng
      – PersonEntity:
          Name:
            NameFull: Mingchuan Zhang
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 02
              M: 05
              Text: May2013 Special Issue 4
              Type: published
              Y: 2013
          Identifiers:
            – Type: issn-print
              Value: 18681646
          Numbering:
            – Type: volume
              Value: 9
          Titles:
            – TitleFull: International Journal of Online Engineering
              Type: main
ResultId 1