This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
June 2001 (vol. 12 no. 6)
pp. 628-637

Abstract—We consider the problem of placing copies of objects in a tree network in order to minimize the cost of servicing read and write requests to objects when the tree nodes have limited storage and the number of copies permitted is limited. The set of nodes that have a copy of the object is the residence set of the object. A node wishing to read the object will read the object from the closest node in the residence set. A node wishing to update the object will update the copy of the object at all the nodes in the residence set. Updates are propagated over a certain minimum spanning tree. The cost associated with a residence set equals the cost of servicing all the read and write requests and the storage costs for those copies. We describe a $O(n^3 p^2) \hbox {-} {\rm time}$ algorithm for finding an optimal residence set of size $p$ for an object in a tree with $n$ nodes, taking into consideration the read, write, and storage costs. Furthermore, we describe a $O(n^3 p^2 \Lambda_{\max}^2) \hbox {-} {\rm time}$ algorithm for finding a minimum cost normal p-residence set for an object in a tree, this time also taking into account the load imposed by the nodes of the tree on the nodes in a residence set and their capacity constraints, where $\Lambda_{\rm max}$ is an upper bound on the capacity of each node of the tree.

[1] O. Wolfson and A. Milo, "The Multicast Policy and Its Relationship to Replicated Data Placement," ACM Trans. Database Systems, vol. 16, no. 1, 1991.
[2] L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem," ACM Computing Surveys, vol. 14, no. 2, 1982.
[3] M.L. Fisher and D.S. Hochbaum, “Database Location in Computer Networks,” J. ACM, vol. 27, no. 4, pp. 718-735, 1982.
[4] S. Guha and S. Khuller, “Greedy Strikes Back: Improved Facility Location Algorithms,” Proc. Nineth ACM-SIAM Symp. Discrete Algorithms, 1998.
[5] D.S. Hochbaum, “Heuristics for the Fixed Cost Median Problem,” Math. Programming, pp. 148-162, 1982.
[6] D.B. Shmoys, E. Tardos, and K. Aardal, “Approximation Algorithms for Facility Location Problems (Extended Abstract),” Proc. 29th ACM STOC, pp. 265-274, 1997.
[7] S. Arora, P. Raghavan, and S. Rao, “Approximation Schemes for Euclidean$k \hbox {-} {\rm Medians}$and Related Problems,” Proc. 30th ACM STOC, pp. 106-113, 1998.
[8] O. Kariv and S.L. Hakimi, “An Algorithmic Approach to Location Problems. ii: The$p \hbox {-} {\rm Medians}$,” SIAM J. Applied Math., vol. 37, no. 3, pp. 539-560, 1979.
[9] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.

Index Terms:
Data replication, multicasting, facility location, p-medians, file allocation, tree networks.
Citation:
Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson, "Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 6, pp. 628-637, June 2001, doi:10.1109/71.932716
Usage of this product signifies your acceptance of the Terms of Use.