This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of Replica Placement under Expiration-Based Consistency Management
November 2006 (vol. 17 no. 11)
pp. 1253-1263

Abstract—Expiration-based consistency management is widely used to keep replicated contents up-to-date in the Internet. The effectiveness of replication can be characterized by the communication costs of client accesses and consistency management. Both costs depend on the locations of the replicas. This paper investigates the problem of placing replicas in a network where replica consistency is managed by the expiration-based scheme. Our objective is to minimize the total cost of client accesses and consistency management. By analyzing the communication cost of recursive validations for cascaded replicas, we prove that in the optimal placement scheme, the nodes not assigned replicas induce a connected subgraph that includes the origin server. Our results are generic in that they apply to any request arrival patterns. Based on the analysis, an O(D){\hbox{-}}{\rm{time}} algorithm is proposed to compute the optimal placement of the replicas, where D is the sum of the number of descendants over all nodes in the routing tree.

[1] 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.
[2] I. Cidon, S. Kutten, and R. Soffer, “Optimal Allocation of Electronic Content,” Proc. IEEE INFOCOM '01, pp. 1773-1780, Apr. 2001.
[3] E. Cohen and H. Kaplan, “Refreshment Policies for Web Content Caches,” Proc. IEEE INFOCOM '01, pp. 1398-1406, Apr. 2001.
[4] E. Cohen and H. Kaplan, “Aging through Cascaded Caches: Performance Issues in the Distribution of Web Content,” Proc. ACM SIGCOMM '01, pp. 41-53, Aug. 2001.
[5] J. Dilley, “The Effect of Consistency on Cache Response Time,” IEEE Network, vol. 14, no. 3, pp. 24-28, May/June 2000.
[6] Y.T. Hou, J. Pan, B. Li, and S. Panwar, “On Expiration-Based Hierarchical Caching Systems,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 134-150, Jan. 2004.
[7] Y.T. Hou, J. Pan, B. Li, X. Tang, and S. Panwar, “Modeling and Analysis of an Expiration-Based Hierarchical Caching System,” Proc. IEEE GLOBECOM '02, pp. 2468-2472, Nov. 2002.
[8] C. Huang and T. Abdelzaher, “Bounded-Latency Content Distribution: Feasibility and Evaluation,” IEEE Trans. Computers, vol. 54, no. 11, pp. 1422-1437, Nov. 2005.
[9] S. Jamin, C. Jin, A.R. Kurc, D. Raz, and Y. Shavitt, “Constrained Mirror Placement on the Internet,” Proc. IEEE INFOCOM '01, pp.31-40, Apr. 2001.
[10] X. Jia, D. Li, H. Du, and J. Cao, “On Optimal Replication of Data Object at Hierarchical and Transparent Web Proxies,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 8, pp. 673-685, Aug. 2005.
[11] J. Jung, E. Sit, H. Balakrishnan, and R. Morris, “DNS Performance and the Effectiveness of Caching,” IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 589-603, Oct. 2002.
[12] 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.
[13] P. Krishnan, D. Raz, and Y. Shavitt, “The Cache Location Problem,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 568-582, Oct. 2000.
[14] 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.
[15] 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.
[16] M. Rabinovich and O. Spatscheck, Web Caching and Replication. Addison-Wesley, 2002.
[17] 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.
[18] 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.
[19] X. Tang and S. T. Chanson, “Coordinated En-Route Web Caching,” IEEE Trans. Computers, vol. 51, no. 6, pp. 595-607, June 2002.
[20] X. Tang and S.T. Chanson, “The Minimal Cost Distribution Tree Problem for Recursive Expiration-Based Consistency Management,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 3, pp. 214-227, Mar. 2004.
[21] X. Tang and S.T. Chanson, “Minimal Cost Replication of Dynamic Web Contents under Flat Update Delivery,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 5, pp. 431-439, May 2004.
[22] X. Tang and J. Xu, “QoS-Aware Replica Placement for Content Distribution,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 10, pp. 921-932, Oct. 2005.
[23] 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.
[24] 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.
[25] H. Yu, L. Breslau, and S. Shenker, “A Scalable Web Cache Consistency Architecture,” Proc. ACM SIGCOMM '99, pp. 163-174, Sept. 1999.

Index Terms:
Replication, consistency management, replica placement, time-to-live.
Citation:
Xueyan Tang, Samuel T. Chanson, "Analysis of Replica Placement under Expiration-Based Consistency Management," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 11, pp. 1253-1263, Nov. 2006, doi:10.1109/TPDS.2006.147
Usage of this product signifies your acceptance of the Terms of Use.