Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Online tracking of mobile users
Journal of the ACM (JACM)
Competitive algorithms for distributed data management
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
The Harvest information discovery and access system
Computer Networks and ISDN Systems
Serverless network file systems
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Distributed paging for general networks
Journal of Algorithms
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Caching in networks (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The case for geographical push-caching
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Coordinated Placement and Replacement for Large-Scale Distributed Caches
WIAPP '99 Proceedings of the 1999 IEEE Workshop on Internet Applications
WebWave: Globally Load Balanced Fully Distributed Caching of Hot Published Documents
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Approximation algorithms for data management in networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved algorithms for the data placement problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Data Placement in Intermittently Available Environments
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Designing overlay multicast networks for streaming
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Joint object placement and node dimensioning for internet content distribution
Information Processing Letters
Content and service replication strategies in multi-hop wireless mesh networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed Selfish Replication
IEEE Transactions on Parallel and Distributed Systems
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Using utility to provision storage systems
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Near-optimal dynamic replication in unstructured peer-to-peer networks
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Heuristic for Fair Correlation-Aware Resource Placement
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
mango: low-cost, scalable delivery of rich content on mobiles
Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds
Self-organizing algorithms for cache cooperation in content distribution networks
ACM SIGMETRICS Performance Evaluation Review
On the social cost of distributed selfish content replication
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Distributed caching algorithms for content distribution networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Selfish content replication on graphs
Proceedings of the 23rd International Teletraffic Congress
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Content distribution through autonomic content and storage management
WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
Improved algorithms for data migration
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Document replication strategies for geographically distributed web search engines
Information Processing and Management: an International Journal
Content management in a mobile ad hoc network: beyond opportunistic strategy
International Journal of Communication Networks and Distributed Systems
Gossip-based cooperative caching for mobile applications in mobile wireless networks
Journal of Parallel and Distributed Computing
Energy efficient data caching for content dissemination networks
Journal of High Speed Networks
Hi-index | 0.00 |
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.