Jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks

DOI10.1007/978-3-319-96151-4_17zbMATH Open1401.90189OpenAlexW2884589657MaRDI QIDQ1661883FDOQ1661883

Authors: Raquel Gerhardt, Tiago Neves, Luis Alberto Duncan Rangel 

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_17

Recommendations

• Solving replica placement and request distribution in content distribution networks
• A new hybrid heuristic for replica placement and request distribution in content distribution networks
• Designing cost-effective content distribution networks
• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic

zbMATH Keywords

combinatorial optimizationmathematical formulationcontent distribution networksstorage capacity optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (8)

• A new hybrid heuristic for replica placement and request distribution in content distribution networks
• Title not available (Why is that?)
• Joint server selection and replica placement in urban content delivery networks
• Title not available (Why is that?)
• Solving replica placement and request distribution in content distribution networks
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
• Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
• Joint object placement and node dimensioning for internet content distribution

This page was built for publication: Jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661883)