Audience-retention-rate-aware caching and coded video delivery with asynchronous demands
File(s)
Accepted version
Author(s)
Yang, qianqian
Mohammadi Amiri, mohammad
Gunduz, Deniz
Type
Journal Article
Abstract
Most of the current literature on coded caching
focus on a static scenario, in which a fixed number of users
synchronously place their requests from a content library, and
the performance is measured in terms of the latency in satisfying
all of these requests. In practice, however, users start watching an
online video content asynchronously over time, and often abort
watching a video before it is completed. The latter behaviour is
captured by the notion of audience retention rate, which measures
the portion of a video content watched on average. In order to
bring coded caching one step closer to practice, asynchronous
user demands are considered in this paper, by allowing user
demands to arrive randomly over time, and both the popularity
of video files, and the audience retention rates are taken into
account. A decentralized partial coded delivery (PCD) scheme
is proposed, and two cache allocation schemes are employed;
namely homogeneous cache allocation (HoCA) and heterogeneous
cache allocation (HeCA), which allocate users’ caches among
different chunks of the video files in the library. Numerical results
validate that the proposed PCD scheme, either with HoCA or
HeCA, outperforms conventional uncoded caching as well as the
state-of-the-art decentralized caching schemes, which consider
only the file popularities, and are designed for synchronous
demand arrivals. An information-theoretical lower bound on the
average delivery rate is also presented.
focus on a static scenario, in which a fixed number of users
synchronously place their requests from a content library, and
the performance is measured in terms of the latency in satisfying
all of these requests. In practice, however, users start watching an
online video content asynchronously over time, and often abort
watching a video before it is completed. The latter behaviour is
captured by the notion of audience retention rate, which measures
the portion of a video content watched on average. In order to
bring coded caching one step closer to practice, asynchronous
user demands are considered in this paper, by allowing user
demands to arrive randomly over time, and both the popularity
of video files, and the audience retention rates are taken into
account. A decentralized partial coded delivery (PCD) scheme
is proposed, and two cache allocation schemes are employed;
namely homogeneous cache allocation (HoCA) and heterogeneous
cache allocation (HeCA), which allocate users’ caches among
different chunks of the video files in the library. Numerical results
validate that the proposed PCD scheme, either with HoCA or
HeCA, outperforms conventional uncoded caching as well as the
state-of-the-art decentralized caching schemes, which consider
only the file popularities, and are designed for synchronous
demand arrivals. An information-theoretical lower bound on the
average delivery rate is also presented.
Date Issued
2019-10-01
Date Acceptance
2019-07-05
Citation
IEEE Transactions on Communications, 2019, 67 (10), pp.7088-7102
ISSN
0090-6778
Publisher
Institute of Electrical and Electronics Engineers
Start Page
7088
End Page
7102
Journal / Book Title
IEEE Transactions on Communications
Volume
67
Issue
10
Copyright Statement
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor
Commission of the European Communities
Commission of the European Communities
Grant Number
677854
675891
Subjects
0906 Electrical and Electronic Engineering
1005 Communications Technologies
0804 Data Format
Publication Status
Published
Date Publish Online
2019-07-23