ARMAP e ARDIP
Ant-based Replication and MApping Protocol
Ant-based Resource DIscovery Protocol
In 2006 July 26th I got my degree in Computer Engineering, applications on networks, at Università della Calabria. My graduation thesys is Definizione di un protocollo di distribuzione e scoperta di risorse su Griglia basato su un sistema ad agenti ( Definition of a resource distribution and discovery protocol on Grid based upon agents ). The thesys arises from the apprenticeship developed at Institute of High Performance Computing and Networking (ICAR - Istituto di Calcolo e Reti ad Alte Prestazioni).
Our work is based upon distributing in clusters the shared resources of a network, through copying eand moving them. Thus, a resource request of a specific class will get many results if it reaches one of the cluster specialized in that class.
After the apprenticeship, I continued, during my further studies, tu support ICAR team, becoming co-author of Discovering Categorized Resources in Grids by Self-Organizing Agents, presented during SOAS: International Conference on Self-Organization and Autonomous Systems in Computing and Communications, which took place in 2006 18th - 20th September at Erfurt, Germany. We are proud, moreover, to have our work published on the scientific review International Transactions on Systems Science and Applications (ITSSA).
In March 2007, a version of the simulator I worked on has been released online. It's possible to launch a simulation and observe the resource organization on the simulated network.
Abstract
Our brief abstract by Discovering Categorized Resources in Grids by Self-Organizing Agents is available here
The scientific review
The review International Transactions on Systems Science and Applications is edited by Xiaglow Institute
My thesys
You can download the introduction and the first chapter of my thesys (pdf) in Italian language.
ARMAP, briefly
It's up to this protocol to distribute resources on the network. The ditribution must accumulate similar resources in particular network regions.
ARDIP, briefly
It's up to this protocol to discover resources on the network. The search is based upon the technique of random walk, and next it's driven towards the nearest network specialized region.
Grid Computing, briefly
The grid is somehow similar to a peer-to-peer network. The main difference is the resource shared by the peers: not files but computing time. An idle pc can share part of its computing time with another one in the Grid, in order to increase the total network computing power.
A grid example is PlayStation 3. These consoles can share their computing power for the project Folding@home.
In a not-so-far future, personal computer will be only a set of I/O interfaces (screen, keyboard, mouse), while the computations will be made in remote. Computations will be a service, distributed as water or energy today.
