This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
QoS-Aware Replica Placement for Content Distribution
October 2005 (vol. 16 no. 10)
pp. 921-932

Abstract—The rapid growth of new information services and business-oriented applications entails the consideration of quality of service (QoS) in content distribution. This paper investigates the QoS-aware replica placement problems for responsiveness QoS requirements. We consider two classes of service models: replica-aware services and replica-blind services. In replica-aware services, the servers are aware of the locations of replicas and can therefore optimize request routing to improve responsiveness. We show that the QoS-aware placement problem for replica-aware services is NP-complete. Several heuristic algorithms for fast computation of good solutions are proposed and experimentally evaluated. In replica-blind services, the servers are not aware of the locations of replicas or even their existence. As a result, each replica only serves the requests flowing through it under some given routing strategy. We show that there exist polynomial optimal solutions to the QoS-aware placement problem for replica-blind services. Efficient algorithms are proposed to compute the optimal locations of replicas under different cost models.

[1] GT Internetwork Topology Models (GT-ITM), http://www.cc. gatech.edu/projectsgtitm/, 2000.
[2] K.L. Calvert, M.B. Doar, and E.W. Zegura, “Modeling Internet Topology,” IEEE Comm. Magazine, vol. 35, no. 6, pp. 160-163, June 1997.
[3] V. Cardellini, E. Casalicchio, M. Colajanni, and P.S. Yu, “The State of the Art in Locally Distributed Web-Server Systems,” ACM Computing Surveys, vol. 34, no. 2, pp. 263-311, June 2002.
[4] A. Chankhunthod, P.B. Danzig, C. Neerdaels, M.F. Schwartz, and K.J. Worrell, “A Hierarchical Internet Object Cache,” Proc. USENIX Ann. Technical Conf., pp. 153-163, Jan. 1996.
[5] I. Cidon, S. Kutten, and R. Soffer, “Optimal Allocation of Electronic Content,” Proc. IEEE INFOCOM '01, pp. 1773-1780, Apr. 2001.
[6] M. Colajanni, P.S. Yu, and V. Cardellini, “Scalable Web-Server Systems: Architectures, Models and Load Balancing Algorithms,” Tutorial Presented at ACM SIGMETRICS '00, June 2000.
[7] E. Cronin, S. Jamin, C. Jin, A.R. Kurc, D. Raz, and Y. Shavitt, “Constrained Mirror Placement on the Internet,” IEEE J. Selected Areas in Comm., vol. 20, no. 7, pp. 1369-1382, Sept. 2002.
[8] L.W. Dowdy and D.V. Foster, “Comparative Models of the File Assignment Problem,” ACM Computing Surveys, vol. 14, no. 2, pp. 287-313, June 1982.
[9] M.L. Fisher and D.S. Hochbaum, “Database Location in Computer Networks,” J. ACM, vol. 27, no. 4, pp. 718-735, Oct. 1980.
[10] Y. Chu, S.G. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM SIGMETRICS '00, pp. 1-12, June 2000.
[11] X. Jia, D. Li, X. Hu, W. Wu, and D. Du, “Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet,” The Computer J., vol. 46, no. 4, pp. 378-390, July 2003.
[12] 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.
[13] M. Karlsson and C. Karamanolis, “Choosing Replica Placement Heuristics for Wide-Area Systems,” Proc. 24th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), pp. 350-359, Mar. 2004.
[14] P. Krishnan, D. Raz, and Y. Shavitt, “The Cache Location Problem,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 568-582, Oct. 2000.
[15] B. Li, M.J. Golin, G.F. Italiano, X. Deng, and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet,” Proc. IEEE INFOCOM '99, pp. 1282-1290, Mar. 1999.
[16] D.A. Menasce, “QoS Issues in Web Services,” IEEE Internet Computing, vol. 6, no. 6, pp. 72-75, Nov./Dec. 2002.
[17] L. Qiu, V.N. Padmanabhan, and G.M. Voelker, “On the Placement of Web Server Replicas,” Proc. IEEE INFOCOM '01, pp. 1587-1596, Apr. 2001.
[18] M. Rabinovich, J. Chase, and S. Gadde, “Not all Hits are Created Equal: Cooperative Proxy Caching over a Wide Area Network,” Computer Networks and ISDN Systems, vol. 30, nos. 22-23, pp. 2253-2259, Nov. 1998.
[19] M. Rabinovich and O. Spatscheck, Web Caching and Replication. Addison-Wesley, 2002.
[20] P. Rodriguez and S. Sibal, “SPREAD: Scalable Platform for Reliable and Efficient Automated Distribution,” Computer Networks, vol. 33, nos. 1-6, pp. 33-49, June 2000.
[21] P. Rodriguez, C. Spanner, and E.W. Biersack, “Analysis of Web Caching Architectures: Hierarchical and Distributed Caching,” IEEE/ACM Trans. Networking, vol. 9, no. 4, pp. 404-418, Aug. 2001.
[22] X. Tang and S.T. Chanson, “Coordinated En-Route Web Caching,” IEEE Trans. Computers, vol. 51, no. 6, pp. 595-607, June 2002.
[23] X. Tang and J. Xu, “On Replica Placement for QoS-Aware Content Distribution,” Proc. IEEE INFOCOM '04, Mar. 2004.
[24] V.V. Vazirani, Approximation Algorithms. Springer-Verlag, 2001.
[25] B.M. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
[26] 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, Mar. 1991.
[27] J. Xu, B. Li, and D.L. Lee, “Placement Problems for Transparent Data Replication Proxy Services,” IEEE J. Selected Areas in Comm., vol. 20, no. 7, pp. 1383-1398, Sept. 2002.
[28] B. Zhang, S. Jamin, and L. Zhang, “Host Multicast: A Framework for Delivering Multicast to End Users,” Proc. IEEE INFOCOM '02, pp. 1366-1375, June 2002.
[29] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.

Index Terms:
Content distribution, replication, placement, quality of service, dynamic programming, NP-complete.
Citation:
Xueyan Tang, Jianliang Xu, "QoS-Aware Replica Placement for Content Distribution," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 10, pp. 921-932, Oct. 2005, doi:10.1109/TPDS.2005.126
Usage of this product signifies your acceptance of the Terms of Use.