메뉴 건너뛰기
Performance Evaluation Review
Volumn 37, Issue 2, 2009, Pages 71-72
Self-organizing algorithms for cache cooperation in content distribution networks
Author keywords

[No Author keywords available]
Indexed keywords

EID: 78651415644     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1639562.1639591     Document Type: Conference Paper
Times cited : (4)
References (4)
  • 1
    • 46149105082 scopus 로고    scopus 로고
    • Approximation algorithms for data placement in arbitrary networks
    • I.D. Baev, R. Rajaraman (2001). Approximation algorithms for data placement in arbitrary networks. Proc. SODA 2001, 661-670.
    • (2001) Proc. SODA 2001 , pp. 661-670
    • Baev, I.D.1    Rajaraman, R.2
  • 2
    • 55249124781 scopus 로고    scopus 로고
    • Approximation algorithms for data placement problems
    • I.D. Baev, R. Rajaraman, C. Swamy (2008). Approximation algorithms for data placement problems. SIAM J. Comput 38, 1411-1429.
    • (2008) SIAM J. Comput , vol.38 , pp. 1411-1429
    • Baev, I.D.1    Rajaraman, R.2    Swamy, C.3
  • 3
    • 78651430163 scopus 로고    scopus 로고
    • Self-organizing algorithms for cache cooperation in content distribution networks
    • Bell Labs
    • S.C. Borst, V. Gupta, A. Walid (2008). Self-organizing algorithms for cache cooperation in content distribution networks. Technical Memorandum, Alcatel-Lucent, Bell Labs.
    • (2008) Technical Memorandum, Alcatel-lucent
    • Borst, S.C.1    Gupta, V.2    Walid, A.3
  • 4
    • 0027695566 scopus 로고
    • Replication algorithms in a remote caching architecture
    • A. Leff, J.L. Wolf, P.S. Yu (1993). Replication algorithms in a remote caching architecture. IEEE Trans. Parallel Distr. Syst. 4 (11), 1185-1204.
    • (1993) IEEE Trans. Parallel Distr. Syst. , vol.4 , Issue.11 , pp. 1185-1204
    • Leff, A.1    Wolf, J.L.2    Yu, P.S.3

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