| 基于纠删编码P2P存储系统的数据维护算法 |
| |
| 作者姓名： | 林旭 来学嘉 |
| |
| 作者单位： | 上海交通大学计算机科学与工程系,上海200240 |
| |
| 基金项目： | 国家自然科学基金（60773092 61073149）; 高等学校博士学科点专项科研基金（20090073110027）; 省部产学研结合项目（2010B090400045）; 信息网络安全公安部重点实验室开放课题项目（C11603） |
| |
| 摘 要： | 纠删编码是一种通过产生数据冗余来提高P2P存储系统容错性和可用性的有效方法。对基于纠删编码的非结构化P2P存储系统来说,使用洪泛算法进行数据维护会在网络中产生大量冗余消息,系统效率低。本文提出一种使用二叉树来保存文件块的信息的算法。二叉树结构被建立以后,更新消息在二叉树中的节点间传播,不需要在网络中洪泛。分析表明,相较于洪泛算法,本算法有效减少了冗余的消息数量,提高了数据维护的效率,而付出的是极小的存储代价。
|
| 关 键 词： | 非结构化P2P 洪泛 二叉树 |
Algorithm for Data Management of P2P Storage System Based on Erasure Code |
| |
| Authors: | Lin Xu Lai Xue-jia |
| |
| Affiliation: | Lin Xu Lai Xue-jia(Department of Computer Science ＆ Engineering,ShangHai Jiao Tong University Shanghai 200240) |
| |
| Abstract: | Erasure code is a means of generating data redundancy to improve fault tolerance and availability of P2P storage systems.For unstructed P2P storage systems which based on Erasure code,using flooding algorithm to manage data will produce a large number of redundant messages in the network,and the systems will be inefficient.This paper presents an algorithm which use binary tree to save the information of file blocks.After the binary tree is built,update message will transmit between nodes of the tree,without flooding in the network.Analysis shows that,compared with flooding algorithm,the binary tree algorithm effectively reduces the number of redundant messages,improve the efficiency of data management,and to pay the storage costs are minimal. |
| |
| Keywords: | unstructed P2P flooding binary tree |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
