Reliable directory service and message delivery for large-scale mobile agent systems

Authors:
Jinho Ahn
Affiliations:
College of Natural Sciences, Kyonggi University, Department of Computer Science, Yiuidong, Yeongtonggu, Suwonsi Gyeonggido, Republic of Korea
Venue:
TELE-INFO'07 Proceedings of the 6th WSEAS Int. Conference on Telecommunications and Informatics
Year:
2007

Citing 9
Cited 0

Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Distributed directory service and message routing for mobile agents

Science of Computer Programming
A fault-tolerant directory service for mobile agents based on forwarding pointers

Proceedings of the 2002 ACM symposium on Applied computing
Programming and Deploying Java Mobile Agents Aglets

Programming and Deploying Java Mobile Agents Aglets
Current Approaches for Solving Over-Constrained Problems

Constraints
The Ubiquitous Provisioning of Internet Services to Portable Devices

IEEE Pervasive Computing
Mailbox-Based Scheme for Designing Mobile Agent Communication Protocols

Computer
Location Transparent Routing in Mobile Agent Systems - Merging name Lookups with Routing

FTDCS '99 Proceedings of the 7th IEEE Workshop on Future Trends of Distributed Computing Systems
Communication and Tracking Infrastructure of a Mobile Agent System

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a reliable directory service and message delivery mechanism for large-scale mobile agent systems to address both agent mobility and directory service node failures. The mechanism enables each mobile agent to keep its forwarding pointer only on the small number of its visiting nodes in an autonomous manner. As this desirable feature has every mobile agent's migration route be very considerably shortened, the time for forwarding each message to the agent becomes much smaller. Also, this feature causes each node to maintain much fewer forwarding pointers of mobile agents on its storage than in the traditional approach. Moreover, the mechanism allows each movement path of a mobile agent to be replicated in an effective way to preserve scalability of our proposed mechanism. This replication may require a little more agent location updating costs, but much more accelerate delivery of each message to the corresponding mobile agent.