File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JCN.2015.000105
- Scopus: eid_2-s2.0-84962054921
- WOS: WOS:000368450500005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: HTSC and FH_HTSC: XOR-based codes to reduce access latency in distributed storage systems
Title | HTSC and FH_HTSC: XOR-based codes to reduce access latency in distributed storage systems |
---|---|
Authors | |
Keywords | Access latency computation cost erasure codes failure tolerance repair cost storage overhead |
Issue Date | 2015 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5449605 |
Citation | Journal of Communications and Networks, 2015, v. 17 n. 6, p. 582-591 How to Cite? |
Abstract | A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH_HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH.HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH.HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH.HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time. |
Persistent Identifier | http://hdl.handle.net/10722/231943 |
ISSN | 2023 Impact Factor: 2.9 2023 SCImago Journal Rankings: 1.551 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shuai, Q | - |
dc.contributor.author | Li, VOK | - |
dc.date.accessioned | 2016-09-20T05:26:32Z | - |
dc.date.available | 2016-09-20T05:26:32Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | Journal of Communications and Networks, 2015, v. 17 n. 6, p. 582-591 | - |
dc.identifier.issn | 1229-2370 | - |
dc.identifier.uri | http://hdl.handle.net/10722/231943 | - |
dc.description.abstract | A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH_HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH.HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH.HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH.HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5449605 | - |
dc.relation.ispartof | Journal of Communications and Networks | - |
dc.rights | ©2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | Access latency | - |
dc.subject | computation cost | - |
dc.subject | erasure codes | - |
dc.subject | failure tolerance | - |
dc.subject | repair cost | - |
dc.subject | storage overhead | - |
dc.title | HTSC and FH_HTSC: XOR-based codes to reduce access latency in distributed storage systems | - |
dc.type | Article | - |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | - |
dc.identifier.authority | Li, VOK=rp00150 | - |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1109/JCN.2015.000105 | - |
dc.identifier.scopus | eid_2-s2.0-84962054921 | - |
dc.identifier.hkuros | 265051 | - |
dc.identifier.volume | 17 | - |
dc.identifier.issue | 6 | - |
dc.identifier.spage | 582 | - |
dc.identifier.epage | 591 | - |
dc.identifier.isi | WOS:000368450500005 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1229-2370 | - |