A Resource Discovery Mechanism Integrating P2P and Grid

被引:1
作者
Ma, Shaohui [1 ]
Sun, Xinling [1 ]
Guo, Zuhua [1 ]
机构
[1] Henan Mech & Elect Engn Coll, Comp Sci & Technol Dept, Xinxiang, Henan, Peoples R China
来源
PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 7 | 2010年
关键词
P2P; Grid Resource Discovery; Ant Colony Algorithm; Chord; TF-IDF;
D O I
10.1109/ICCSIT.2010.5565157
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Aiming to overcome the shortcomings of Grid resource discovery, this paper presents a Grid resource discovery model with different layers, which adopts P2P (Peer-to-Peer) technology in Grid resource discovery mechanism. The model includes three layers based on three different peers: the Super peer-Agent, Super Peer and Ordinary peer. According to the model, this paper produces a novel Grid resource discovery algorithm, which adopts Keywords Mach algorithm based on Hash Table, employees TF-IDF to product resource keywords, locates and search s resource based on Consistent Hashing Chord, access lower latency and higher credibility peer by ant colony algorithm based on adaptively adjusting pheromone. It is testified by simulation implement that the algorithm can find the most suitable resources and improve resource discovery efficiency.
引用
收藏
页码:336 / 339
页数:4
相关论文
共 8 条
  • [1] [Anonymous], 2003, GRID COMPUTING MAKIN
  • [2] Cao JN, 2005, LECT NOTES COMPUT SC, V3795, P871
  • [3] Ant algorithm for grid scheduling problem
    Fidanova, S
    Durchova, M
    [J]. LARGE-SCALE SCIENTIFIC COMPUTING, 2006, 3743 : 405 - 412
  • [4] Joachims Thorsten., 1996, P 14 INT C MACHINE L, P78
  • [5] Stoica I., 2001, P 2001 ACM SIGCOMM C, V160, P149, DOI DOI 10.1145/383059.383071
  • [6] Talia D, 2005, GRID COMPUTING NEW F, V14, P1232
  • [7] A taxonomy of grid monitoring systems
    Zanikolas, S
    Sakellariou, R
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2005, 21 (01): : 163 - 188
  • [8] Zhang J, 2005, P2P 05 P 5 IEEE INT