检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南司法警官职业学院,河南郑州450000 [2]河南牧业经济学院,河南郑州450000
出 处:《现代电子技术》2015年第17期89-92,共4页Modern Electronics Technique
摘 要:为了让在云端计算环境中运行的计算任务机密和隐私得到保障,避免恶意节点或竞争对手窥视任务的内部结构、系统逻辑和任务目标,必须构建一种全新的基于移动Agent的云端计算任务安全分割与分配算法。这种算法不仅要结合集群服务器节点的计算能力和特征,还要将用户终端节点的相关方面也考虑进去,把整个大的任务合理地分割成若干子任务,并将移动Agent作为这些子任务的数据结构和代码构成的载体;然后把这些数据和代码分配到与之对应的合理的任务执行节点上进行工作。通过将实验原型系统和该算法结合起来进行性能分析与探索,证明该算法对执行子任务的终端节点安全性的保障具有较强的有效性,即便有恶意节点窥探到了分配给该任务执行节点的数据和代码,甚至联合起来对系统进行攻击,也不会对这个任务的总体执行思路和整体目标的安全性造成威胁。To guarantee the confidentiality and privacy of computing tasks operated in cloud computing environment,and avoid the malicious nodes or the competitors peering the internal structure,system logic and task objects,a new security segmentation and allocation algorithm of cloud computing task based on mobile Agent needs to be constructed. This algorithm combines with the computing ability and characteristics of cluster server nodes,and the relevant aspects of the user terminal nodes are taken into account. The entire task is segmented into some sub-task effectively,then the mobile Agent is taken as the carrier of data structure and code structure of the sub-task. The data and codes are allocated to reasonable task execution nodes corresponding to them. The performance is analyzed and explored by combining with experimental prototype system and this algorithm. It proved that the algorithm has better validity to guarantee the terminal nodes security of executing sub-task. When the malicious nodes peered the data and codes allocated to the task execution nodes,even the malicious nodes are combined together to attack on the system,it can not threaten the overall execution thought of the task and the security of the entire object.
关 键 词:移动AGENT技术 云端计算 隐私安全 分割与分配算法
分 类 号:TN918.34[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222