Solving Replica Placement and Request Distribution in Content Distribution Networks

DOI10.1016/j.endm.2010.05.012zbMath1237.90268OpenAlexW2013991076MaRDI QIDQ2883556

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

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)

Related Items (1)

A new hybrid heuristic for replica placement and request distribution in content distribution networks

Uses Software

• CPLEX

Cites Work

• Designing cost-effective content distribution networks

This page was built for publication: Solving Replica Placement and Request Distribution in Content Distribution Networks