电子学报 ›› 2021, Vol. 49 ›› Issue (6): 1151-1158.DOI: 10.12263/DZXB.20200288

• 学术论文 • 上一篇    下一篇

异构对等分布式存储中的DHitchhiker码

胡金平, 李贵洋, 周悦, 李慧, 江小玉, 韩鸿宇   

  1. 四川师范大学计算机科学学院, 四川成都 610101
  • 收稿日期:2020-03-23 修回日期:2020-08-01 出版日期:2021-06-25 发布日期:2022-06-25
  • 通讯作者: 李贵洋(通信作者) 男,1975年生于四川宜宾.现为四川师范大学计算机科学学院教授.研究生导师.主要研究方向为大数据存储编码、机器学习.E-mail:gyli@sicnu.edu.cn
  • 作者简介:胡金平 女,1994年生于重庆云阳.四川师范大学计算机科学学院硕士研究生.研究方向为分布式存储、纠删码.E-mail:hu_jp1124@163.com
  • 基金资助:
    国家自然科学基金(No.61701331)

DHitchhiker Codes in Heterogeneous Peer-to-Peer Distributed Storage

HU Jin-ping, LI Gui-yang, ZHOU Yue, LI Hui, JIANG Xiao-yu, HAN Hong-yu   

  1. College of Computer Science, Sichuan Normal University, Chengdu, Sichuan 610101, China
  • Received:2020-03-23 Revised:2020-08-01 Online:2021-06-25 Published:2022-06-25

摘要: 具有高可用性和安全性的去中心化存储因其应用的相同参数低码率RS(Reed-Solomon codes)码存在修复带宽较高的问题.对此,提出一种基于可信度的低修复带宽DHitchhiker码.首先将Hitchhiker码的第一子条带中的数据节点和部分校验节点捎带在余下的校验节点的第二个子条带上;接着将节点分类,让高可信节点存储余下的校验节点,低可信节点存储数据节点和部分校验节点,并让不同类型的节点采用不同的修复策略;最后理论结合实验证明,在修复低可信节点时,DHitchhiker可降低约25%的修复带宽;在整体上,未分类存放的DHitchhiker码可降低约0.5%的修复带宽,基于可信度的DHitchhiker码可降低约1%的修复带宽和2.5%~3.3%的修复时间.

关键词: MDS码, RS码, 可信度, 去中心化存储, Hitchhiker码

Abstract: Decentralized storage with high availability and security has the problem of high repair bandwidth due to the same parameter low rate Reed-Solomon codes.Thus,a low repair bandwidth DHitchhiker based on credibility is proposed.Data nodes and some parity nodes in the first sub-stripe of Hitchhiker are piggybacked on the second sub-stripe of the remaining parity nodes.We classify the nodes,and let thehigh-credit nodes store the remaining parity nodes,the low-credit nodes store the data nodes and some parity nodes,and different types of nodes adopt different repair strategies.It is proved that the repair bandwidth can be reduced by about 25% at repairing low-credit nodes.And the repair bandwidth can be reduced by about 0.5% without classifying the nodes.What's more,the repair bandwidth can also be reduced by about 1% and the repair time can be reduced by about 2.5%~3.3% based on the credibility of the nodes.

Key words: MDS codes, Reed-Solomon codes, credibility, decentralized storage, hitchhiker

中图分类号: