Distributed Resource Search in Self-organising Networks
Virtual Organisations (VO) have emerged as an important field of study in the area of Multi Agent Systems (MAS). A VO consists of a number of members that share preferences or goals with the aim of exploiting the available resources and providing better services than a single member would be able to. In this paper, VOs have been used as a way to cluster heterogeneous agents which have semantically close resources together. A VO-based resource search protocol has been developed with search message routing techniques that have been used to forward resource search messages among VOs instead of individual agents. A decision making component has been added to the agent’s body to facilitate the process of maintaining the VO′s functionality. Different scenarios have been studied to deal with situations which might affect the VO′s work-flow. The proposed solutions have been implemented and tested in a simulated environment. The simulation results have shown a significant improvement in the search results in terms of the quality of matching, the required time to find the requested resources and the success ratio of requests.
Unable to display preview. Download preview PDF.
- 1.Bernon, C., Chevrier, V., Hilaire, V., Marrow, P.: Applications of self-organising multi-agent systems: An initial framework for comparison. Informatica 30(1), 73–82 (2006)Google Scholar
- 3.Bordini, R.H., Wooldridge, M., Hübner, J.F.: Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology). John Wiley & Sons (2007)Google Scholar
- 4.Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004, pp. 271–272. ACM, New York (2004)Google Scholar
- 6.Dimakopoulos, V.V., Pitoura, E.: Performance analysis of distributed search in open agent systems. In: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, IPDPS 2003, p. 20.2. IEEE Computer Society, Washington, DC (2003)Google Scholar
- 8.Gjoka, M., Kurant, M., Markopoulou, A.: 2.5k-graphs: from sampling to generation. CoRR, abs/1208.3667 (2012)Google Scholar
- 9.Jacyno, M., Bullock, S., Payne, T., Luck, M.: Understanding decentralised control of resource allocation in a minimal multi-agent system. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2007, pp. 208:1–208:3. ACM, New York (2007)Google Scholar
- 10.Klyne, G., Carroll, J.J.: Resource description framework (rdf): Concepts and abstract syntax (February 2004)Google Scholar
- 11.Ljubešić, N., Boras, D., Bakarić, N., Njavro, J.: Comparing measures of semantic similarity. In: Lužar-Stiffler, V., Dobrić, V.H., Bekić, Z. (eds.) Proceedings of the 30th International Conference on Information Technology Interfaces, Zagreb2, pp. 675–682. SRCE University Computing Centre (2008)Google Scholar
- 14.Minar, N., Burkhart, R., Langton, C., Askenazi, M.: The swarm simulation system, a toolkit for building multi-agent simulations (1996)Google Scholar
- 17.Justin Samuel, S., Sasipraba, T.: Article: Trends and issues in integrating enterprises and other associated systems using web services. International Journal of Computer Applications 1(12), 17–20 (2010)Google Scholar
- 18.Tisue, S., Wilensky, U.: Netlogo: A simple environment for modeling complexity. In: International Conference on Complex Systems, pp. 16–21 (2004)Google Scholar
- 19.Yang, B., Garcia-molina, H.: Efficient search in peer-to-peer networks (2002)Google Scholar