Optimal component configuration and component routing

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 componen...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on mobile computing 2002-10, Vol.1 (4), p.303-312
Main Authors: Avramopoulos, I.C., Anagnostou, M.E.
Format: Magazinearticle
Language:English
Subjects:
Allocations
Application software
Applied sciences
Computation
Computer networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Costs
Distributed computing
Equipments and installations
Exact sciences and technology
Integer programming
Linear programming
Mathematical model
Mathematical models
Mobile agents
Mobile communication
Mobile radiocommunication systems
Networks
Optimization
Radiocommunications
Routing
Routing (telecommunications)
Software
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Traffic control
Valuation and optimization of characteristics. Simulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1536-1233
1558-0660
DOI:10.1109/TMC.2002.1175543