• DocumentCode
    172368
  • Title

    Distributed caching and coding in VoD

  • Author

    Pourmir, Arezou ; Ramanathan, Parmesh

  • Author_Institution
    Electr. & Comput. Eng. Dept., Univ. of Wisconsin, Madison, WI, USA
  • fYear
    2014
  • fDate
    April 27 2014-May 2 2014
  • Firstpage
    233
  • Lastpage
    238
  • Abstract
    Caching decreases content access time by keeping contents closer to the clients. In this paper we show that network coding chunks of different contents and storing them in cache, can be beneficial. Recent research considers caching network coded chunks of same content, but not different contents. This paper proposes three different methods, IP, layered-IP and Greedy algorithm, with different performance and complexity. Simulation results show that caching encoded chunks of different contents can significantly reduce the average data access time. Although we evaluate our ideas using Video on Demand (VoD) application on cable networks, they can be extended to broader contexts including content distribution in peer-to-peer networks and proxy web caches.
  • Keywords
    IP networks; Internet; cache storage; client-server systems; computational complexity; greedy algorithms; integer programming; network coding; peer-to-peer computing; video on demand; VoD application; average data access time; binary integer program; cable networks; caching network coded chunks; content distribution; greedy algorithm; layered-IP methods; peer-to-peer networks; proxy Web cache; video on demand application; Arrays; Conferences; Encoding; IP networks; Mathematical model; Probability; Servers; Binary Integer Program; caching; network coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications Workshops (INFOCOM WKSHPS), 2014 IEEE Conference on
  • Conference_Location
    Toronto, ON
  • Type

    conf

  • DOI
    10.1109/INFCOMW.2014.6849237
  • Filename
    6849237