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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on mobile computing Jg. 1; H. 4; S. 303 - 312
Hauptverfasser: Avramopoulos, I.C., Anagnostou, M.E.
Format: Magazine Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.10.2002
IEEE Computer Society
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
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
Mobile radiocommunication
Wireless telecommunication
Resource allocation
Mobility
Mixed integer programming
Routing
Distributed system
Optimal allocation
NP hard problem
Mobile agent
Mathematical model
Mobile computing
Reconfiguration
ISSN:1536-1233, 1558-0660
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1536-1233
1558-0660
DOI:10.1109/TMC.2002.1175543