Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Qasim, Awaisa; * | Ghouri, Arslana | Munawar, Adeelb; c
Affiliations: [a] Department of Computer Science, Government College University Lahore, Lahore, Pakistan | [b] Department of Computer Science, Lahore Garrison University, Lahore, Pakistan | [c] Sirindhorn International Institute of Technology, Thammasat University, Bangkok, Thailand
Correspondence: [*] Corresponding author: Awais Qasim, Department of Computer Science, GC University, Lahore, Pakistan. E-mail: awais@gcu.edu.pk.
Abstract: The redundancy of the data is an active research topic. While an agent works in a multi-agent system, the number of messages between them increases. This is due to the fact that the functionalities data depends on other agents in terms of functional requirements. Typically, only one agent in a multi-agent system is responsible for accessing a database instead of replicating the database on each agent. A database is stored on multiple agents rather than a single agent to avoid a single point of failure. In this approach, the system has a higher load because one agent is responsible for all agent queries and must send duplicate messages to multiple agents, resulting in redundant data. In this research, we present Multi-Agent System for Commodity Data (MASCD) framework, the multi-agent system based communication using the distributed hash system, to reduce data redundancy in multi-agent system communication. Our anticipated method demonstrated how we divided the database names and efficiently distributed data to each agent. The database splitting is based on manufacturer names or product names. We utilize a table based on prime numbers. Through the hash function, we ascertain the index of the agent granted access to the relevant data. Each agent is accountable for its data. We use a Distributed Hash Table for efficient querying that stores data as key-value pairs. Each agent maintains a Finger Table containing the next and previous nodes for agent communication purposes. Using FIPA messages, we demonstrated how an agent could interact optimally. In conclusion, we illustrate the application of the proposed approach through a case study of mobile phones and university information systems.
Keywords: Multi-agent systems, distributed hash table, agent communication, FIPA communication
DOI: 10.3233/MGS-230089
Journal: Multiagent and Grid Systems, vol. 20, no. 1, pp. 69-88, 2024
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl