메뉴 건너뛰기




Volumn , Issue , 2014, Pages 861-865

The MDS queue: Analysing the latency performance of erasure codes

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); FORWARD ERROR CORRECTION; QUEUEING THEORY; REED-SOLOMON CODES; THROUGHPUT;

EID: 84906568882     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6874955     Document Type: Conference Paper
Times cited : (49)

References (22)
  • 1
    • 80053157273 scopus 로고    scopus 로고
    • Availability in globally distributed storage systems
    • Oct
    • D. Ford et al., "Availability in globally distributed storage systems, " in USENIX OSDI, Oct. 2010.
    • (2010) USENIX OSDI
    • Ford, D.1
  • 2
    • 85084160461 scopus 로고    scopus 로고
    • A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster
    • Jun
    • K. V. Rashmi et al., "A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster, " in Proc. USENIX HotStorage, Jun. 2013.
    • (2013) Proc. USENIX HotStorage
    • Rashmi, K.V.1
  • 7
  • 8
    • 84904440076 scopus 로고    scopus 로고
    • When queueing meets coding: Optimal-latency data retrieving scheme in storage clouds
    • S. Chen et al., "When queueing meets coding: Optimal-latency data retrieving scheme in storage clouds, " in Infocomm, 2014.
    • (2014) Infocomm
    • Chen, S.1
  • 10
    • 33846118079 scopus 로고    scopus 로고
    • Designing reliable systems from unreliable components: The challenges of transistor variability and degradation
    • IEEE
    • S. Borkar, "Designing reliable systems from unreliable components: The challenges of transistor variability and degradation, " Micro, IEEE, 2005.
    • (2005) Micro
    • Borkar, S.1
  • 11
    • 79961002025 scopus 로고    scopus 로고
    • Optimal exact-regenerating codes for 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 the MSR and MBR points via a product-matrix construction, " IEEE Trans. on Inf. Th., Aug. 2011.
    • (2011) IEEE Trans. on Inf. Th.
    • Rashmi, K.V.1    Shah, N.B.2    Kumar, P.V.3
  • 14
    • 84867488223 scopus 로고    scopus 로고
    • Codes can reduce queueing delay in data centers
    • L. Huang, S. Pawar, H. Zhang, and K. Ramchandran, "Codes can reduce queueing delay in data centers, " in ISIT, 2012.
    • (2012) ISIT
    • Huang, L.1    Pawar, S.2    Zhang, H.3    Ramchandran, K.4
  • 15
    • 84875703553 scopus 로고    scopus 로고
    • Toward sustainable networking: Storage area networks with network coding
    • U. Ferner, M. Medard, and E. Soljanin, "Toward sustainable networking: Storage area networks with network coding, " in Allerton Conf., 2012.
    • (2012) Allerton Conf.
    • Ferner, U.1    Medard, M.2    Soljanin, E.3
  • 18
    • 84904439300 scopus 로고    scopus 로고
    • TOFEC: Achieving optimal throughputdelay trade-off of cloud storage using erasure codes
    • G. Liang and U. C. Kozat, "TOFEC: Achieving optimal throughputdelay trade-off of cloud storage using erasure codes, " in Infocom, 2014.
    • (2014) Infocom
    • Liang, G.1    Kozat, U.C.2
  • 20
    • 77955726417 scopus 로고    scopus 로고
    • Network coding for distributed storage systems
    • Sep
    • A. Dimakis et al., "Network coding for distributed storage systems, " IEEE Trans. on Inf. Th., Sep. 2010.
    • (2010) IEEE Trans. on Inf. Th.
    • Dimakis, A.1
  • 22
    • 84867559996 scopus 로고    scopus 로고
    • Access vs. Bandwidth in codes for storage
    • Jul
    • I. Tamo, Z. Wang, and J. Bruck, "Access vs. bandwidth in codes for storage, " in ISIT, Jul. 2012.
    • (2012) ISIT
    • Tamo, I.1    Wang, Z.2    Bruck, J.3


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