85 research outputs found
On Content-centric Wireless Delivery Networks
The flux of social media and the convenience of mobile connectivity has
created a mobile data phenomenon that is expected to overwhelm the mobile
cellular networks in the foreseeable future. Despite the advent of 4G/LTE, the
growth rate of wireless data has far exceeded the capacity increase of the
mobile networks. A fundamentally new design paradigm is required to tackle the
ever-growing wireless data challenge.
In this article, we investigate the problem of massive content delivery over
wireless networks and present a systematic view on content-centric network
design and its underlying challenges. Towards this end, we first review some of
the recent advancements in Information Centric Networking (ICN) which provides
the basis on how media contents can be labeled, distributed, and placed across
the networks. We then formulate the content delivery task into a content rate
maximization problem over a share wireless channel, which, contrasting the
conventional wisdom that attempts to increase the bit-rate of a unicast system,
maximizes the content delivery capability with a fixed amount of wireless
resources. This conceptually simple change enables us to exploit the "content
diversity" and the "network diversity" by leveraging the abundant computation
sources (through application-layer encoding, pushing and caching, etc.) within
the existing wireless networks. A network architecture that enables wireless
network crowdsourcing for content delivery is then described, followed by an
exemplary campus wireless network that encompasses the above concepts.Comment: 20 pages, 7 figures,accepted by IEEE Wireless
Communications,Sept.201
Backhaul-Aware Caching Placement for Wireless Networks
As the capacity demand of mobile applications keeps increasing, the backhaul
network is becoming a bottleneck to support high quality of experience (QoE) in
next-generation wireless networks. Content caching at base stations (BSs) is a
promising approach to alleviate the backhaul burden and reduce user-perceived
latency. In this paper, we consider a wireless caching network where all the
BSs are connected to a central controller via backhaul links. In such a
network, users can obtain the required data from candidate BSs if the data are
pre-cached. Otherwise, the user data need to be first retrieved from the
central controller to local BSs, which introduces extra delay over the
backhaul. In order to reduce the download delay, the caching placement strategy
needs to be optimized. We formulate such a design problem as the minimization
of the average download delay over user requests, subject to the caching
capacity constraint of each BS. Different from existing works, our model takes
BS cooperation in the radio access into consideration and is fully aware of the
propagation delay on the backhaul links. The design problem is a mixed integer
programming problem and is highly complicated, and thus we relax the problem
and propose a low-complexity algorithm. Simulation results will show that the
proposed algorithm can effectively determine the near-optimal caching placement
and provide significant performance gains over conventional caching placement
strategies.Comment: 6 pages, 3 figures, accepted to IEEE Globecom, San Diego, CA, Dec.
201
- …