3 research outputs found
Cache Allocations for Consecutive Requests of Categorized Contents: Service Provider's Perspective
In wireless caching networks, a user generally has a concrete purpose of
consuming contents in a certain preferred category, and requests multiple
contents in sequence. While most existing research on wireless caching and
delivery has focused only on one-shot requests, the popularity distribution of
contents requested consecutively is definitely different from the one-shot
request and has been not considered. Also, especially from the perspective of
the service provider, it is advantageous for users to consume as many contents
as possible. Thus, this paper proposes two cache allocation policies for
categorized contents and consecutive user demands, which maximize 1) the cache
hit rate and 2) the number of consecutive content consumption, respectively.
Numerical results show how categorized contents and consecutive content
requests have impacts on the cache allocation.Comment: 7 pages, 5 figures, IEEE Wireless Communications and Networking
Conference (WCNC
Markov Decision Policies for Dynamic Video Delivery in Wireless Caching Networks
This paper proposes a video delivery strategy for dynamic streaming services
which maximizes time-average streaming quality under a playback delay
constraint in wireless caching networks. The network where popular videos
encoded by scalable video coding are already stored in randomly distributed
caching nodes is considered under adaptive video streaming concepts, and
distance-based interference management is investigated in this paper. In this
network model, a streaming user makes delay-constrained decisions depending on
stochastic network states: 1) caching node for video delivery, 2) video
quality, and 3) the quantity of video chunks to receive. Since wireless link
activation for video delivery may introduce delays, different timescales for
updating caching node association, video quality adaptation, and chunk amounts
are considered. After associating with a caching node for video delivery, the
streaming user chooses combinations of quality and chunk amounts in the small
timescale. The dynamic decision making process for video quality and chunk
amounts at each slot is modeled using Markov decision process, and the caching
node decision is made based on the framework of Lyapunov optimization. Our
intensive simulations verify that the proposed video delivery algorithm works
reliably and also can control the tradeoff between video quality and playback
latency.Comment: 28 pages, 11 figures, submission to IEEE TW
Joint Distributed Link Scheduling and Power Allocation for Content Delivery in Wireless Caching Networks
In wireless caching networks, the design of the content delivery method must
consider random user requests, caching states, network topology, and
interference management. In this paper, we establish a general framework for
content delivery in wireless caching networks without stringent assumptions
that restrict the network structure, delivery link, and interference model.
Based on the framework, we propose a dynamic and distributed link scheduling
and power allocation scheme for content delivery that is assisted by
belief-propagation (BP) algorithms. Considering content-requesting users and
potential caching nodes, the scheme achieves three critical purposes of
wireless caching networks: 1) limiting the delay of user request satisfactions,
2) maintaining the power efficiency of caching nodes, and 3) managing
interference among users. In addition, we address the intrinsic problem of the
BP algorithm in our network model, proposing a matching algorithm for
one-to-one link scheduling. Simulation results show that the proposed scheme
provides almost the same delay performance as the optimal scheme found through
an exhaustive search at the expense of a little additional power consumption
and does not require a clustering method and orthogonal resources in a
large-scale D2D network.Comment: 30 pages, 13 figure