687 research outputs found
Mitigating Interference in Content Delivery Networks by Spatial Signal Alignment: The Approach of Shot-Noise Ratio
Multimedia content especially videos is expected to dominate data traffic in
next-generation mobile networks. Caching popular content at the network edge
has emerged to be a solution for low-latency content delivery. Compared with
the traditional wireless communication, content delivery has a key
characteristic that many signals coexisting in the air carry identical popular
content. They, however, can interfere with each other at a receiver if their
modulation-and-coding (MAC) schemes are adapted to individual channels
following the classic approach. To address this issue, we present a novel idea
of content adaptive MAC (CAMAC) where adapting MAC schemes to content ensures
that all signals carry identical content are encoded using an identical MAC
scheme, achieving spatial MAC alignment. Consequently, interference can be
harnessed as signals, to improve the reliability of wireless delivery. In the
remaining part of the paper, we focus on quantifying the gain CAMAC can bring
to a content-delivery network using a stochastic-geometry model. Specifically,
content helpers are distributed as a Poisson point process, each of which
transmits a file from a content database based on a given popularity
distribution. It is discovered that the successful content-delivery probability
is closely related to the distribution of the ratio of two independent shot
noise processes, named a shot-noise ratio. The distribution itself is an open
mathematical problem that we tackle in this work. Using stable-distribution
theory and tools from stochastic geometry, the distribution function is derived
in closed form. Extending the result in the context of content-delivery
networks with CAMAC yields the content-delivery probability in different closed
forms. In addition, the gain in the probability due to CAMAC is shown to grow
with the level of skewness in the content popularity distribution.Comment: 32 pages, to appear in IEEE Trans. on Wireless Communicatio
Evaluation of HTTP/DASH Adaptation Algorithms on Vehicular Networks
Video streaming currently accounts for the majority of Internet traffic. One
factor that enables video streaming is HTTP Adaptive Streaming (HAS), that
allows the users to stream video using a bit rate that closely matches the
available bandwidth from the server to the client. MPEG Dynamic Adaptive
Streaming over HTTP (DASH) is a widely used standard, that allows the clients
to select the resolution to download based on their own estimations. The
algorithm for determining the next segment in a DASH stream is not partof the
standard, but it is an important factor in the resulting playback quality.
Nowadays vehicles are increasingly equipped with mobile communication devices,
and in-vehicle multimedia entertainment systems. In this paper, we evaluate the
performance of various DASH adaptation algorithms over a vehicular network. We
present detailed simulation results highlighting the advantages and
disadvantages of various adaptation algorithms in delivering video content to
vehicular users, and we show how the different adaptation algorithms perform in
terms of throughput, playback interruption time, and number of interruptions
Secure and Private Cloud Storage Systems with Random Linear Fountain Codes
An information theoretic approach to security and privacy called Secure And
Private Information Retrieval (SAPIR) is introduced. SAPIR is applied to
distributed data storage systems. In this approach, random combinations of all
contents are stored across the network. Our coding approach is based on Random
Linear Fountain (RLF) codes. To retrieve a content, a group of servers
collaborate with each other to form a Reconstruction Group (RG). SAPIR achieves
asymptotic perfect secrecy if at least one of the servers within an RG is not
compromised. Further, a Private Information Retrieval (PIR) scheme based on
random queries is proposed. The PIR approach ensures the users privately
download their desired contents without the servers knowing about the requested
contents indices. The proposed scheme is adaptive and can provide privacy
against a significant number of colluding servers.Comment: 8 pages, 2 figure
Vehicular Inter-Networking via Named Data
In this paper we apply the Named Data Networking, a newly proposed Internet
architecture, to networking vehicles on the run. Our initial design, dubbed
V-NDN, illustrates NDN's promising potential in providing a unifying
architecture that enables networking among all computing devices independent
from whether they are connected through wired infrastructure, ad hoc, or
intermittent DTN. This paper describes the prototype implementation of V-NDN
and its preliminary performance assessment
- …