The Community for Technology Leaders
Frontiers of Information Technology (2012)
Islamabad, Pakistan Pakistan
Dec. 17, 2012 to Dec. 19, 2012
ISBN: 978-1-4673-4946-8
pp: 337-341
This paper studies and proposes heuristic algorithms to solve the problem of replicated server placement (RSP) with Quality of Service (QoS) constraints. Although there has been much work on RSP in multicast networks, in most of them a simplified replication model is used, therefore, their proposed solutions may not be applicable to real systems. In this paper, we use a more realistic, and generalized model for replica placement, which considers the latency restriction of the receivers (QoS), bandwidth, and storage constraints of the links and nodes. We present a mathematical formulation and propose four heuristics that are benched marked using BRITE network generator, and discuss the benefits and drawbacks of the static and dynamic approaches. The proposed heuristics are experimentally compared through simulations with respect to their performance and computational complexity under different QoS constraints. The simulation results show interesting characteristics of the studied heuristics.
Quality of service, Server replication, Multicast Network

H. S. Kia and S. U. Khan, "Server Replication in Multicast Networks," 2012 10th International Conference on Frontiers of Information Technology (FIT 2012)(FIT), Islamabad, 2012, pp. 337-341.
92 ms
(Ver 3.3 (11022016))