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

DOI10.1016/J.JPDC.2007.06.009zbMATH Open1243.68040OpenAlexW2129405679MaRDI QIDQ436652FDOQ436652

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

data replicationInternetinformed searchingstatic allocation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Competitive paging algorithms
• Title not available (Why is that?)
• Optimal File Allocation in a Multiple Computer System
• 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
• Optimal placement of web proxies for replicated web servers in the internet
• Static and adaptive distributed data replication using genetic algorithms

Cited In (4)

• An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network
• Title not available (Why is that?)
• 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

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)