| P2P存储网络中的冗余维持 |
| |
| 引用本文： | 李钧,王新.P2P存储网络中的冗余维持[J].计算机研究与发展,2009,46(Z2). |
| |
| 作者姓名： | 李钧 王新 |
| |
| 作者单位： | 复旦大学计算机科学技术学院,上海,200433 |
| |
| 基金项目： | 国家自然科学基金项目，国家"八六三"高技术研究发展计划基金项目，上海市重大科研基金项目，上海市科委启明星计划基金项目，综合业务网理论及关键技术国家重点实验室开放课题基金项目，复旦大学本科生学术研究资助计划 |
| |
| 摘 要： | 在P2P存储网络中,为保证数据安全可靠,当网络中数据丢失后需生成新的冗余数据.因此,如何快速生成新的冗余数据并保持数据的可靠性就成为评价存储网络性能的关键.网络编码作为一项新兴技术,已被证明可以提高网络吞吐率和鲁棒性.将网络编码思想引入冗余数据维持,可以加快冗余生成速度,从而提高数据可靠性.通过理论分析和仿真给出了快速修复冗余数据的方法、开销和相应的传输策略.仿真结果表明,较传统修复方式所提出的快速修复方法可以节省60%以上的传输时间.
|
| 关 键 词： | 存储网络 冗余维持 网络编码 |
Redundancy Maintenance in P2P Storage Networks |
| |
| Li Jun,Wang Xin.Redundancy Maintenance in P2P Storage Networks[J].Journal of Computer Research and Development,2009,46(Z2). |
| |
| Authors: | Li Jun Wang Xin |
| |
| Abstract: | In peer-to-peer networks,new redundancy should be regenerated when there is data loss in the network in order to keep data safe and reliable.Therefore,how to regenerate new redundancy becomes a key to evaluate the performance of network storage systems.Network coding,as a novel technology,has been proved to improve the throughput and robustness of the network.In this paper,network coding is introduced into redundancy maintenance,so as to accelerate regeneration of new redundancy and improve the data reliability.By theoretical analysis,a fast method is given to regenerate new redundancy,its cost,and transmission scheme.The simulation results show that the proposed method can save transmission time in comparison with the traditional transmission scheme by more than 60%. |
| |
| Keywords: | P2P P2P storage network redundancy maintenance network coding |
| 本文献已被 万方数据 等数据库收录！ |
|
