Dynamic replica placement for scalable content delivery
From MaRDI portal
Recommendations
- SCAN: A dynamic, scalable, and efficient content distribution network
- Solving replica placement and request distribution in content distribution networks
- Computational Science and Its Applications – ICCSA 2004
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
- Dynamic replication of web contents
Cited in
(12)- Optimization of a peer-to-peer system for efficient content replication
- Coarse-grain replica management strategies for dynamic replication of Web contents
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
- Placement of proxy-based multicast overlays
- Solving replica placement and request distribution in content distribution networks
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Replication in overlay networks: A multi-objective optimization approach
- Dynamic data storage scheme in CDN - UbDP
- SCAN: A dynamic, scalable, and efficient content distribution network
- Facility location models to locate data in information networks: a literature review
- Computational Science and Its Applications – ICCSA 2004
- SCDN: stable content distribution network based on demands
This page was built for publication: Dynamic replica placement for scalable content delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709175)