dc.contributor.author |
Avramopoulos, IC |
en |
dc.contributor.author |
Anagnostou, ME |
en |
dc.date.accessioned |
2014-03-01T01:18:10Z |
|
dc.date.available |
2014-03-01T01:18:10Z |
|
dc.date.issued |
2002 |
en |
dc.identifier.issn |
15361233 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/14838 |
|
dc.subject |
Component allocation |
en |
dc.subject |
Component mobility |
en |
dc.subject |
Max flow - min cut |
en |
dc.subject |
Mixed binary integer programming |
en |
dc.subject |
Mobile agents |
en |
dc.subject |
Multlterminal cuts |
en |
dc.subject |
NP-hard problems |
en |
dc.subject |
Reconfiguration |
en |
dc.subject.other |
Component allocation |
en |
dc.subject.other |
Component mobility |
en |
dc.subject.other |
Mixed binary integer programming |
en |
dc.subject.other |
Mobile agents |
en |
dc.subject.other |
Multlterminal cuts |
en |
dc.subject.other |
Computational complexity |
en |
dc.subject.other |
Integer programming |
en |
dc.subject.other |
Mathematical models |
en |
dc.subject.other |
Problem solving |
en |
dc.subject.other |
Telecommunication traffic |
en |
dc.subject.other |
Routers |
en |
dc.title |
Optimal component configuration and component routing |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1109/TMC.2002.1175543 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/TMC.2002.1175543 |
en |
heal.publicationDate |
2002 |
en |
heal.abstract |
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. © 2002 IEEE. |
en |
heal.journalName |
IEEE Transactions on Mobile Computing |
en |
dc.identifier.doi |
10.1109/TMC.2002.1175543 |
en |
dc.identifier.volume |
1 |
en |
dc.identifier.issue |
4 |
en |
dc.identifier.spage |
303 |
en |
dc.identifier.epage |
312 |
en |