Multiple-cache pairing for fine-grained scalable video caching and networking

Qiushi Gong, John W. Woods, Koushik Kar, Jacob Chakareski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we consider fine-grained scalable video caching to provide video-on-demand (VoD) service, where exclusive- or (XOR) network coding is adopted to reduce data traffic. To further reduce backhaul data traffic, caches are grouped into pairs, which can be modeled as a maximum-weighted matching (MWM) problem. A heuristic harmony search algorithm is employed to solve the problem. Numerical results show that cache cooperating in pairs can help limiting backhaul data traffic. Further, the algorithm is shown to achieve greater backhaul traffic savings than other approximate MWM solutions.

Original languageEnglish (US)
Title of host publicationProceedings of the 14th International Conference on Future Internet Technologies, CFI 2019
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450372381
DOIs
StatePublished - Aug 7 2019
Externally publishedYes
Event14th International Conference on Future Internet Technologies, CFI 2019 - Phuket, Thailand
Duration: Aug 7 2019Aug 9 2019

Publication series

NameACM International Conference Proceeding Series

Conference

Conference14th International Conference on Future Internet Technologies, CFI 2019
Country/TerritoryThailand
CityPhuket
Period8/7/198/9/19

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Keywords

  • Fine-grained SVC
  • Harmony search
  • Network coding
  • Video caching

Fingerprint

Dive into the research topics of 'Multiple-cache pairing for fine-grained scalable video caching and networking'. Together they form a unique fingerprint.

Cite this