The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic

DOI10.1007/s00291-013-0358-zzbMath1308.90020OpenAlexW2084333502MaRDI QIDQ2260900

Rainer Kolisch, André Dahlmann

Publication date: 12 March 2015

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-013-0358-z

zbMATH Keywords

simulated annealingmetaheuristicmixed integer programcontent delivery networkcontent distribution network

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Optimization by Simulated Annealing
• Facility location models for distribution planning
• A fast algorithm for Steiner trees
• On the use of the complexity index as a measure of complexity in activity networks
• The simple plant location problem: Survey and synthesis
• A survey of combinatorial optimization problems in multicast routing
• Provisioning overlay distribution networks
• Placement Algorithms for Hierarchical Cooperative Caching
• Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet
• Reducibility among Combinatorial Problems
• Optimal File Allocation in a Multiple Computer System
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic