Placement Algorithms for Hierarchical Cooperative Caching

DOI10.1006/jagm.2000.1129zbMath0969.68182OpenAlexW1993553863MaRDI QIDQ2709801

Madhukar R. Korupolu, Rajmohan Rajaraman, C. Greg Plaxton

Publication date: 17 April 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1129

zbMATH Keywords

polynomial-time algorithmsefficient distributed implementation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14)

Related Items (5)

Exact algorithms for the joint object placement and request routing problem in content distribution networks ⋮ Optimal data placement on networks with a constant number of clients ⋮ The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic ⋮ Cache me if you can: capacitated selfish replication games in networks ⋮ Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks

This page was built for publication: Placement Algorithms for Hierarchical Cooperative Caching