4,903 research outputs found
Dynamic Rate Adaptation for Improved Throughput and Delay in Wireless Network Coded Broadcast
In this paper we provide theoretical and simulation-based study of the
delivery delay performance of a number of existing throughput optimal coding
schemes and use the results to design a new dynamic rate adaptation scheme that
achieves improved overall throughput-delay performance.
Under a baseline rate control scheme, the receivers' delay performance is
examined. Based on their Markov states, the knowledge difference between the
sender and receiver, three distinct methods for packet delivery are identified:
zero state, leader state and coefficient-based delivery. We provide analyses of
each of these and show that, in many cases, zero state delivery alone presents
a tractable approximation of the expected packet delivery behaviour.
Interestingly, while coefficient-based delivery has so far been treated as a
secondary effect in the literature, we find that the choice of coefficients is
extremely important in determining the delay, and a well chosen encoding scheme
can, in fact, contribute a significant improvement to the delivery delay.
Based on our delivery delay model, we develop a dynamic rate adaptation
scheme which uses performance prediction models to determine the sender
transmission rate. Surprisingly, taking this approach leads us to the simple
conclusion that the sender should regulate its addition rate based on the total
number of undelivered packets stored at the receivers. We show that despite its
simplicity, our proposed dynamic rate adaptation scheme results in noticeably
improved throughput-delay performance over existing schemes in the literature.Comment: 14 pages, 15 figure
Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities
Throughput and per-packet delay can present strong trade-offs that are
important in the cases of delay sensitive applications.We investigate such
trade-offs using a random linear network coding scheme for one or more
receivers in single hop wireless packet erasure broadcast channels. We capture
the delay sensitivities across different types of network applications using a
class of delay metrics based on the norms of packet arrival times. With these
delay metrics, we establish a unified framework to characterize the rate and
delay requirements of applications and optimize system parameters. In the
single receiver case, we demonstrate the trade-off between average packet
delay, which we view as the inverse of throughput, and maximum ordered
inter-arrival delay for various system parameters. For a single broadcast
channel with multiple receivers having different delay constraints and feedback
delays, we jointly optimize the coding parameters and time-division scheduling
parameters at the transmitters. We formulate the optimization problem as a
Generalized Geometric Program (GGP). This approach allows the transmitters to
adjust adaptively the coding and scheduling parameters for efficient allocation
of network resources under varying delay constraints. In the case where the
receivers are served by multiple non-interfering wireless broadcast channels,
the same optimization problem is formulated as a Signomial Program, which is
NP-hard in general. We provide approximation methods using successive
formulation of geometric programs and show the convergence of approximations.Comment: 9 pages, 10 figure
Random Linear Network Coding for 5G Mobile Video Delivery
An exponential increase in mobile video delivery will continue with the
demand for higher resolution, multi-view and large-scale multicast video
services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a
number of new opportunities for optimizing video delivery across both 5G core
and radio access networks. One of the promising approaches for video quality
adaptation, throughput enhancement and erasure protection is the use of
packet-level random linear network coding (RLNC). In this review paper, we
discuss the integration of RLNC into the 5G NR standard, building upon the
ideas and opportunities identified in 4G LTE. We explicitly identify and
discuss in detail novel 5G NR features that provide support for RLNC-based
video delivery in 5G, thus pointing out to the promising avenues for future
research.Comment: Invited paper for Special Issue "Network and Rateless Coding for
Video Streaming" - MDPI Informatio
Beyond the Min-Cut Bound: Deterministic Network Coding for Asynchronous Multirate Broadcast
In a single hop broadcast packet erasure network, we demonstrate that it is
possible to provide multirate packet delivery outside of what is given by the
network min-cut. This is achieved by using a deterministic non-block-based
network coding scheme, which allows us to sidestep some of the limitations put
in place by the block coding model used to determine the network capacity.
Under the network coding scheme we outline, the sender is able to transmit
network coded packets above the channel rate of some receivers, while ensuring
that they still experience nonzero delivery rates. Interestingly, in this
generalised form of asynchronous network coded broadcast, receivers are not
required to obtain knowledge of all packets transmitted so far. Instead, causal
feedback from the receivers about packet erasures is used by the sender to
determine a network coded transmission that will allow at least one, but often
multiple receivers, to deliver their next needed packet.
Although the analysis of deterministic coding schemes is generally a
difficult problem, by making some approximations we are able to obtain
tractable estimates of the receivers' delivery rates, which are shown to match
reasonably well with simulation. Using these estimates, we design a fairness
algorithm that allocates the sender's resources so all receivers will
experience fair delivery rate performance
From Instantly Decodable to Random Linear Network Coding
Our primary goal in this paper is to traverse the performance gap between two
linear network coding schemes: random linear network coding (RLNC) and
instantly decodable network coding (IDNC) in terms of throughput and decoding
delay. We first redefine the concept of packet generation and use it to
partition a block of partially-received data packets in a novel way, based on
the coding sets in an IDNC solution. By varying the generation size, we obtain
a general coding framework which consists of a series of coding schemes, with
RLNC and IDNC identified as two extreme cases. We then prove that the
throughput and decoding delay performance of all coding schemes in this coding
framework are bounded between the performance of RLNC and IDNC and hence
throughput-delay tradeoff becomes possible. We also propose implementations of
this coding framework to further improve its throughput and decoding delay
performance, to manage feedback frequency and coding complexity, or to achieve
in-block performance adaption. Extensive simulations are then provided to
verify the performance of the proposed coding schemes and their
implementations.Comment: 30 pages with double space, 14 color figure
- …