Implementing global memory management in a workstation cluster
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth 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
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
Distributed paging for general networks
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Placement algorithms for hierarchical cooperative caching
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th 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
Rules of Thumb in Data Engineering
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
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)
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
The Potential Costs and Benefits of Long-term Prefetching for ContentDistribution
The Potential Costs and Benefits of Long-term Prefetching for ContentDistribution
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Minimal replication cost for availability
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Distributed computing research issues in grid computing
ACM SIGACT News
TCP Nice: a mechanism for background transfers
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
A scalable distributed information management system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
TCP Nice: a mechanism for background transfers
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Data Staging on Untrusted Surrogates
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Bounded-Latency Content Distribution: Feasibility and Evaluation
IEEE Transactions on Computers
Operating system support for massive replication
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
A new service overlays dimensioning approach based on stochastic geometry
Performance Evaluation
Provisioning overlay distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Networking issues in entertainment computing
NPS: a non-interfering deployable web perfectching system
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Content distribution for publish/subscribe services
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Provisioning overlay distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed and Parallel Databases
Data staging on untrusted surrogates
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Object placement for cooperative caches with bandwidth constraints
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
The potential costs and benefits of long-term prefetching for content distribution
Computer Communications
| Hi-index | 0.00 |
In this paper, we examine the bandwidth-constrained placement problem, focusing on trade-offs appropriate for wide area network (WAN) environments. The goal is to place copies of objects at a collection of distributed caches to minimize expected access times from distributed clients to those objects subject to a maximum bandwidth constraint at each cache. We develop a simple algorithm to generate a bandwidth-constrained placement by hierarchically refining an initial per-cache greedy placement. We prove that this hierarchical algorithm generates a placement whose expected access time is within a constant factor of the optimal placement's expected access time. We then proceed to extend this algorithm to compute close to optimal placement strategies for dynamic environments.