Joint object placement and node dimensioning for internet content distribution

DOI10.1016/j.ipl.2003.12.002zbMath1178.68059OpenAlexW1996256675MaRDI QIDQ1029097

Ioannis Stavrakakis, Nikolaos Laoutaris, Vassilios Zissimopoulos

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.12.002

zbMATH Keywords

combinatorial problemspackingcontent distributionmulti-commodity \(k\)-median

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Related Items (4)

Designing cost-effective content distribution networks ⋮ Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique ⋮ Exact algorithms for the joint object placement and request routing problem in content distribution networks ⋮ Facility location models to locate data in information networks: a literature review

Cites Work

• Approximation algorithms for geometric median problems
• An algorithm for finding a \(k\)-median in a directed tree
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Local search heuristic for k-median and facility location problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Joint object placement and node dimensioning for internet content distribution