User Satisfaction based Quantification of Direct Trust in T-Grid Computational Model

被引:0
|
作者
Kumar, P. Suresh [1 ]
Ramachandram, S. [2 ]
机构
[1] Kakatiya Inst Technol & Sci, Dept CSE, Warangal, Andhra Pradesh, India
[2] Osmania Univ, Dept CSE, Hyderabad, Andhra Pradesh, India
关键词
grid computing; trust; direct trust; indirect trust; fuzzy; user satisfaction; availability; reliability;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Grid computing provides collaborative sharing of resources among the peers across the world. There are various types of resources in a grid at different capacities such as computing, storage, and instruments. Security plays a vital role in setting up a grid and to preserve its resources. Further, trust also plays a vital role in building a confidence level in sharing the resources. T-Grid is the model proposed to evaluate the trust by applying fuzzy rules on direct trust and indirect trust, relatively using new approaches. One such approach in this direction is quantification of direct trust. Quantification of direct trust in this T-Grid model is assumed to be dependent on satisfaction of requester, which is based on two factors satisfaction due to availability and satisfaction due to reliability. And, indirect trust is chosen due to recommendations or feedbacks received from the user and/or recommenders in the system. This paper proposes a satisfaction based approach of quantification of direct trust in T-Grid computational model. The performance evaluation of the proposed model is done using the parameters like trustworthiness of the resources, and resource utilization. The results also indicate that, in spite of maintaining the balance in the resource utilization, highly trusted resources are selected for grid services.
引用
收藏
页码:438 / 442
页数:5
相关论文
共 50 条
  • [41] A resource allocation model based on Trust-Cost in grid
    Sun, Kelei
    Zhang, Ruixin
    [J]. 2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 4, 2008, : 509 - 514
  • [42] Dynamic level scheduling based on trust model in grid computing
    Department of Computer Science and Technology, Tongji University, Shanghai 201804, China
    [J]. Jisuanji Xuebao, 2006, 7 (1217-1224):
  • [43] Trust-based access control model for grid applications
    Yao, Hanbing
    Liu, Yangjun
    Liu, Wei
    Li, Ruixuan
    [J]. DCABES 2007 PROCEEDINGS, VOLS I AND II, 2007, : 491 - 495
  • [44] A novel trust evolution algorithm based on a quantum-like model of computational trust
    Mehrdad Ashtiani
    Mohammad Abdollahi Azgomi
    [J]. Cognition, Technology & Work, 2019, 21 : 201 - 224
  • [45] A novel trust evolution algorithm based on a quantum-like model of computational trust
    Ashtiani, Mehrdad
    Azgomi, Mohammad Abdollahi
    [J]. COGNITION TECHNOLOGY & WORK, 2019, 21 (02) : 201 - 224
  • [46] TSM-Trust: A Time-Cognition Based Computational Model for Trust Dynamics
    Xu, Guangquan
    Feng, Zhiyong
    Li, Xiaohong
    Wu, Hutong
    Yu, Yongxin
    Chen, Shizhan
    Rao, Guozheng
    [J]. INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2009, 5927 : 385 - 395
  • [47] Machine Learning Based Trust Computational Model for IoT Services
    Jayasinghe, Upul
    Lee, Gyu Myoung
    Um, Tai-Won
    Shi, Qi
    [J]. IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2019, 4 (01): : 39 - 52
  • [48] A Biologically Inspired Computational Trust Model based on the Perspective of the Trustee
    Lygizou, Zoi
    Kalles, Dimitris
    [J]. PROCEEDINGS OF THE 12TH HELLENIC CONFERENCE ON ARTIFICIAL INTELLIGENCE, SETN 2022, 2022,
  • [49] Cloud model-based subjective trust management model for grid users
    Wei K.
    Liu X.-X.
    [J]. Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2011, 39 (02): : 81 - 87+94
  • [50] Research and Application of User Satisfaction Model Based on Signaling Mining
    Shi, Chundan
    Wei, Wenjun
    Wang, Jibin
    [J]. BDIOT 2018: PROCEEDINGS OF THE 2018 2ND INTERNATIONAL CONFERENCE ON BIG DATA AND INTERNET OF THINGS, 2018, : 191 - 197