메뉴 건너뛰기




Volumn 59, Issue 11, 2013, Pages 7229-7258

Cooperative regenerating codes

Author keywords

Decentralized erasure codes; distributed storage system; network coding; polymatroid; regenerating codes; submodular flow; submodular function

Indexed keywords

DECENTRALIZED ERASURE CODES; DISTRIBUTED STORAGE SYSTEM; POLYMATROIDS; REGENERATING CODES; SUBMODULAR FLOW; SUBMODULAR FUNCTIONS;

EID: 84886678179     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2274265     Document Type: Article
Times cited : (116)

References (48)
  • 1
    • 21644437974 scopus 로고    scopus 로고
    • The google file system
    • SOSP'03: Proceedings of the 19th ACM Symposium on Operating Systems Principles
    • S. Ghemawat, H. Gobioff, and S.-T. Leung, "The Google file system," in Proc. 19th ACM SIGOPS Symp. Oper. Syst. Principles, Oct. 2003, pp. 29-43. (Pubitemid 40929686)
    • (2003) Operating Systems Review (ACM) , vol.37 , Issue.5 , pp. 29-43
    • Ghemawat, S.1    Gobioff, H.2    Leung, S.-T.3
  • 3
    • 82655182931 scopus 로고    scopus 로고
    • Windows Azure storage: A highly available cloud storage service with strong consistency
    • B. Calder et al., "Windows Azure storage: A highly available cloud storage service with strong consistency," in Proc. 23rd ACM Symp. Oper. Syst. Principles, 2011, pp. 143-157.
    • (2011) Proc. 23rd ACM Symp. Oper. Syst. Principles , pp. 143-157
    • Calder, B.1
  • 5
    • 84857762916 scopus 로고    scopus 로고
    • Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff
    • Mar.
    • N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff," IEEE Trans. Inf. Theory, vol. 58, no. 3, pp. 1837-1852, Mar. 2012.
    • (2012) IEEE Trans. Inf. Theory , vol.58 , Issue.3 , pp. 1837-1852
    • Shah, N.B.1    Rashmi, K.V.2    Kumar, P.V.3    Ramchandran, K.4
  • 6
    • 79961002025 scopus 로고    scopus 로고
    • Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction
    • Aug.
    • K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5227-5239, Aug. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.8 , pp. 5227-5239
    • Rashmi, K.V.1    Shah, N.B.2    Kumar, P.V.3
  • 7
    • 79951859303 scopus 로고    scopus 로고
    • Exact-repair MDS code construction using interference alignment
    • Mar.
    • C. Suh and K. Ramchandran, "Exact-repair MDS code construction using interference alignment," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1425-1442, Mar. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.3 , pp. 1425-1442
    • Suh, C.1    Ramchandran, K.2
  • 8
    • 80054801912 scopus 로고    scopus 로고
    • Permutation codes: Optimal exact-repair of a single failed node in MDS code based distributed storage systems
    • St. Petersburg, Russia, Aug.
    • V. R. Cadambe, C. Huang, and J. Li, "Permutation codes: Optimal exact-repair of a single failed node in MDS code based distributed storage systems," in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011, pp. 1188-1192.
    • (2011) Proc. IEEE Int. Symp. Inf. Theory , pp. 1188-1192
    • Cadambe, V.R.1    Huang, C.2    Li, J.3
  • 9
    • 80054824298 scopus 로고    scopus 로고
    • Distributed storage codes through Hadamard designs
    • St. Petersburg, Russia, Aug.
    • D. Papailiopoulos and A. G. Dimakis, "Distributed storage codes through Hadamard designs," in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011, pp. 1193-1197.
    • (2011) Proc. IEEE Int. Symp. Inf. Theory , pp. 1193-1197
    • Papailiopoulos, D.1    Dimakis, A.G.2
  • 10
    • 83655202663 scopus 로고    scopus 로고
    • Quasicyclic MDS codes for distributed storage with efficient exact repair
    • Paraty, Brazil, Oct.
    • A. Thangaraj and C. Sankar, "Quasicyclic MDS codes for distributed storage with efficient exact repair," in Proc. IEEE Inf. Theory Workshop, Paraty, Brazil, Oct. 2011, pp. 45-49.
    • (2011) Proc. IEEE Inf. Theory Workshop , pp. 45-49
    • Thangaraj, A.1    Sankar, C.2
  • 11
    • 79952405748 scopus 로고    scopus 로고
    • Fractional repetition codes for repair in distributed storage systems
    • Monticello, IL, Sep.
    • S. El Rouayheb and K. Ramchandran, "Fractional repetition codes for repair in distributed storage systems," in Proc. Allerton Conf. Commun. Control Comput., Monticello, IL, Sep. 2010, pp. 1510-1517.
    • (2010) Proc. Allerton Conf. Commun. Control Comput. , pp. 1510-1517
    • El Rouayheb, S.1    Ramchandran, K.2
  • 12
    • 83655164980 scopus 로고    scopus 로고
    • Self-repairing codes for distributed storage-A projective geometric construction
    • Paraty, Brazil, Oct.
    • F. Oggier and A. Datta, "Self-repairing codes for distributed storage-A projective geometric construction," in Proc. IEEE Inf. Theory Workshop, Paraty, Brazil, Oct. 2011, pp. 30-34.
    • (2011) Proc. IEEE Inf. Theory Workshop , pp. 30-34
    • Oggier, F.1    Datta, A.2
  • 15
    • 84867522880 scopus 로고    scopus 로고
    • Optimal linear codes with local-error-correcting property
    • Cambridge, MA, USA, Jul.
    • N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, "Optimal linear codes with local-error-correcting property," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, Jul. 2012, pp. 2776-2780.
    • (2012) Proc. IEEE Int. Symp. Inf. Theory , pp. 2776-2780
    • Prakash, N.1    Kamath, G.M.2    Lalitha, V.3    Kumar, P.V.4
  • 17
  • 19
    • 77955390785 scopus 로고    scopus 로고
    • Cooperative recovery of distributed storage systems from multiple losses with network coding
    • Feb.
    • Y. Hu, Y. Xu, X. Wang, C. Zhan, and P. Li, "Cooperative recovery of distributed storage systems from multiple losses with network coding," IEEE J. Sel. Areas Commun., vol. 28, no. 2, pp. 268-276, Feb. 2010.
    • (2010) IEEE J. Sel. Areas Commun. , vol.28 , Issue.2 , pp. 268-276
    • Hu, Y.1    Xu, Y.2    Wang, X.3    Zhan, C.4    Li, P.5
  • 20
    • 77955412202 scopus 로고    scopus 로고
    • MFR: Multi-loss flexible recovery in distributed storage systems
    • Capetown, South Africa, May
    • X. Wang, Y. Xu, Y. Hu, and K. Ou, "MFR: Multi-loss flexible recovery in distributed storage systems," presented at the IEEE Int. Conf. Commun., Capetown, South Africa, May 2010.
    • (2010) Presented at the IEEE Int. Conf. Commun.
    • Wang, X.1    Xu, Y.2    Hu, Y.3    Ou, K.4
  • 21
    • 84886649684 scopus 로고    scopus 로고
    • Ph.D. dissertation, Institut National des Sciences Appliquèes de Rennes, Universitè de Rennes I, Rennes, France, Dec.
    • N. Le Scouarnec, "Coding for resource optimization in large-scale distributed systems," Ph.D. dissertation, Institut National des Sciences Appliquèes de Rennes, Universitè de Rennes I, Rennes, France, Dec. 2010.
    • (2010) Coding for Resource Optimization in Large-scale Distributed Systems
    • Le Scouarnec, N.1
  • 22
    • 80052984151 scopus 로고    scopus 로고
    • Repairing multiple failures with coordinated and adaptive regenerating codes
    • Beijing, China, Jul.
    • A.-M. Kermarrec, N. Le Scouarnec, and G. Straub, "Repairing multiple failures with coordinated and adaptive regenerating codes," in Proc. Int. Symp. Netw. Coding, Beijing, China, Jul. 2011, pp. 88-93.
    • (2011) Proc. Int. Symp. Netw. Coding , pp. 88-93
    • Kermarrec, A.-M.1    Le Scouarnec, N.2    Straub, G.3
  • 25
    • 67650119690 scopus 로고    scopus 로고
    • On randomized linear network codes and their error correction capabilities
    • Jul.
    • H. Bally, X. Yan, and Z. Zhang, "On randomized linear network codes and their error correction capabilities," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3148-3160, Jul. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.7 , pp. 3148-3160
    • Bally, H.1    Yan, X.2    Zhang, Z.3
  • 26
    • 79951955602 scopus 로고    scopus 로고
    • Existence and construction of capacity-achieving network codes for distributed storage
    • Feb.
    • Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," IEEE J. Sel. Areas Commun., vol. 28, no. 2, pp. 277-288, Feb. 2010.
    • (2010) IEEE J. Sel. Areas Commun. , vol.28 , Issue.2 , pp. 277-288
    • Wu, Y.1
  • 27
    • 70449469445 scopus 로고    scopus 로고
    • Reducing repair traffic for erasure coding-based storage via interference alignment
    • Seoul, Korea, Jul.
    • Y. Wu and A. G. Dimakis, "Reducing repair traffic for erasure coding-based storage via interference alignment," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jul. 2009, pp. 2276-2280.
    • (2009) Proc. IEEE Int. Symp. Inf. Theory , pp. 2276-2280
    • Wu, Y.1    Dimakis, A.G.2
  • 37
    • 0003956970 scopus 로고    scopus 로고
    • 3rd ed ed. Reading MA: Addison-Wesley
    • S. Lang, Algebra, 3rd ed ed. Reading, MA: Addison-Wesley, 1997.
    • (1997) Algebra
    • Lang, S.1
  • 38
    • 79955499792 scopus 로고    scopus 로고
    • A max-flow/min-cut algorithm for linear deterministic relay networks
    • May
    • S. M. S. Tabatabaei Yazdi and S. A. Savari, "A max-flow/min-cut algorithm for linear deterministic relay networks," IEEE Trans. Inf. Theory, vol. 57, no. 5, pp. 3005-3015, May 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.5 , pp. 3005-3015
    • Tabatabaei Yazdi, S.M.S.1    Savari, S.A.2
  • 39
    • 84866261697 scopus 로고    scopus 로고
    • A flow model based on polylinking system
    • M. X. Goemans, S. Iwata, and R. Zenklusen, "A flow model based on polylinking system," Math. Program. Ser. A, vol. 135, no. 1-2, pp. 1-23, 2012.
    • (2012) Math. Program. Ser. A , vol.135 , Issue.1-2 , pp. 1-23
    • Goemans, M.X.1    Iwata, S.2    Zenklusen, R.3
  • 40
    • 79952852802 scopus 로고    scopus 로고
    • Wireless network information flow: A deterministic approach
    • Apr.
    • A. S. Avestimehr, S. N. Diggavi, and D. N. C. Tse, "Wireless network information flow: A deterministic approach," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872-1905, Apr. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.4 , pp. 1872-1905
    • Avestimehr, A.S.1    Diggavi, S.N.2    Tse, D.N.C.3
  • 43
    • 0002403014 scopus 로고
    • Computing maximal "polymatroidal" network flows
    • E. L. Lawler and C. U. Martel, "Computing maximal "polymatroidal" network flows," Math. Oper. Res., vol. 7, no. 3, pp. 334-337, 1982.
    • (1982) Math. Oper. Res. , vol.7 , Issue.3 , pp. 334-337
    • Lawler, E.L.1    Martel, C.U.2
  • 45
    • 84878551138 scopus 로고    scopus 로고
    • A note on polylinking flow networks
    • Feb.
    • S. Fujishige, "A note on polylinking flow networks," Math. Program. Ser. A, vol. 137, pp. 601-607, Feb. 2013.
    • (2013) Math. Program. Ser. A , vol.137 , pp. 601-607
    • Fujishige, S.1
  • 48
    • 84867524247 scopus 로고    scopus 로고
    • Exact scalar minimum storage coordinated regenerating codes
    • Cambridge, MA, Jul.
    • N. Le Scouarnec, "Exact scalar minimum storage coordinated regenerating codes," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Jul. 2012, pp. 1197-1201.
    • (2012) Proc. IEEE Int. Symp. Inf. Theory , pp. 1197-1201
    • Le Scouarnec, N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.