检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河北大学网络技术研究所,河北保定071002
出 处:《通信学报》2016年第2期1-10,共10页Journal on Communications
基 金:国家自然科学基金资助项目(No.61170254);河北省自然科学基金资助项目(No.F2014201165);河北省高等学校科学技术研究重点基金资助项目(No.ZH2015088)~~
摘 要:以可信计算技术为基础,针对可信云平台构建过程中可信节点动态管理存在的性能瓶颈问题,提出了基于TPM联盟的可信云平台体系结构及管理模型。针对TPM自身能力的局限性,提出了宏TPM和根TPM的概念。针对可信云中节点管理时间开销大的问题,引入时间树的概念组织TPM联盟,利用TPM和认证加密技术解决数据在TPM联盟内节点间的可信传输问题,提出了一种基于时间树的TPM联盟管理策略,包括节点配置协议、注册协议、注销协议、实时监控协议、网络管理修复协议和节点更新协议,阐述了时间树的生成算法,分析了建立可信节点管理网络的时间开销和节点状态监控的有效性。最后,通过仿真实验说明了模型具有较好的性能和有效性。On the basis of trusted computing technology, trusted cloud platform architecture and management model based on the TPM alliance was proposed to solve the performance bottleneck of dynamic management of trusted nodes in the building process of trusted cloud platform. Macro TPM was proposed to solve the capability limitation of TPM, the concept of time-based tree was introduced to organize TPM alliance, addressing the problem of high time cost of nodes management in trusted cloud. It used TPM and authentication encryption technology to solve the trusted transmission problem of data among nodes in TPM alliance, and a management strategy of time-based tree TPM alliance was proposed, including node configuration protocol, node registration protocol, node logout protocol, node state real-time monitor protocol, trusted nodes management network repair protocol, node update protocol. That explains the production algorithm of time-based tree, analyses the effectiveness of the time cost of building trusted node management network and monitoring of node state. The simulation result indicates that the model is efficient, and the time cost in trusted node management can be reduced.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.91.183