摘要
研究了动态网络环境下基于网络的存储系统的数据放置算法,分析了现有的数据放置算法,提出了通用带权分布式哈希表算法。与相容哈希算法和对数算法定义的评判函数相比,考虑了各个节点的存储空间、数据分发节点与数据存储节点之间的物理距离、网络带宽等的限制。仿真结果表明,该算法能够实现数据的公平分发。
The data placement algorithm of networked based storage system in the dynamic network environment is studied. The current data placement algorithms are analyzed. The general weighted distributed hash tables algorithm is proposed, compared with the consistent hash algorithm and logarithm evaluation function, which considered the following conditions: The nodes storage space, the physical distance between data distribution nodes and data storage nodes, networks bandwidth. The simulation results show that the data can be fairly distributed.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第4期794-796,共3页
Computer Engineering and Design
基金
国防科技工业基础科研基金项目(H142005D001)
关键词
相容哈希算法
通用带权分布式哈希表
数据放置
存储系统
性能评价
consistent hashing algorithm
general weighted distributed hash tables
data placement
storage system
performance evaluation