B-tree based trust model for resource selection in grid

被引:0
|
作者
Varalakshmi, P. [1 ]
Selvi, S. Thamarai [1 ]
Ashraf, A. Javed [1 ]
Karthick, K. [1 ]
机构
[1] Anna Univ, MIT, Dept Informat Technol, Madras 600025, Tamil Nadu, India
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Trust Management is an important issue in a grid environment where consumers and service providers are distributed geographically across autonomous administrative domains. In this paper, we propose reputation-based trust management architecture through the use of intermediaries, brokers. This architecture insists on multiple brokers in each domain. The entities (Consumers and the SPs) are distributed across these brokers, with each of these entities being associated with more than one broker. This improves the redundancy of information maintained at the broker sites, thereby improving the reliability. This also eases the network traffic at the broker sites while handling consumer requests and feedbacks. The issues rising out of such an arrangement of multiple brokers, namely the distribution of entities among the brokers and maintenance of consistency of information across the brokers, are addressed well in this paper. Trust-indices of SPs and consumers are evaluated and updated dynamically after the completion of each transaction. This enables the consumer to receive the response from the broker significantly quicker compared to other reputation-based-trust models where the trust-indices are computed at the request-time. To further improve the response time of each transaction, a B-Tree Indexing Scheme has been proposed. Trust parameters such as satisfaction-value, number, cost and criticality of transactions, and different weights for past and recent transactions are considered for the trust evaluation. Our model shows a marked improvement in job success rate for various percentages of malicious entities. The selection query cost for each transaction is reduced thereby improving the overall response time is show-cased in this model. The impact of broker's feedback on the computation of trust-indices is also presented.
引用
收藏
页码:222 / +
页数:2
相关论文
共 50 条
  • [1] Reputation-policy trust model for Grid resource selection
    Zetuny, Yonatan
    Terstyanszky, Gabor
    Winter, Stephen
    Kacsuk, Peter
    [J]. DISTRIBUTED AND PARALLEL SYSTEMS: IN FOCUS: DESKTOP GRID COMPUTING, 2008, : 195 - +
  • [2] Bloom Filters Based on the B-tree
    Sato, Fumiaki
    Wakabayashi, Shigetoshi
    [J]. CISIS: 2009 INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, VOLS 1 AND 2, 2009, : 500 - 505
  • [3] Resource Selection in Computational Grid Based on User QoS and Trust
    Kavitha, G.
    Sankaranarayanan, V.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2011, 11 (03): : 214 - 221
  • [4] B-TREE BUSINESS
    ROSENTHAL, M
    [J]. DR DOBBS JOURNAL, 1991, 16 (03): : 12 - 12
  • [5] B-Tree Search Reinforcment Learning for Model Based Intelligent Agent
    Bhuvaneswari, S.
    Vignashwaran, R.
    [J]. INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012), 2013, 8768
  • [6] UBIQUITOUS B-TREE
    COMER, D
    [J]. COMPUTING SURVEYS, 1979, 11 (02) : 121 - 137
  • [7] THE INTERVAL B-TREE
    ANG, CH
    TAN, KP
    [J]. INFORMATION PROCESSING LETTERS, 1995, 53 (02) : 85 - 89
  • [8] Security for Resource Selection in Grid Computing Based On Trust and Reputation Responsiveness
    Vijayakumar, V.
    Banu, R. S. D. Wahida
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (11): : 107 - 115
  • [9] Secure resource selection in computational grid based on quantitative execution trust
    Kavitha, G.
    Sankaranarayanan, V.
    [J]. World Academy of Science, Engineering and Technology, 2010, 72 : 149 - 155
  • [10] An Approach for Resource Selection and Allocation in Grid Based on Trust Management System
    Chen Chen
    Gu Li-ze
    Niu Xin-xin
    Yang Yi-xian
    [J]. 2009 FIRST INTERNATIONAL CONFERENCE ON FUTURE INFORMATION NETWORKS, 2009, : 232 - 236