On the public citation graph
Strategies for Replica Placement in Tree Networks
0 signed · 25 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s1389-1286(02)00251-7openalex-snapshot
Optimal allocation of electronic content
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/71.932716openalex-snapshot
Optimal placement of replicas in trees with read, write, and storage costs
inferredcites →https://doi.org/10.1109/icdcs.2004.1281600openalex-snapshot
Choosing replica placement heuristics for wide-area systems
inferredcites →https://doi.org/10.1109/icpads.2006.74openalex-snapshot
Optimal placement of replicas in data grid environments with locality assurance
inferredcites →https://doi.org/10.1109/ideas.2001.938096openalex-snapshot
Steiner-optimal data replication in tree networks with storage costs
inferredcites →https://doi.org/10.1109/ipdps.2007.370331openalex-snapshot
Strategies for Replica Placement in Tree Networks
inferredcites →https://doi.org/10.1109/tpds.2005.126openalex-snapshot
QoS-aware replica placement for content distribution
inferredcites →https://doi.org/10.1109/tpds.2006.145openalex-snapshot
Replicated Server Placement with QoS Constraints
inferredcites →https://doi.org/10.1145/103140.103146openalex-snapshot
The multicast policy and its relationship to replicated data placement
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-72498-0_3openalex-snapshot
Optimal Closest Policy with Qos and Bandwidth Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_47openalex-snapshot
Impact of QoS on Replica Placement in Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_26openalex-snapshot
Comparison of Access Policies for Replica Placement in Tree Networks
inferred← citeshttps://doi.org/10.1007/s10479-015-1840-6openalex-snapshot
Facility location models to locate data in information networks: a literature review
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.08.002openalex-snapshot
Optimal replica placement in hierarchical Data Grids with locality assurance
inferred← citeshttps://doi.org/10.1109/aina.2014.130openalex-snapshot
Minimizing Cost of K-Replica in Hierarchical Data Grid Environment
inferred← citeshttps://doi.org/10.1109/dasc.2009.60openalex-snapshot
Replica Placement in Multi-tier Data Grid
inferred← citeshttps://doi.org/10.1109/eurcon.2009.5167653openalex-snapshot
Data replication techniques with applications to the MonALISA distributed monitoring system
inferred← citeshttps://doi.org/10.1109/icdim.2008.4746731openalex-snapshot
A load balancing replica placement strategy in Data Grid
inferred← citeshttps://doi.org/10.1109/isiea.2013.6738988openalex-snapshot
Minimizing access cost of replicas in tree data grids for read-only objects
inferred← citeshttps://doi.org/10.1109/pdcat.2010.78openalex-snapshot
Distributed Popularity Based Replica Placement in Data Grid Environments
inferred← citeshttps://doi.org/10.1109/tpds.2008.25openalex-snapshot
Replica Placement and Access Policies in Tree Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0706.3350openalex-snapshot
Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy
showing the first 13 of 14 · page through all 14
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.