2,988 research outputs found
Updating Content in Cache-Aided Coded Multicast
Motivated by applications to delivery of dynamically updated, but correlated
data in settings such as content distribution networks, and distributed file
sharing systems, we study a single source multiple destination network coded
multicast problem in a cache-aided network. We focus on models where the caches
are primarily located near the destinations, and where the source has no cache.
The source observes a sequence of correlated frames, and is expected to do
frame-by-frame encoding with no access to prior frames. We present a novel
scheme that shows how the caches can be advantageously used to decrease the
overall cost of multicast, even though the source encodes without access to
past data. Our cache design and update scheme works with any choice of network
code designed for a corresponding cache-less network, is largely decentralized,
and works for an arbitrary network. We study a convex relation of the
optimization problem that results form the overall cost function. The results
of the optimization problem determines the rate allocation and caching
strategies. Numerous simulation results are presented to substantiate the
theory developed.Comment: To Appear in IEEE Journal on Selected Areas in Communications:
Special Issue on Caching for Communication Systems and Network
Dynamic algorithms for multicast with intra-session network coding
The problem of multiple multicast sessions with
intra-session network coding in time-varying networks is considered.
The network-layer capacity region of input rates that can be
stably supported is established. Dynamic algorithms for multicast
routing, network coding, power allocation, session scheduling, and
rate allocation across correlated sources, which achieve stability
for rates within the capacity region, are presented. This work
builds on the back-pressure approach introduced by Tassiulas
et al., extending it to network coding and correlated sources. In
the proposed algorithms, decisions on routing, network coding,
and scheduling between different sessions at a node are made
locally at each node based on virtual queues for different sinks.
For correlated sources, the sinks locally determine and control
transmission rates across the sources. The proposed approach
yields a completely distributed algorithm for wired networks.
In the wireless case, power control among different transmitters
is centralized while routing, network coding, and scheduling
between different sessions at a given node are distributed
Minimum-cost multicast over coded packet networks
We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved
Resource Allocation Frameworks for Network-coded Layered Multimedia Multicast Services
The explosive growth of content-on-the-move, such as video streaming to
mobile devices, has propelled research on multimedia broadcast and multicast
schemes. Multi-rate transmission strategies have been proposed as a means of
delivering layered services to users experiencing different downlink channel
conditions. In this paper, we consider Point-to-Multipoint layered service
delivery across a generic cellular system and improve it by applying different
random linear network coding approaches. We derive packet error probability
expressions and use them as performance metrics in the formulation of resource
allocation frameworks. The aim of these frameworks is both the optimization of
the transmission scheme and the minimization of the number of broadcast packets
on each downlink channel, while offering service guarantees to a predetermined
fraction of users. As a case of study, our proposed frameworks are then adapted
to the LTE-A standard and the eMBMS technology. We focus on the delivery of a
video service based on the H.264/SVC standard and demonstrate the advantages of
layered network coding over multi-rate transmission. Furthermore, we establish
that the choice of both the network coding technique and resource allocation
method play a critical role on the network footprint, and the quality of each
received video layer.Comment: IEEE Journal on Selected Areas in Communications - Special Issue on
Fundamental Approaches to Network Coding in Wireless Communication Systems.
To appea
- …