The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Code mobility and mobile agents have received a lot of attention as a paradigm based on which distributed applications can be built. There has been little work however on the mathematical modeling of component mobility. In this direction, we present and analyze three optimization models for component mobility. We are seeking the optimal allocation of components to network nodes and the optimal component routes that will minimize the network traffic that is incurred in the course of component communication. Optimal solutions are found either through a Mixed Binary Integer Programming formulation or by employing max flow computations. Complexity results are also reported.</p>
Mobile agents, component allocation, component mobility, reconfiguration, multiterminal cuts, max flow—min cut, mixed binary integer programming, NP-hard problems.

I. C. Avramopoulos and M. E. Anagnostou, "Optimal Component Configuration and Component Routing," in IEEE Transactions on Mobile Computing, vol. 1, no. , pp. 303-312, 2002.
85 ms
(Ver 3.3 (11022016))