메뉴 건너뛰기




Volumn 56, Issue 7, 2012, Pages 2001-2013

S-CLONE: Socially-aware data replication for social networks

Author keywords

Data replication; Distributed storage; Online social networks

Indexed keywords

COMPETITIVE EDGES; DATA REPLICATION; DISTRIBUTED STORAGE; EVALUATION STUDY; IMPROVE-A; ITS DATA; ONLINE SOCIAL NETWORKS; SOCIAL NETWORKS; SOCIAL RELATIONSHIPS; USER ACTIVITY;

EID: 84859444500     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2012.02.010     Document Type: Article
Times cited : (46)

References (19)
  • 4
    • 0036038685 scopus 로고    scopus 로고
    • Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
    • DOI 10.1145/502059.502053
    • A. Rowstron, and P. Druschel Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility SIGOPS Oper. Syst. Rev 35 2001 188 201 (Pubitemid 33612614)
    • (2001) Operating Systems Review (ACM) , vol.35 , Issue.5 , pp. 188-201
    • Rowstron, A.1    Druschel, P.2
  • 12
    • 77955933052 scopus 로고    scopus 로고
    • Cassandra: A decentralized structured storage system
    • A. Lakshman, and P. Malik Cassandra: a decentralized structured storage system SIGOPS Oper. Syst. Rev. 44 2010 35 40
    • (2010) SIGOPS Oper. Syst. Rev. , vol.44 , pp. 35-40
    • Lakshman, A.1    Malik, P.2
  • 17
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A.L. Barabási, and R. Albert Emergence of scaling in random networks Science 286 1999 509 512
    • (1999) Science , vol.286 , pp. 509-512
    • Barabási, A.L.1    Albert, R.2
  • 18
    • 41349117788 scopus 로고    scopus 로고
    • Finding community structure in very large networks
    • A. Clauset, M.E.J. Newman, and C. Moore Finding community structure in very large networks Phys. Rev. E 2004 1 6
    • (2004) Phys. Rev. e , pp. 1-6
    • Clauset, A.1    Newman, M.E.J.2    Moore, C.3
  • 19
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • PII S1064827595287997
    • G. Karypis, and V. Kumar A fast and high quality multilevel scheme for partitioning irregular graphs SIAM J. Sci. Comput. 20 1998 359 392 doi: http://dx.doi.org/10.1137/S1064 827595287997. http://dx.doi.org/10.1137/ S1064827595287997 (Pubitemid 128689516)
    • (1998) SIAM Journal of Scientific Computing , vol.20 , Issue.1 , pp. 359-392
    • Karypis, G.1    Kumar, V.2


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