暂无分享,去创建一个
[1] Tracey Ho,et al. A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.
[2] Dimitris S. Papailiopoulos,et al. Simple regenerating codes: Network coding for cloud storage , 2011, 2012 Proceedings IEEE INFOCOM.
[3] Soroush Akhlaghi,et al. Selective Regenerating Codes , 2011, IEEE Communications Letters.
[4] Cheng Huang,et al. Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads , 2012, FAST.
[5] Dah Ming Chiu,et al. Erasure code replication revisited , 2004 .
[6] Rodrigo Rodrigues,et al. High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.
[7] Yunnan Wu,et al. Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.
[8] Howard Gobioff,et al. The Google file system , 2003, SOSP '03.
[9] Ernst W. Biersack,et al. A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.
[10] Kannan Ramchandran,et al. Fractional repetition codes for repair in distributed storage systems , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[11] Ju Wang,et al. Windows Azure Storage: a highly available cloud storage service with strong consistency , 2011, SOSP.
[12] Anne-Marie Kermarrec,et al. Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes , 2011, 2011 International Symposium on Networking Coding.
[13] Yang Tang,et al. NCCloud: applying network coding for the storage repair in a cloud-of-clouds , 2012, FAST.
[14] John Kubiatowicz,et al. Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.
[15] Kannan Ramchandran,et al. Exact-Repair MDS Code Construction Using Interference Alignment , 2011, IEEE Transactions on Information Theory.
[16] Patrick P. C. Lee,et al. NCFS: On the Practicality and Extensibility of a Network-Coding-Based Distributed File System , 2011, 2011 International Symposium on Networking Coding.