DocumentCode :
3066470
Title :
Security-Driven Scheduling Algorithms Based on EigenTrust in Grid
Author :
Li, Kenli ; He, Yan ; Liu, Xiaoling ; Wang, Ying
Author_Institution :
Hunan University, Changsha, China
fYear :
2005
fDate :
05-08 Dec. 2005
Firstpage :
1068
Lastpage :
1072
Abstract :
Grid computing provides a virtual framework for controlled sharing of resources across institutional boundaries. Recently, trust has been recognized as an important factor for scheduling in Grid. Trust is a complex subject relating to such as reliability, honesty, and competence of the trusted entity. Trust value computing becomes more difficult in Grid as the nodes are independent and distributed, and with a securityaware task execution model, task scheduling is crucial to achieving high performance. In this paper, we present a trust model wherein each node is assigned a trust value that reflects the transaction experiences. Eigenvector is used to calculate the trust value and distribute eigentrust algorithm is modified according to the characteristic of the Grid. Furthermore, trust managers are set to guide scheduling, and securitydriven algorithms are proposed to ensure the security of the executions. Simulations are performed to evaluate the performance of the algorithms.
Keywords :
Algorithm design and analysis; Distributed computing; Educational institutions; Fault tolerance; Grid computing; Helium; Power system protection; Processor scheduling; Scheduling algorithm; Security;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN :
0-7695-2405-2
Type :
conf
DOI :
10.1109/PDCAT.2005.212
Filename :
1579099
Link To Document :
بازگشت