一种基于服务器集的可生存性存储方案  

Survivability Storage Scheme Based on Server Muster

作　　者：刘昀昊[1] 张敏情[1] 张薇[1] 

机构地区：[1]武警工程学院电子技术系网络与信息安全武警部队重点实验室,西安710086

出　　处：《计算机工程》2011年第3期121-123,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60842006)

摘　　要：在可生存存储系统中,安全与效率是2个比较关键的因素。针对一般的存储方案不能同时满足这2个要求的问题,通过引入服务器集合,并结合复制与秘密共享方法,不仅使方案达到安全与效率的折中,而且每个访问者可以根据地理位置选择最佳途径访问数据,每个服务器集合也能够根据实际需求增加或者删除结点,不会损坏方案的功能。该方案在具备高安全性和效率的同时,灵活性也得到了提高,具有较高的实用价值。In the survivability storage systems, security and efficiency are two quite crucial factors. For the general storage scheme can not satisfy the requirements of these two cases at the same time, this paper achieves a compromise between security and efficiency by using the server muster and combining with replication and secret sharing methods. In the scheme, each visitor can choose the best way to access the data according to geographic location and every server group can also increase or delete nodes without damaging the scheme functions. The scheme not only has high security and efficiency, but also improves the flexibility. It has very high practical value.

关 键 词：可生存性 存储方案 效率 服务器集 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]