English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The emergence of novel interactive multimedia applications with high rate andlow latency requirements has led to a drastic increase in the video datatraffic over wireless cellular networks. Endowing the small base stations of amacro-cell with caches that can store some of the content is a promisingtechnology to cope with the increasing pressure on the backhaul connections,and to reduce the delay for demanding video applications. In this work,delivery of an interactive multiview video to a set of wireless users isstudied in an heterogeneous cellular network. Differently from existing worksthat focus on the optimization of the delivery delay and ignore the videocharacteristics, the caching and scheduling policies are jointly optimized,taking into account the quality of the delivered video and the video deliverytime constraints. We formulate our joint caching and scheduling problem as theaverage expected video distortion minimization, and show that this problem isNP-hard. We then provide an equivalent formulation based on submodular setfunction maximization and propose a greedy solution with$\frac{1}{2}(1-\mbox{e}^{-1})$ approximation guarantee. The evaluation of theproposed joint caching and scheduling policy shows that it significantlyoutperforms benchmark algorithms based on popularity caching and independentscheduling. Another important contribution of this paper is a new constantapproximation ratio for the greedy submodular set function maximization subjectto a $d$-dimensional knapsack constraint.

Cache-Aided Interactive Multiview Video Streaming in Small Cell Wireless Networks