This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Replica Placement under TTL-Based Consistency
March 2007 (vol. 18 no. 3)
pp. 351-363

Abstract—Geographically replicating popular objects in the Internet speeds up content distribution at the cost of keeping the replicas consistent and up-to-date. The overall effectiveness of replication can be measured by the total communication cost consisting of client accesses and consistency management, both of which depend on the locations of the replicas. This paper investigates the problem of placing replicas under the widely used TTL-based consistency scheme. A polynomial-time algorithm is proposed to compute the optimal placement of a given number of replicas in a network. The new replica placement scheme is compared, using real Internet topologies and Web traces, against two existing approaches which do not consider consistency management or assume invalidation-based consistency scheme. The factors affecting their performance are identified and discussed.

Index Terms:
Replication, replica placement, TTL-based consistency, data consistency.
Citation:
Xueyan Tang, Huicheng Chi, Samuel T. Chanson, "Optimal Replica Placement under TTL-Based Consistency," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 3, pp. 351-363, March 2007, doi:10.1109/TPDS.2007.47
Usage of this product signifies your acceptance of the Terms of Use.