TY  - JOUR
T1  - On Balanced Deployment of Dynamic Objects in Distributed Environments
AU - Pin Chen, Lung AU - Ta Chiao, Hsin 
JO  - Journal of Engineering and Applied Sciences
VL  - 13
IS  - 1
SP  - 38
EP  - 42
PY  - 2018
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2018.38.42
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2018.38.42
KW  - Typical modern internet applications rely on the collaboration of software components deploying
KW  -rich internet application
KW  -graph partition
KW  -deployment
KW  -polynomial
KW  -algorithm
AB  - Typical modern internet applications rely on the collaboration of software components deploying
in network hosts to deliver application services. As the previous literatures considered the total deploying cost,
e.g., communication and computation costs of the service objects this researcher takes into account that how
evenly the objects are distributed over the network. We demonstrate that evenly distributing the application
components over the network can prevent bottlenecks and therefore, improves both of fault tolerance and
system response time. In this study, we transform the minimum cost balanced deployment problem to the well
known minimum cut problem and develop an efficient polynomial time deployment algorithm.
ER  -