基于Peer-to-Peer的分布式存储系统的设计

Design of Distributed Storage System on Peer-to-Peer Structure

分布式存储系统是p2p技术的一个重要的研究领域.当前对p2p系统的结构研究已经能够高度有效地控制节点路由次数,人们逐渐转向追求更为实际的路由距离.作为存储应用,分布式系统需要具备综合容错-恢复能力.在分析现有研究的基础上,建立一个接近实际网络节点分布的计算模型,通过已知的节点最优路径情况动态地预测网络真实路径的长度.利用评估算法聚集网络中相近的节点,使得同一分组的节点之间的距离最小化,提供更加合理的路由选择.对于存储的可靠性,提出了节点交叉管理模型和相应的数据迁移算法.这种管理策略及迁移算法的本地性特点显著提高了系统对各种事件的反应能力,保证了系统的可持续性.模拟结果显示,分组为路由选择提供了确实有效的判据,而且可以扩展到更大的规模.

Distributed storage system is an important research area in peer-to-peer technology. Current research on p2p structure has made a highly controlled routing scheme with limited hops of message transfer. People now turn to pursue lower network latency that is more factual. As a storage application, distributed system must have fault tolerance-recovery capability. Based on the analysis of current research, a computing modal more approximate to real time network is constructed. A computed shortest path of nodes is used to dynamically estimate the actual latency. Adjacent nodes are gathered under an evaluating algorithm to make node latency in the same group minimal. Thus a more efficient routing can be based on node grouping. For storage persistency, an interaction management and corresponded data transfer algorithm is presented. Its locality greatly enhances the system's response to all kinds of events, and ensures the system's availability. The simulation results are provided to show that the introduction of grouping truly helps to get an effective judgment on routing choice, and can be extend to a larger scale.