On the public citation graph

A Fundamental Trade-Off between the Download Cost and Repair Bandwidth in Distributed Storage Systems

https://doi.org/10.1109/netcod.2010.5487685
0 signed · 27 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11558989_21openalex-snapshot
High Availability in DHTs: Erasure Coding vs. Replication
inferredcites →https://doi.org/10.1007/3-540-45748-8_31openalex-snapshot
Erasure Coding Vs. Replication: A Quantitative Comparison
inferredcites →https://doi.org/10.1016/j.comcom.2010.07.022openalex-snapshot
Cost-bandwidth tradeoff in distributed storage systems
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/infcom.2007.232openalex-snapshot
Network Coding for Distributed Storage Systems
inferredcites →https://doi.org/10.1109/tit.2002.807285openalex-snapshot
Linear network coding
inferredcites →https://doi.org/10.1109/tit.2010.2054295openalex-snapshot
Network Coding for Distributed Storage Systems
inferredcites →https://doi.org/10.1109/tnet.2003.818197openalex-snapshot
An algebraic approach to network coding

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/dcc.2013.72openalex-snapshot
A Realistic Distributed Storage System That Minimizes Data Storage and Repair Bandwidth
inferred← citeshttps://doi.org/10.1109/glocom.2016.7841820openalex-snapshot
Erasure Coded Storage on a Changing Network: The Untold Story
inferred← citeshttps://doi.org/10.1109/icc.2017.7997392openalex-snapshot
Capacity of Clustered Distributed Storage
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848127openalex-snapshot
Heterogeneity-aware data regeneration in distributed storage systems
inferred← citeshttps://doi.org/10.1109/isabel.2010.5702783openalex-snapshot
Distributed storage systems and connection to network coding
inferred← citeshttps://doi.org/10.1109/isit.2011.6033732openalex-snapshot
Enabling node repair in any erasure code for distributed storage
inferred← citeshttps://doi.org/10.1109/isit.2013.6620424openalex-snapshot
Non-homogeneous two-rack model for distributed storage systems
inferred← citeshttps://doi.org/10.1109/lcomm.2011.061611.102271openalex-snapshot
Selective Regenerating Codes
inferred← citeshttps://doi.org/10.1109/sere.2013.27openalex-snapshot
An Empirical Study on Data Retrievability in Decentralized Erasure Code Based Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/sere.2014.37openalex-snapshot
Reliable Repair Mechanisms with Low Connection Cost for Code Based Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/tit.2011.2173792openalex-snapshot
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
inferred← citeshttps://doi.org/10.1109/tnet.2018.2830800openalex-snapshot
Network-Aware Feasible Repairs for Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/trustcom.2011.79openalex-snapshot
A Decentralized Repair Mechanism for Decentralized Erasure Code Based Storage Systems
inferred← citeshttps://doi.org/10.1134/s0032946021010026openalex-snapshot
Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost
inferred← citeshttps://doi.org/10.22214/ijraset.2019.4524openalex-snapshot
A Survey on Network-Aware Feasible Repairs for Erasure-Coded Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1549openalex-snapshot
A realistic distributed storage system that minimizes data storage and repair bandwidth
inferred← citeshttps://doi.org/10.48550/arxiv.1302.5657openalex-snapshot
A realistic distributed storage system: the rack model
inferred← citeshttps://doi.org/10.48550/arxiv.1307.8201openalex-snapshot
Non-homogeneous Two-Rack Model for Distributed Storage Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1603.05163openalex-snapshot
Accelerating Data Regeneration for Distributed Storage Systems with Heterogeneous Link Capacities
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.