Credibility protection for resource sharing and collaborating in non-center network computing environments

作     者：XU Xiao-long TU Qun WANG Xin-heng WANG Ru-chuan 

作者机构：College of Computer Nanjing University of Posts and Telecommunications State Key Laboratory for Novel Software Technology Nanjing University School of Computing University of the West of Scotland Paisley PA1 2BE United Kingdom 

出 版 物：《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报（英文版）)

年 卷 期：2014年第21卷第3期

页      面：46-55页

核心收录：

学科分类：08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 

基　　金：supported by the National Natural Science Foundation of China(61202004) 

主　　题：non-center network computing agent credibility evidence 

摘      要：Non-center network computing environments have some unique characteristics, such as instability, heterogeneity, autonomy, distribution and openness, which bring serious issues of security and reliability. This article proposes a brand-new credibility protection mechanism for resource sharing and collaboration in non-center network computing environments. First, the three-dimensional hierarchical classified topology （3DHCT） is proposed, which provides a basic framework for realizations of the identity credibility, the behavior credibility and the capability credibility. Next, the agent technology is utilized to construct the credibility protection model. This article also proposes a new comprehensive credibility evaluation algorithm with simple, efficient, quantitative and able to meet the requirements of evaluating behavior credibility and the capability credibility evaluation as well. The Dempster-Shafer theory of evidence and the combination rule are used to achieve the evaluation of the capability credibility. The behavior credibility is evaluated with the current and historical performance of nodes for providers and consumers to realize more accurate prediction. Based on the non-center network computing simulation test platform, simulation is been conducted to test the performance and validity of the proposed algorithms. Experiment and analysis show that the proposed algorithms are suitable for large-scale, dynamic network computing environments, and able to maintain the credibility for networks without relying on central node, make a non-center network gradually evolve into an orderly, stable and reliable computing environment efficiently.