메뉴 건너뛰기




Volumn , Issue , 2014, Pages 844-852

Neptune: Efficient remote communication services for cloud backups

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS;

EID: 84904431198     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848012     Document Type: Conference Paper
Times cited : (17)

References (23)
  • 2
    • 84878195422 scopus 로고    scopus 로고
    • The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east
    • December
    • J. Gantz and D. Reinsel, "The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East," International Data Corporation (IDC) iView, December 2012.
    • (2012) International Data Corporation (IDC) IView
    • Gantz, J.1    Reinsel, D.2
  • 4
    • 85077115871 scopus 로고    scopus 로고
    • WAN optimized replication of backup datasets using stream-informed delta compression
    • P. Shilane, M. Huang, G. Wallace, and W. Hsu, "WAN Optimized Replication of Backup Datasets Using Stream-Informed Delta Compression," Proc. USENIX FAST, 2012.
    • (2012) Proc. USENIX FAST
    • Shilane, P.1    Huang, M.2    Wallace, G.3    Hsu, W.4
  • 5
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," Proc. STOC, pp. 604-613, 1998.
    • (1998) Proc. STOC , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 6
    • 84860536474 scopus 로고    scopus 로고
    • Locality-sensitive bloom filter for approximate membership query
    • Y. Hua, B. Xiao, B. Veeravalli, and D. Feng, "Locality-Sensitive Bloom Filter for Approximate Membership Query," IEEE Transactions on Computers, no. 6, pp. 817-830, 2012.
    • (2012) IEEE Transactions on Computers , Issue.6 , pp. 817-830
    • Hua, Y.1    Xiao, B.2    Veeravalli, B.3    Feng, D.4
  • 9
    • 0003676885 scopus 로고
    • Technical Report TR-81-15, Aiken Laboratory, Harvard University
    • M. Rabin, "Fingerprinting by random polynomials," Technical Report TR-81-15, Aiken Laboratory, Harvard University, 1981.
    • (1981) Fingerprinting by Random Polynomials
    • Rabin, M.1
  • 11
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 12
    • 55849116757 scopus 로고    scopus 로고
    • Bounded LSH for Similarity Search in Peer-to-Peer File Systems
    • Y. Hua, B. Xiao, D. Feng, and B. Yu, "Bounded LSH for Similarity Search in Peer-to-Peer File Systems," Proc. ICPP, pp. 644-651, 2008.
    • (2008) Proc. ICPP , pp. 644-651
    • Hua, Y.1    Xiao, B.2    Feng, D.3    Yu, B.4
  • 13
    • 84904438672 scopus 로고    scopus 로고
    • Los Alamos National Lab (LANL) File System Data
    • Los Alamos National Lab (LANL) File System Data, http://institute.lanl. gov/data/archive-data/.
  • 14
    • 85084162793 scopus 로고    scopus 로고
    • A framework for evaluating storage system security
    • E. Riedel, M. Kallahalla, and R. Swaminathan, "A framework for evaluating storage system security," Proc. FAST, pp. 15-30, 2002.
    • (2002) Proc. FAST , pp. 15-30
    • Riedel, E.1    Kallahalla, M.2    Swaminathan, R.3
  • 17
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," Information Theory, IEEE Transactions on, vol. 23, no. 3, pp. 337-343, 1977.
    • (1977) Information Theory, IEEE Transactions on , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


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