A Swarm Algorithm for a Self-Structured P2P Information System

被引:14
作者
Forestiero, Agostino [1 ]
Mastroianni, Carlo [1 ]
机构
[1] CNR, Inst High Performance Comp & Networks, I-87036 Arcavacata Di Rende, CS, Italy
关键词
Ant algorithms; grid; information dissemination; information system; peer-to-peer (P2P); resource discovery;
D O I
10.1109/TEVC.2008.2011478
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper introduces Antares, which is a bio-inspired algorithm for the construction of a decentralized and self-organized P2P information system in computational grids. This algorithm exploits the properties of ant systems, in which a number of entities/agents perform simple operations at the local level but together engender an advanced form of "swarm intelligence" at the global level. Here, the work of ant-inspired agents is tailored to the controlled replication and relocation of "descriptors," that is, documents that contain metadata information about grid resources. Agents travel the grid through P2P interconnections, and replicate and spatially sort descriptors so as to accumulate those represented by identical or similar indexes into neighbor grid hosts. The resulting information system is here referred to as self-structured, because it exploits the self-organizing characteristics of ant-inspired agents, and the association of descriptors with hosts is not predetermined but adapts to the varying conditions of the grid. This self-structured organization combines the benefits of both unstructured and structured P2P information systems. Indeed, being basically unstructured, Antares is easy to maintain in a dynamic grid, in which joins and departs of hosts can be frequent events. On the other hand, the aggregation and spatial ordering of descriptors can improve the rapidity and effectiveness of discovery operations, which is a beneficial feature typical of structured systems. Performance analysis proves that ant operations allow the information system to be efficiently reorganized, thus improving the efficacy of both simple and range queries.
引用
收藏
页码:681 / 694
页数:14
相关论文
共 41 条
  • [1] Fault tolerant high performance Information Services for dynamic collections of Grid and Web services
    Aktas, Mehmet S.
    Fox, Geoffrey C.
    Pierce, Marlon
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2007, 23 (03): : 317 - 337
  • [2] A survey of peer-to-peer content distribution technologies
    Androutsellis-Theotokis, S
    Spinellis, D
    [J]. ACM COMPUTING SURVEYS, 2004, 36 (04) : 335 - 371
  • [3] ANDRZEJAK A, P 2 IEEE INT C PEER, P33
  • [4] [Anonymous], P 22 INT C DISTR COM
  • [5] [Anonymous], 1999, Swarm Intelligence
  • [6] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [7] Cai M., 2004, J GRID COMPUT, V2, P3, DOI DOI 10.1007/S10723-004-1184-Y
  • [8] The organic grid: Self-organizing computation on a peer-to-peer network
    Chakravarti, AJ
    Baumgartner, G
    Lauria, M
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2005, 35 (03): : 373 - 384
  • [9] Cheema AS, 2005, 2005 6TH INTERNATIONAL WORKSHOP ON GRID COMPUTING (GRID), P179
  • [10] COHEN E, P SPEC INT GROUP DAT, P177