This paper proposes a framework for building a reusable mobile agent from two kinds of components: an itinerary component and an application-specific logic component. Both components are implemented as mobile agents. The former is a carrier of the latter over particular networks and the latter defines management tasks performed at each host independently of the network. This framework also provides a mechanism for matchmaking the two mobile agent-based components. Since the mechanism is formulated based on a process algebra approach, it can strictly select a suitable itinerary component to perform management tasks at the hosts that the tasks want to visit over the networks. A prototype implementation of this framework and its application were built on a Java-based mobile agent system. We summarize the lessons learned while formalizing and implementing the approach and we compare it to related work.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ichiro SATOH, "Itinerant Agents for Network Management" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 10, pp. 2865-2873, October 2003, doi: .
Abstract: This paper proposes a framework for building a reusable mobile agent from two kinds of components: an itinerary component and an application-specific logic component. Both components are implemented as mobile agents. The former is a carrier of the latter over particular networks and the latter defines management tasks performed at each host independently of the network. This framework also provides a mechanism for matchmaking the two mobile agent-based components. Since the mechanism is formulated based on a process algebra approach, it can strictly select a suitable itinerary component to perform management tasks at the hosts that the tasks want to visit over the networks. A prototype implementation of this framework and its application were built on a Java-based mobile agent system. We summarize the lessons learned while formalizing and implementing the approach and we compare it to related work.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_10_2865/_p
Copy
@ARTICLE{e86-b_10_2865,
author={Ichiro SATOH, },
journal={IEICE TRANSACTIONS on Communications},
title={Itinerant Agents for Network Management},
year={2003},
volume={E86-B},
number={10},
pages={2865-2873},
abstract={This paper proposes a framework for building a reusable mobile agent from two kinds of components: an itinerary component and an application-specific logic component. Both components are implemented as mobile agents. The former is a carrier of the latter over particular networks and the latter defines management tasks performed at each host independently of the network. This framework also provides a mechanism for matchmaking the two mobile agent-based components. Since the mechanism is formulated based on a process algebra approach, it can strictly select a suitable itinerary component to perform management tasks at the hosts that the tasks want to visit over the networks. A prototype implementation of this framework and its application were built on a Java-based mobile agent system. We summarize the lessons learned while formalizing and implementing the approach and we compare it to related work.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Itinerant Agents for Network Management
T2 - IEICE TRANSACTIONS on Communications
SP - 2865
EP - 2873
AU - Ichiro SATOH
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2003
AB - This paper proposes a framework for building a reusable mobile agent from two kinds of components: an itinerary component and an application-specific logic component. Both components are implemented as mobile agents. The former is a carrier of the latter over particular networks and the latter defines management tasks performed at each host independently of the network. This framework also provides a mechanism for matchmaking the two mobile agent-based components. Since the mechanism is formulated based on a process algebra approach, it can strictly select a suitable itinerary component to perform management tasks at the hosts that the tasks want to visit over the networks. A prototype implementation of this framework and its application were built on a Java-based mobile agent system. We summarize the lessons learned while formalizing and implementing the approach and we compare it to related work.
ER -