Comparison and analysis of ten static heuristics-based Internet data replication techniques

DOI10.1016/j.jpdc.2007.06.009zbMath1243.68040OpenAlexW2129405679MaRDI QIDQ436652

Samee Ullah Khan, Ishfaq Ahmad

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.06.009

zbMATH Keywords

Internetdata replicationinformed searchingstatic allocation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Internet topics (68M11)

Related Items (3)

Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions ⋮ Facility location models to locate data in information networks: a literature review ⋮ An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network

Cites Work

• Static and adaptive distributed data replication using genetic algorithms
• An extension of a greedy heuristic for the knapsack problem
• An algorithm for finding a \(k\)-median in a directed tree
• A constant-factor approximation algorithm for the \(k\)-median problem
• Optimal Placement of Web Proxies for Replicated Web Servers in the Internet
• Competitive paging algorithms
• Optimal File Allocation in a Multiple Computer System
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison and analysis of ten static heuristics-based Internet data replication techniques