Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
The limited performance benefits of migrating active processes for load sharing
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Dynamic file migration in distributed computer systems
Communications of the ACM
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Mobile wireless computing: challenges in data management
Communications of the ACM
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Software Engineering
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Integrating Mobile Agents into the Mobile Middleware
MA '98 Proceedings of the Second International Workshop on Mobile Agents
Optimal Distribution of Service Components
IS&N '98 Proceedings of the 5th International Conference on Intelligence and Services in Networks: Technology for Ubiquitous Telecom Services
An Information Model for Nomadic Environments
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
The Case for Resilient Overlay Networks
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
Network awareness and mobile agent systems
IEEE Communications Magazine
Future Generation Computer Systems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
| Hi-index | 0.00 |
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.