메뉴 건너뛰기




Volumn , Issue , 2015, Pages 98-107

Coded caching under arbitrary popularity distributions

Author keywords

Additives; Servers

Indexed keywords

ADDITIVES; SERVERS;

EID: 84961782803     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2015.7308972     Document Type: Conference Paper
Times cited : (88)

References (17)
  • 3
    • 84861589601 scopus 로고    scopus 로고
    • Femto caching: Wireless video content delivery through distributed caching helpers
    • Orlando, USA, Mar.
    • N. Golrezaei, K. Shanmugam, A.G. Dimakis, A.F. Molisch and G. Caire, "FemtoCaching: Wireless Video Content Delivery through Distributed Caching Helpers", in Pmc. IEEE INFOCOM, Orlando, USA, Mar. 2012.
    • (2012) Pmc IEEE INFOCOM
    • Golrezaei, N.1    Shanmugam, K.2    Dimakis, A.G.3    Molisch, A.F.4    Caire, G.5
  • 4
    • 84904440640 scopus 로고    scopus 로고
    • Performance evaluation and asymptotics for content delivery networks
    • Toronto, Canada, Apr.
    • V. Shah and G. de Veciana, "Performance Evaluation and Asymptotics for Content Delivery Networks", in Pmc. IEEE INFOCOM, Toronto, Canada, Apr. 2014.
    • (2014) Pmc. IEEE INFOCOM
    • Shah, V.1    De Veciana, G.2
  • 5
    • 84876292188 scopus 로고    scopus 로고
    • Optimal content placement for peerto-peer video-on-demand systems
    • Apr.
    • B. Tan and L. Massoulie, "Optimal Content Placement for Peerto-Peer Video-on-Demand Systems", IEEEIACM Trans. Netw., vol. 21, no. 2, pp. 566-579, Apr. 2013.
    • (2013) IEEEIACM Trans. Netw. , vol.21 , Issue.2 , pp. 566-579
    • Tan, B.1    Massoulie, L.2
  • 6
    • 84899645734 scopus 로고    scopus 로고
    • Fundamental limits of caching
    • May
    • M. A. Maddah-Ali, and U. Niesen, "Fundamental Limits of Caching", IEEE Trans. Inform. Theory, vol. 60, no. 5, pp. 2856-2867, May 2014.
    • (2014) IEEE Trans. Inform. Theory , vol.60 , Issue.5 , pp. 2856-2867
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 7
    • 85027907954 scopus 로고    scopus 로고
    • Decentralized coded caching attains order-optimal memory-rate tradeoff
    • to appear
    • M. A. Maddah-Ali, and U. Niesen, "Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff", IEEEIACM Trans. Netw., to appear.
    • IEEEIACM Trans. Netw.
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 15
    • 1442325902 scopus 로고
    • Mean, median and mode in binomial distributions
    • Mar.
    • R. Kaas and J.M. Buhrman, "Mean, Median and Mode in Binomial Distributions", Statistiea Neerlandiea, vol. 34, no. I, pp. 13-18, Mar. 1980.
    • (1980) Statistiea Neerlandiea , vol.34 , Issue.1 , pp. 13-18
    • Kaas, R.1    Buhrman, J.M.2
  • 16
    • 0035693331 scopus 로고    scopus 로고
    • LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies
    • D. Lee, S. H. Noh, S. L. Min, J. Choi, J. H. Kim, Y. K. Cho and C. S. Kim, "LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies", IEEE Trans. ComputeIs, vol. 50, no. 12, pp. 1352-1361, 2001.
    • (2001) IEEE Trans. ComputeIs , vol.50 , Issue.12 , pp. 1352-1361
    • Lee, D.1    Noh, S.H.2    Min, S.L.3    Choi, J.4    Kim, J.H.5    Cho, Y.K.6    Kim, C.S.7


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