The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2008 vol.19)
pp: 1614-1627
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by the closest server in the tree. We introduce and study two new policies. In the first policy, all requests from a given client are still processed by the same server, but this server can be located anywhere in the path from the client to the root. In the second policy, the requests of a given client can be processed by multiple servers. One major contribution of this paper is to assess the impact of these new policies on the total replication cost. Another important goal is to assess the impact of server heterogeneity. In this paper, we establish several new complexity results, and provide several efficient polynomial heuristics for NP-complete instances of the problem. The absolute performance of these heuristics is assessed by comparison with the optimal solution provided by the formulation of the problem in terms of the solution of an integer linear program.
Parallelism and concurrency, Sequencing and scheduling, Reducibility and completeness
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert, "Replica Placement and Access Policies in Tree Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 12, pp. 1614-1627, December 2008, doi:10.1109/TPDS.2008.25
[1] K. Kalpakis, K. Dasgupta, and O. Wolfson, “Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 628-637, June 2001.
[2] I. Cidon, S. Kutten, and R. Soffer, “Optimal Allocation of Electronic Content,” Computer Networks, vol. 40, pp. 205-218, 2002.
[3] H. Wang, P. Liu, and J.-J. Wu, “A QoS-Aware Heuristic Algorithm for Replica Placement,” Proc. Seventh Int'l Conf. Grid Computing (GRID '06), pp. 96-103, 2006.
[4] P. Liu, Y.-F. Lin, and J.-J. Wu, “Optimal Placement of Replicas in Data Grid Environments with Locality Assurance,” Proc. Int'l Conf. Parallel and Distributed Systems (ICPADS), 2006.
[5] A. Benoit, V. Rehn, and Y. Robert, “Strategies for Replica Placement in Tree Networks,” Research Report 2006-30, LIP, ENS Lyon, Oct. 2006.
[6] A. Benoit, V. Rehn, and Y. Robert, “Impact of QoS on Replica Placement in Tree Networks,” Research Report 2006-48, LIP, ENS Lyon, Dec. 2006.
[7] M. Karlsson, C. Karamanolis, and M. Mahalingam, “A Framework for Evaluating Replica Placement Algorithms,” Research Report HPL-2002-219, HP Laboratories, 2002.
[8] A. Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, 1986.
[9] B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan, and S.M. Watt, Maple Reference Manual. Watcom Publications, 1988.
[10] GLPK: GNU Linear Programming Kit,, 2008.
[11] Source Code for the Heuristics, /, 2008.
[12] V. Rehn, “Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks,” Research Report 2007-10, LIP, ENS Lyon, Mar. 2007.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability—A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[14] T. Loukopoulos, I. Ahmad, and D. Papadias, “An Overview of Data Replication on the Internet,” Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN), 2002.
[15] C.-M. Wang, C.-C. Hsu, P. Liu, H.-M. Chen, and J.-J. Wu, “Optimizing Server Placement in Hierarchical Grid Environments,” Proc. First Int'l Conf. Grid and Pervasive Computing (GPC '07), pp. 1-11, 2007.
[16] L. Qiu, V.N. Padmanabhan, and G.M. Voelker, “On the Placement of Web Server Replicas,” Proc. INFOCOM '01, pp. 1587-1596, 2001.
[17] M. Karlsson and C. Karamanolis, “Choosing Replica Placement Heuristics for Wide-Area Systems,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 350-359, 2004.
[18] X. Tang and J. Xu, “QoS-Aware Replica Placement for Content Distribution,” IEEE Trans. Parallel Distributed Systems, vol. 16, no. 10, pp. 921-932, Oct. 2005.
[19] S.U. Khan and I. Ahmad, “RAMM: A Game Theoretical Replica Allocation and Management Mechanism,” Proc. Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN), 2005.
[20] O. Wolfson and A. Milo, “The Multicast Policy and Its Relationship to Replicated Data Placement,” ACM Trans. Database Systems, vol. 16, no. 1, pp. 181-205, 1991.
[21] K. Kalpakis, K. Dasgupta, and O. Wolfson, “Steiner-Optimal Data Replication in Tree Networks with Storage Costs,” Proc. Int'l Symp. Database Eng. and Applications (IDEAS '01), pp. 285-293, 2001.
[22] Y. Chen, R.H. Katz, and J.D. Kubiatowicz, “Dynamic Replica Placement for Scalable Content Delivery,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 306-318, Mar. 2002.
[23] G. Rodolakis, S. Siachalou, and L. Georgiadis, “Replicated Server Placement with QoS Constraints,” IEEE Trans. Parallel Distributed Systems, vol. 17, no. 10, pp. 1151-1162, Oct. 2006.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool