全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

具有健康节点协作的高效多节点修复方案

DOI: 10.13190/j.jbupt.2014.01.012, PP. 52-56

Keywords: 分布式存储,多节点修复,修复带宽,修复可靠性,健康节点的协作

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对分布式存储中多节点再生修复的修复带宽和可靠性问题,提出了一种具有健康节点协作的多节点修复方案.该方案在修复模型上做出了相应改进,通过健康节点间的协作把上述问题做了折中.给出了具体的多节点修复过程和相应再生码的构造,用信息流图求得最大流最小割集来说明其最小边界.结果表明,在确保修复带宽最低的条件下使修复时间同步,修复过程更简便,最重要的是所需传输信道更少,保证了修复的可靠性.

References

[1]  Dimakis A G, Ramchandran K, Wu Y, et al. A survey on network codes for distributed storage[J]. Proceedings of the IEEE, 2011, 99(3): 476-489.
[2]  Hu Y, Xu Y, Wang X, et al. Cooperative recovery of distributed storage systems from multiple losses with network coding[J]. IEEE Journal on Selected Areas in Communications, 2010, 28(2): 268-275.
[3]  Shum K W, Hu Y. Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems[C]//IEEE International Symposium on Information Theory Proceedings (ISIT). Saint-Petersburg, Russia: IEEE Press, 2011: 1442-1446.
[4]  Shum K W. Cooperative regenerating codes for distributed storage systems[C]//IEEE International Conference on Communications (ICC). Tokyo, Japan: IEEE Press, 2011: 1-5.
[5]  Kathrin Peter, Sobe Peter. Application of regenerating codes for fault tolerance in distributed storage systems[C]//IEEE 11th International Symposium on Network Computing and Applications. Cambridge, MA, USA: IEEE Press, 2012: 67-70.
[6]  Wu Y, Dimakis A G. Reducing repair trafflc for erasure coding-based storage via interference alignment[C]//IEEE International Symposium on Information Theory (ISIT). Seoul: IEEE Press, 2009: 2276-2280.
[7]  Mac-williams F J, Sloane N J A. The theory of error-correcting codes[M]. North-Holland, New York: Elsevier, 1977: 762.
[8]  Dimakis A G, Godfrey P B, Wainwright M J, et al. Network coding for distributed storage systems[C]//IEEE International Conference on Computer (INFOCOM). Anchorage, Alaska: IEEE Press, 2007: 2000-2008.

Full-Text

Contact Us

[email protected]

QQ:3279437679

WhatsApp +8615387084133