Totem: a fault-tolerant multicast group communication system
Communications of the ACM
The Transis approach to high availability cluster communication
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
IEEE Transactions on Software Engineering
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Mobile Agent Coordination for Distributed Network Management
Journal of Network and Systems Management
MAgNET: Mobile Agents for Networked Electronic Trading
IEEE Transactions on Knowledge and Data Engineering
Supporting internet-scale multi-agent systems
Data & Knowledge Engineering - DKE 40
Using IP multicast to improve communication in large scale mobile agent systems
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
On broadcasting in heterogenous networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Mobile Networks and Applications
Double Token-Ring and Region-Tree Based Group Communication Mechanism for Mobile Agent
Agent Computing and Multi-Agent Systems
Double Token-Ring and Region-Tree Based Group Communication Mechanism for Mobile Agent
Agent Computing and Multi-Agent Systems
Hi-index | 0.00 |
Many multi-agent applications based on mobile agents require message propagation among group of agents. A fast and scalable group communication mechanism can considerably improve performance of these applications. Unfortunately, most of the existing approaches do not scale well and disseminate messages slowly when the number of agents grows. In this paper, we propose Sama, a new group communication mechanism, to speed up message delivery for a group of mobile agents on a heterogeneous internetwork. The main contribution of Sama is distribution and parallelization of message propagation in an efficient way to achieve scalability and high-speed of message delivery to group members. Sama uses message dispatcher objects (MDOs), which are stationary agents on each host, to propagate messages concurrently. The proposed mechanism is independent of agent locations and transparently delivers messages to the group using constant number of remote messages. It also transparently recovers from host failures. We also present a Hop-Ring protocol that considerably improves the performance of message dissemination in Sama. Our experimental results show that message propagation in Sama is significantly fast compared to the previously proposed methods.