Solving replica placement and request distribution in content distribution networks

DOI10.1016/J.ENDM.2010.05.012MaRDI QIDQ2883556zbMATH OpenOpenAlexFDO

Authors Tiago Araújo Neves, Lúcia M. A. Drummond, Luiz S. Ochi, Célio Albuquerque, Eduardo Uchoa

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.012

zbMATH Keywords

mathematical formulationcontent distribution networkhybrid heuristcreplica placement and request distribution problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A new hybrid heuristic for replica placement and request distribution in content distribution networks
• Jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks
• scientific article; zbMATH DE number 1931816
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES
• Joint server selection and replica placement in urban content delivery networks

Cites work

• Designing cost-effective content distribution networks

Cited in

(24)

• Coarse-grain replica management strategies for dynamic replication of Web contents
• A new hybrid heuristic for replica placement and request distribution in content distribution networks
• Dynamic data storage scheme in CDN - UbDP
• scientific article; zbMATH DE number 1982691 (Why is no real title available?)
• An overview of DNS-based server selections in content distribution networks.
• Early abnormal overload detection and the solution on content delivery network
• Joint server selection and replica placement in urban content delivery networks
• scientific article; zbMATH DE number 2043487 (Why is no real title available?)
• Provisioning overlay distribution networks
• Growing half-balls: minimizing storage and communication costs in CDNs
• scientific article; zbMATH DE number 1928256 (Why is no real title available?)
• The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
• Jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks
• CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES
• A greedy algorithm for capacity-constrained surrogate placement in CDNs
• Serving content with unknown demand: the high-dimensional regime
• Designing cost-effective content distribution networks
• Exact algorithms for the joint object placement and request routing problem in content distribution networks
• Computational Science and Its Applications – ICCSA 2004
• A two-level simulated annealing algorithm for efficient dissemination of electronic content
• ADAPTIVE AND INTELLIGENT REQUEST DISTRIBUTION FOR CONTENT DELIVERY NETWORKS
• scientific article; zbMATH DE number 1931816 (Why is no real title available?)
• SCDN: stable content distribution network based on demands
• A graph partitioning method to determine servers placement in CDN

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Solving replica placement and request distribution in content distribution networks

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