Constraint solving-based itineraries for mobile agents

Abstract

Itineraries of mobile agents among multiple nodes seriously affect the availability and performance of mobile agent-based processing. Such itineraries tend to be complicated, for example, the order of the nodes that agents should visit may be alternative or commutable. This paper proposes a framework for specifying constraints on the itineraries of agents and solving the itineraries that can satisfy the constraints. The contribution of this framework is to automatically generate the itineraries of mobile agents among computers from application-specific constraints. A prototype implementation of this framework and its application were built on a Java-based mobile agent system.