Comparison and analysis of ten static heuristics-based Internet data replication techniques
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3481821 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- A constant-factor approximation algorithm for the k-median problem
- An algorithm for finding a k-median in a directed tree
- An extension of a greedy heuristic for the knapsack problem
- Competitive paging algorithms
- Optimal File Allocation in a Multiple Computer System
- Optimal placement of web proxies for replicated web servers in the internet
- Static and adaptive distributed data replication using genetic algorithms
Cited in
(6)- An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network
- scientific article; zbMATH DE number 2084791 (Why is no real title available?)
- Object replication algorithms for World Wide Web
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- Static and adaptive distributed data replication using genetic algorithms
- Facility location models to locate data in information networks: a literature review
This page was built for publication: Comparison and analysis of ten static heuristics-based Internet data replication techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436652)