Article

Approximation algorithms for data placement in arbitrary networks

Authors:

Rajmohan RajaramanAuthors Info & Claims

SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Pages 661 - 670

Published: 09 January 2001 Publication History

Abstract

We study approximation algorithms for placing replicated data in arbitrary networks. Consider a network of nodes with individual storage capacities and a metric communication cost function, in which each node periodically issues a request for an object drawn from a collection of uniform-length objects. We consider the problem of placing copies of the objects among the nodes such that the average access cost is minimized. Our main result is a polynomial-time constant-factor approximation algorithm for this placement problem. Our algorithm is based on a careful rounding of a linear programming relaxation of the problem. We also show that the data placement problem is MAXSNP-hard.

We extend our approximation result to a generalization of the data placement problem that models additional costs such as the cost of realizing the placement. We also show that when object lengths are non-uniform, a constant-factor approximation is achievable if the capacity at each node in the approximate solution is allowed to exceed that in the optimal solution by the length of the largest object.

References

[1]

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.]]

Digital Library

[2]

T. E. Anderson, M. D. Dahlin, J. N. Neefe, D. A. Patterson, D. S. Rosselli, and R. Y. Wang. Serverless network file systems. In Proceedings of the 15th Symposium on Operating Systems Principles, pages 109-126, 1995.]]

Digital Library

[3]

B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In Proceedings of the P5th Annual ACM Symposium on Theory of Computing, pages 164-173, May 1993.]]

Digital Library

[4]

B. Awerbuch, Y. Bartal, and A. Fiat, Heat & Dump: Competitive distributed paging. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22-31, November 1993.]]

[5]

B. Awerbuch, Y. Bartal, and A. Fiat. Distributed paging for general networks. Journal of Algorithms, 28:67-104, 1998.]]

Digital Library

[6]

B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 37:1021-1058, 1995.]]

Digital Library

[7]

Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. Journal of Computer and Systems Sciences, 51:341-358, 1995.]]

Digital Library

[8]

M. A. Blaze. Caching in large-scale distributed file systems. Technical Report TR-397-92, Department of Computer Science, Princeton University, January 1993. PhD Thesis.]]

Digital Library

[9]

C.M. Bowman, P. B. Danzig, D. R. Hardy, U. Manber, and M. F. Schwartz. The Harvest information discovery and access system. Computer Networks and ISDN Systems, 28:119-125, 1995.]]

Digital Library

[10]

A. Chankhunthod, P. Danzig, C. Neerdaels, M. Schwartz, and K. Worrell. A hierarchical Internet object cache. In Proceedings of the USENIX 1996 Technical Conference, pages 22-26, January 1996.]]

Digital Library

[11]

M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the $Oth Annual IEEE Symposium on Foundations of Computer Science, pages 378-388, October 1999.]]

Digital Library

[12]

M. Charikar, S. Guha, D. Shmoys, and E. Tardos. A constantfactor approximation algorithm for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 1-10, May 1999.]]

Digital Library

[13]

G. Cornuejols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem. In Discrete Location Theory, pages 119-171. Wiley, New York, 1990.]]

[14]

M. D. Dahlin, R. Y. Wang, T. E. Anderson, and D. A. Patterson. Cooperative caching: Using remote client memory to improve file system performance. In Proceedings of the First Symposium on Operating Systems Design and Implementation, pages 267-280, November 1994.]]

Digital Library

[15]

D. Dowdy and D. Foster. Comparative models of the file assignment problem. ACM Computing Surveys, 14:287-313, 1982.]]

Digital Library

[16]

L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: A scalable wide-area Web cache sharing protocol. In Proceedings of the 1998 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 254-265, August 1998.]]

Digital Library

[17]

S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. In Proceedings of the 9th Annual ACM- SIAM Symposium on Discrete Algorithms, pages 649-657, January 1998.]]

Digital Library

[18]

J. S. Gwertzman and M. Seltzer. The case for geographical pushcaching. In Proceedings of the 5th Workshop on Hot Topics in Operating Systems, pages 51-57, May 1995.]]

Digital Library

[19]

A. Heddaya and S. Mirdad. WebWave: Globally load balanced fully distributed caching of hot published documents. In Proceedings of the 17th International Conference on Distributed Computing Systems, pages 160-168, May 1997.]]

Digital Library

[20]

K. Jain and V. Vazlrani. Primal-dual approximation algorithms for metric facility location and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 1-10, October 1999.]]

Digital Library

[21]

D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the P9th Annual ACM Symposium on Theory of Computing, pages 654-663, May 1997.]]

Digital Library

[22]

M. Korupolu and M. Dahlin. Coordinated placement and replacement for large-scale distributed caches. In Proceedings of the IEEE Workshop on Internet Applications, pages 62-71, July 1999.]]

Digital Library

[23]

M. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. In Proceedings of the lOth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 586-595, January 1999.]]

Digital Library

[24]

A. Left, J. L. Wolf, and P. S. Yu. Replication algorithms in a remote caching architecture. IEEE Transactions on Parallel and Distributed Systems, 4:1185-1204, 1993.]]

Digital Library

[25]

C. Lund, N. Reingold, J. Westbrook, and D. Yah. On-line distributed data management. In J. van Leeuwen, editor, Proceedings of the Pnd Annual European Symposium on Algorithms, Lecture Notes in Computer Science, volume 855, pages 202-214. Springer-Verlag, 1994.]]

Digital Library

[26]

B. M. Maggs, F. Meyer auf der Heide, B. VScking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 284- 293, October 1997.]]

Digital Library

[27]

R. Mettu and C. G. Plaxton. The online median problem. In Proceedings of the 41s t Annual IEEE Symposium on Foundations of Computer Science, November 2000. To appear.]]

