Total Recall: System Support for Automated Availability Management
By Ranjita Bhagwan, K. Tati, Yuchung Cheng, Stefan Savage, Geoffrey M. Voelker. Symposium on Networked Systems Design and Implementation, 2004
633 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/1ba77164225515320452654e7b665a4e01cafd2b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Frank Dabek
- N. Feamster
- Andreas Haeberlen
- Andy C. Bavier
- Peter Druschel
- Emil Sit
- Jennifer Rexford
- Byung-Gon Chun
Citations in the corpus
- In VINI veritas: realistic and controlled network experimentation (2006, methodology): “I would like to note that the WLAN studied in this paper is a a stable, well-managed network: the positions of the APs and their channel assignments are well-known and do not change.”
- A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding (2012, methodology): “One way to reduce the expansion rate is to use erasure codes to encode messages [10], [11], [12], [13], [5].”
- FastReID: A Pytorch Toolbox for General Instance Re-identification (2020, methodology): “Two re-rank methods: K-reciprocal coding [13] and Query Expansion (QE) [3] are implemented in FastReID.”
- Glacier: highly durable, decentralized storage despite massive correlated failures (2005, background): “TotalRecall [5] is an example of a system that uses introspection to optimize availability under churn.”
- Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing (2016, unknown): “, see lazy repair strategy in [10]).”
- Efficient Replica Maintenance for Distributed Storage Systems (2006, methodology): “Total Recall [3] tracks up to a fixed number of replicas, controlled by a parameter rH ; we show rH = 5 which is optimal for these traces, and rH = 9.”
- High Availability in DHTs: Erasure Coding vs. Replication (2005, background): “Using algebraic simplifications and the normal approximation to the binomial distribution (see [3]), we get the following formula for the erasure coding redundancy factor: kc = σ √ a(1−a) m + √ σ2 a(1−a) m + 4a 2a”