@article{MAKHILLJEAS201813115393,
    title = {On Balanced Deployment of Dynamic Objects in Distributed Environments},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {13},
    number = {1},
    pages = {38-42},
    year = {2018},
    issn = {1816-949x},
    doi = {jeasci.2018.38.42},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2018.38.42},
    author = {Lung and},
    keywords = {Typical modern internet applications rely on the collaboration of software components deploying,rich internet application,graph partition,deployment,polynomial,algorithm},
    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.}
    }