CN111971945A - 一种用于数据中心的机架感知再生码 - Google Patents
一种用于数据中心的机架感知再生码 Download PDFInfo
- Publication number
- CN111971945A CN111971945A CN201980000640.3A CN201980000640A CN111971945A CN 111971945 A CN111971945 A CN 111971945A CN 201980000640 A CN201980000640 A CN 201980000640A CN 111971945 A CN111971945 A CN 111971945A
- Authority
- CN
- China
- Prior art keywords
- code
- rack
- node
- repair
- chassis
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000008929 regeneration Effects 0.000 title claims abstract description 38
- 238000011069 regeneration method Methods 0.000 title claims abstract description 38
- 230000008439 repair process Effects 0.000 claims abstract description 215
- 239000013598 vector Substances 0.000 claims description 18
- 238000010276 construction Methods 0.000 abstract description 42
- 238000000034 method Methods 0.000 abstract description 13
- 230000006872 improvement Effects 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 abstract description 2
- 239000011159 matrix material Substances 0.000 description 50
- 238000004891 communication Methods 0.000 description 18
- 238000010586 diagram Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 6
- 230000000875 corresponding effect Effects 0.000 description 5
- 230000007423 decrease Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 230000009467 reduction Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009897 systematic effect Effects 0.000 description 2
- 241000903210 Bryconamericus alpha Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010835 comparative analysis Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003902 lesion Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/40—Support for services or applications
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明适用于数字编码技术改进领域，纠删编码广泛应用于海量存储的数据中心，以实现高容错和低存储冗余。提出了一种新的纠删码，称作机架感知再生码(RRC)，它可以实现最优的折中。再进一步提出了具有最小存储冗余和最小跨机架修复带宽的精确修复RRC的构造方法。提出的：（1）最小存储冗余RRC的构造方法具有广泛的参数选择范围，在大多数情况下，其跨机架修复带宽严格低于经典的最小存储再生码的跨机架修复带宽；（2）最小跨机架修复带宽RRC的构造方法可以支持所有的参数，同时对于绝大多数参数，其跨机架修复带宽比最小带宽再生码的跨机架修复带宽更小。
Description
PCT国内申请，说明书已公开。
Claims (5)
- PCT国内申请，权利要求书已公开。
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2019/081267 WO2020199162A1 (zh) | 2019-04-03 | 2019-04-03 | 一种用于数据中心的机架感知再生码 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111971945A true CN111971945A (zh) | 2020-11-20 |
Family
ID=72664578
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201980000640.3A Pending CN111971945A (zh) | 2019-04-03 | 2019-04-03 | 一种用于数据中心的机架感知再生码 |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111971945A (zh) |
| WO (1) | WO2020199162A1 (zh) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103688515A (zh) * | 2013-03-26 | 2014-03-26 | 北京大学深圳研究生院 | 一种最小带宽再生码的编码和存储节点修复方法 |
| US8788913B1 (en) * | 2011-12-30 | 2014-07-22 | Emc Corporation | Selection of erasure code parameters for no data repair |
| WO2016007379A1 (en) * | 2014-07-09 | 2016-01-14 | Qualcomm Incorporated | Systems and methods for reliably storing data using liquid distributed storage |
| CN108512918A (zh) * | 2018-03-23 | 2018-09-07 | 山东大学 | 异构分布式存储系统的数据处理方法 |
| CN108512553A (zh) * | 2018-03-09 | 2018-09-07 | 哈尔滨工业大学深圳研究生院 | 一种降低带宽消耗的截短再生码构造方法 |
| CN109062724A (zh) * | 2018-07-21 | 2018-12-21 | 湖北大学 | 一种纠删码转换方法及终端 |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8775860B2 (en) * | 2010-07-20 | 2014-07-08 | Tata Consultancy Services Limited | System and method for exact regeneration of a failed node in a distributed storage system |
| WO2014131148A1 (zh) * | 2013-02-26 | 2014-09-04 | 北京大学深圳研究生院 | 一种最小存储再生码的编码和存储节点修复方法 |
| CN105260259B (zh) * | 2015-09-16 | 2018-01-02 | 长安大学 | 一种基于系统最小存储再生码的局部性修复编码方法 |
| CN105721611B (zh) * | 2016-04-15 | 2019-03-01 | 西南交通大学 | 一种由极大距离可分存储码生成最小存储再生码的方法 |
-
2019
- 2019-04-03 CN CN201980000640.3A patent/CN111971945A/zh active Pending
- 2019-04-03 WO PCT/CN2019/081267 patent/WO2020199162A1/zh active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8788913B1 (en) * | 2011-12-30 | 2014-07-22 | Emc Corporation | Selection of erasure code parameters for no data repair |
| CN103688515A (zh) * | 2013-03-26 | 2014-03-26 | 北京大学深圳研究生院 | 一种最小带宽再生码的编码和存储节点修复方法 |
| WO2016007379A1 (en) * | 2014-07-09 | 2016-01-14 | Qualcomm Incorporated | Systems and methods for reliably storing data using liquid distributed storage |
| CN108512553A (zh) * | 2018-03-09 | 2018-09-07 | 哈尔滨工业大学深圳研究生院 | 一种降低带宽消耗的截短再生码构造方法 |
| CN108512918A (zh) * | 2018-03-23 | 2018-09-07 | 山东大学 | 异构分布式存储系统的数据处理方法 |
| CN109062724A (zh) * | 2018-07-21 | 2018-12-21 | 湖北大学 | 一种纠删码转换方法及终端 |
Non-Patent Citations (3)
| Title |
|---|
| HANXU HOU等: ""Rack-Aware Regenerating code for Data Centers"", 《IEEE TRANSACTIONS ON INFORMATION THEORY》, pages 4732 - 4745 * |
| YUCHONG HU等: ""Double Regenerating Codes for Hierarchical Data Centers"", 《2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY》 * |
| YUCHONG HU等: ""Double Regenerating Codes for Hierarchical Data Centers"", 《2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY》, 31 December 2016 (2016-12-31), pages 245 - 249 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020199162A1 (zh) | 2020-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hou et al. | Rack-aware regenerating codes for data centers | |
| Tamo et al. | A family of optimal locally recoverable codes | |
| US11500725B2 (en) | Methods for data recovery of a distributed storage system and storage medium thereof | |
| CN109643258B (zh) | 使用高速率最小存储再生擦除代码的多节点修复 | |
| Silberstein et al. | Optimal locally repairable codes via rank-metric codes | |
| Ye et al. | Cooperative repair: Constructions of optimal MDS codes for all admissible parameters | |
| Gopalan et al. | On the locality of codeword symbols | |
| Silberstein et al. | Error resilience in distributed storage via rank-metric codes | |
| Hou et al. | Binary MDS array codes with optimal repair | |
| WO2014003599A1 (en) | Redundant disc encoding via erasure decoding | |
| Hou et al. | A new design of binary MDS array codes with asymptotically weak-optimal repair | |
| Hou et al. | A new construction and an efficient decoding method for Rabin-like codes | |
| Kralevska et al. | Balanced locally repairable codes | |
| US20240243757A1 (en) | Erasure Code-Based Encoding Method and Related Device | |
| Mahdaviani et al. | Bandwidth adaptive & error resilient MBR exact repair regenerating codes | |
| Zhang et al. | Explicit constructions of optimal-access MSCR codes for all parameters | |
| Gligoroski et al. | Repair duality with locally repairable and locally regenerating codes | |
| Zhou et al. | Rack-aware regenerating codes with multiple erasure tolerance | |
| Han et al. | Update-efficient regenerating codes with minimum per-node storage | |
| Renner et al. | Decoding high-order interleaved rank-metric codes | |
| WO2018029212A1 (en) | Regenerating locally repairable codes for distributed storage systems | |
| CN111971945A (zh) | 一种用于数据中心的机架感知再生码 | |
| Dorkson et al. | Private information retrieval using product-matrix minimum storage regenerating codes | |
| Zhang et al. | Rack-aware regenerating codes with fewer helper racks | |
| Calis et al. | Architecture-aware coding for distributed storage: Repairable block failure resilient codes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201120 |