Digital Library

[28]

Meyer auf der Heide, F. and VScking, B. and Westermann, M. Caching in networks. In Proceedings of the l l t h Annual ACM-SIAM Symposium on Discrete Algorithms, pages 430- 439, January 2000.]]

Digital Library

[29]

C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-280, 1999.]]

[30]

M. Rabinovich, I. Rabinovich, R. Rajaraman, and A. Aggarwal. A dynamic object replication and migration protocol for an Internet hosting service. In Proceedings of the IEEE International Conference on Distributed Computing Systems, pages 101-113, May 1999.]]

Digital Library

[31]

D.B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461-474, 1993.]]

[32]

D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proceedings of the Pgth Annual ACM Symposium on Theory of Computing, pages 265-274, May 1997.]]

Digital Library

[33]

R. Tewari, M. Dahlin, H. M. Vin, and J. S. Kay. Design considerations for distributed caching on the Internet. In Proceedings of the 19th International Conference on Distributed Computing Systems, pages 273-284, May 1999.]]

Digital Library

[34]

M. van Steen, F. J. Hauck, and A. S. Tanenbaum. A model for worldwide tracking of distributed objects. In Proceedings of the 1996 Conference on Telecommunications Information Networking Architecture (TINA 96), pages 203-212, September 1996.]]

[35]

O. Wolfson, S. Jajodia, and Y. Huang. An adaptive data replication algorithm. A CM Transactions on Database Systems, 22:255-314, 1997.]]

Digital Library

Cited By

Etesami SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access CostsProceedings of the ACM Web Conference 202410.1145/3589334.3645654(4340-4351)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645654
Swamy C(2016)Improved Approximation Algorithms for Matroid and Knapsack Median Problems and ApplicationsACM Transactions on Algorithms10.1145/296317012:4(1-22)Online publication date: 3-Aug-2016
https://dl.acm.org/doi/10.1145/2963170
Sourlas VPsaras ISaino LPavlou G(2016)Efficient Hash-routing and Domain Clustering Techniques for Information-Centric NetworksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2016.04.001103:C(67-83)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1016/j.comnet.2016.04.001
Show More Cited By

Index Terms

Approximation algorithms for data placement in arbitrary networks
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
  2. Randomness, geometry and discrete structures

Recommendations

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems

In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Max d-Clique and Max d-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset $$S\subseteq V$$S⊆V of vertices ...
Approximation Algorithms for Data Placement Problems

We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity for storing data objects so as to minimize the average data-access cost. We ...
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
COCOA 2015: Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486

A d-clique in a graph $$G = V, E$$G=V,E is a subset $$S\subseteq V$$S⊆V of vertices such that for pairs of vertices $$u, v\in S$$u,v∈S, the distance between u and v is at most d in G. A d-club in a graph $$G = V, E$$G=V,E is a subset $$S'\subseteq V$$S'⊆...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

January 2001

937 pages

ISBN:0898714907

Chairman:
S. Rao Kosaraju

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM: Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 09 January 2001

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
932
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Etesami SChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Distributed Data Placement and Content Delivery in Web Caches with Non-Metric Access CostsProceedings of the ACM Web Conference 202410.1145/3589334.3645654(4340-4351)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645654
Swamy C(2016)Improved Approximation Algorithms for Matroid and Knapsack Median Problems and ApplicationsACM Transactions on Algorithms10.1145/296317012:4(1-22)Online publication date: 3-Aug-2016
https://dl.acm.org/doi/10.1145/2963170
Sourlas VPsaras ISaino LPavlou G(2016)Efficient Hash-routing and Domain Clustering Techniques for Information-Centric NetworksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2016.04.001103:C(67-83)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1016/j.comnet.2016.04.001
Guan XChoi B(2014)Push or pull? Toward optimal content delivery using cloud storageJournal of Network and Computer Applications10.5555/2773807.277404640:C(234-243)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.5555/2773807.2774046
Kayaaslan ECambazoglu BAykanat C(2013)Document replication strategies for geographically distributed web search enginesInformation Processing and Management: an International Journal10.1016/j.ipm.2012.01.00249:1(51-66)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1016/j.ipm.2012.01.002
Pacifici VDán GKalmanek CMedhi D(2011)Selfish content replication on graphsProceedings of the 23rd International Teletraffic Congress10.5555/2043468.2043488(119-126)Online publication date: 6-Sep-2011
https://dl.acm.org/doi/10.5555/2043468.2043488
Borst SGupta VWalid A(2010)Distributed caching algorithms for content distribution networksProceedings of the 29th conference on Information communications10.5555/1833515.1833726(1478-1486)Online publication date: 14-Mar-2010
https://dl.acm.org/doi/10.5555/1833515.1833726
Borst SGupta VWalid A(2009)Self-organizing algorithms for cache cooperation in content distribution networksACM SIGMETRICS Performance Evaluation Review10.1145/1639562.163959137:2(71-72)Online publication date: 16-Oct-2009
https://dl.acm.org/doi/10.1145/1639562.1639591
Jain AJaiswal SMajumder AK V M NNarlikar GShrivastava NPoosala VBanerjee S(2009)mangoProceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds10.1145/1592606.1592627(73-74)Online publication date: 17-Aug-2009
https://dl.acm.org/doi/10.1145/1592606.1592627
Boutaba RKarsten MYoung M(2009)A Heuristic for Fair Correlation-Aware Resource PlacementProceedings of the 8th International Symposium on Experimental Algorithms10.1007/978-3-642-02011-7_10(89-100)Online publication date: 4-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02011-7_10
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten