Volume 11, Issue 2 (6-2019)                   itrc 2019, 11(2): 62-69 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Khosravi S. Proposing a New Algorithm for Predicting Short-Term and Long-Term Trust-ability in Cloud Computing. itrc 2019; 11 (2) :62-69
URL: http://ijict.itrc.ac.ir/article-1-417-en.html
Faculty of Electrical and Computer Engineering, University of Birjand, Birjand, Iran , mahdidarbandi@hotmail.com
Abstract:   (559 Views)
Abstract: Despite the huge use of cloud computing, due to its large dimensions and availability for all users, this type of network is weak and vulnerable to malicious attacks. Therefore, as a useful complement to existing security methods, trust management plays a crucial role in discovering suspicious behaviors in the cloud computing network. The critical question is, how can we find ideally and effectively users with suspicious behaviors in these complex environments. In this paper, the Markov chain model has been used to calculate the short-term reliability of users in the cloud network, and the trust management system has been proposed to mitigate the effects of complex environments to calculate the user’s status. Furthermore, a new computational model has been introduced with relevant, practical factors for calculating the long-term trust that reduces the effect of changing environmental parameters in the calculations. The simulation results show that the proposed algorithm, Markov chain trust management can more effectively detect suspicious behaviors of users in the cloud computing network, and in a meaningful way, provide a better rate of delivery of packets compared to their counterparts, and ultimately provide better security in the cloud computing network.
Full-Text [PDF 506 kb]   (270 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.