Analysis of Replica Placement under Expiration-Based Consistency Management

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)-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]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[2]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  J. Dilley The effect of consistency on cache response time , 2000 .

[4]  Scott Shenker,et al.  A scalable Web cache consistency architecture , 1999, SIGCOMM '99.

[5]  Xueyan Tang,et al.  Coordinated En-Route Web Caching , 2002, IEEE Trans. Computers.

[6]  Pablo Rodriguez,et al.  SPREAD: Scalable platform for reliable and efficient automated distribution , 2000, Comput. Networks.

[7]  Xueyan Tang,et al.  Minimal cost replication of dynamic Web contents under flat update delivery , 2004, IEEE Transactions on Parallel and Distributed Systems.

[8]  Xueyan Tang,et al.  The minimal cost distribution tree problem for recursive expiration-based consistency management , 2004, IEEE Transactions on Parallel and Distributed Systems.

[9]  Tarek F. Abdelzaher,et al.  Bounded-latency content distribution feasibility and evaluation , 2005, IEEE Transactions on Computers.

[10]  Jianliang Xu,et al.  Placement problems for transparent data replication proxy services , 2002, IEEE J. Sel. Areas Commun..

[11]  Shay Kutten,et al.  Optimal allocation of electronic content , 2002, Comput. Networks.

[12]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Deying Li,et al.  On optimal replication of data object at hierarchical and transparent Web proxies , 2005, IEEE Transactions on Parallel and Distributed Systems.

[14]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[15]  Peter B. Danzig,et al.  A Hierarchical Internet Object Cache , 1996, USENIX ATC.

[16]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Ouri Wolfson,et al.  The multicast policy and its relationship to replicated data placement , 1991, TODS.

[18]  Jianping Pan,et al.  On expiration-based hierarchical caching systems , 2004, IEEE Journal on Selected Areas in Communications.

[19]  Jianping Pan,et al.  Modeling and analysis of an expiration-based hierarchical caching system , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[20]  Magnus Karlsson,et al.  Choosing replica placement heuristics for wide-area systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[21]  Edith Cohen,et al.  Aging through cascaded caches: performance issues in the distribution of web content , 2001, SIGCOMM 2001.

[22]  Robert Tappan Morris,et al.  DNS performance and the effectiveness of caching , 2001, IMW '01.

[23]  Pablo Rodriguez,et al.  Analysis of web caching architectures: hierarchical and distributed caching , 2001, TNET.

[24]  Edith Cohen,et al.  Refreshment policies for Web content caches , 2002, Comput. Networks.