Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
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.
How to cite this article:
Lung Pin Chen and Hsin Ta Chiao. On Balanced Deployment of Dynamic Objects in Distributed Environments.
DOI: https://doi.org/10.36478/jeasci.2018.38.42
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2018.38.42