Issue No. 10 - October (2006 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.145
The network planning problem of placing replicated servers with QoS constraints is considered. Each server site may consist of multiple server types with varying capacities and each site can be placed in any location among those belonging to a given set. Each client can be served by more than one location as long as the round-trip delay of data requests satisfies predetermined upper bounds. Our main focus is to minimize the cost of using the servers and utilizing the link bandwidth, while serving requests according to their delay constraint. This is an NP-hard problem. A pseudopolynomial and a polynomial algorithm that provide guaranteed approximation factors with respect to the optimal for the problem at hand are presented
client-server systems, computational complexity, network operating systems, optimisation, quality of service, telecommunication network planning,replicated server placement, QoS constraint, network planning, link bandwidth, NP-hard problem, pseudopolynomial algorithm,Network servers, Costs, Delay, Web server, Mirrors, Bandwidth, Polynomials, File systems, Upper bound, NP-hard problem,Algorithm design and analysis, constrained optimization, applications, distributed file systems, client/server.
"Replicated Server Placement with QoS Constraints", IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 1151-1162, October 2006, doi:10.1109/TPDS.2006.145