911 research outputs found
Distributed Rate Allocation Policies for Multi-Homed Video Streaming over Heterogeneous Access Networks
We consider the problem of rate allocation among multiple simultaneous video
streams sharing multiple heterogeneous access networks. We develop and evaluate
an analytical framework for optimal rate allocation based on observed available
bit rate (ABR) and round-trip time (RTT) over each access network and video
distortion-rate (DR) characteristics. The rate allocation is formulated as a
convex optimization problem that minimizes the total expected distortion of all
video streams. We present a distributed approximation of its solution and
compare its performance against H-infinity optimal control and two heuristic
schemes based on TCP-style additive-increase-multiplicative decrease (AIMD)
principles. The various rate allocation schemes are evaluated in simulations of
multiple high-definition (HD) video streams sharing multiple access networks.
Our results demonstrate that, in comparison with heuristic AIMD-based schemes,
both media-aware allocation and H-infinity optimal control benefit from
proactive congestion avoidance and reduce the average packet loss rate from 45%
to below 2%. Improvement in average received video quality ranges between 1.5
to 10.7 dB in PSNR for various background traffic loads and video playout
deadlines. Media-aware allocation further exploits its knowledge of the video
DR characteristics to achieve a more balanced video quality among all streams.Comment: 12 pages, 22 figure
Neural-Kalman Schemes for Non-Stationary Channel Tracking and Learning
This Thesis focuses on channel tracking in Orthogonal Frequency-Division Multiplexing (OFDM), a
widely-used method of data transmission in wireless communications, when abrupt changes occur
in the channel. In highly mobile applications, new dynamics appear that might make channel
tracking non-stationary, e.g. channels might vary with location, and location rapidly varies with
time. Simple examples might be the di erent channel dynamics a train receiver faces when it is
close to a station vs. crossing a bridge vs. entering a tunnel, or a car receiver in a route that
grows more tra c-dense. Some of these dynamics can be modelled as channel taps dying or being
reborn, and so tap birth-death detection is of the essence.
In order to improve the quality of communications, we delved into mathematical methods to
detect such abrupt changes in the channel, such as the mathematical areas of Sequential Analysis/
Abrupt Change Detection and Random Set Theory (RST), as well as the engineering advances
in Neural Network schemes. This knowledge helped us nd a solution to the problem of abrupt
change detection by informing and inspiring the creation of low-complexity implementations for
real-world channel tracking. In particular, two such novel trackers were created: the Simpli-
ed Maximum A Posteriori (SMAP) and the Neural-Network-switched Kalman Filtering (NNKF)
schemes.
The SMAP is a computationally inexpensive, threshold-based abrupt-change detector. It applies
the three following heuristics for tap birth-death detection: a) detect death if the tap gain
jumps into approximately zero (memoryless detection); b) detect death if the tap gain has slowly
converged into approximately zero (memory detection); c) detect birth if the tap gain is far from
zero.
The precise parameters for these three simple rules can be approximated with simple theoretical
derivations and then ne-tuned through extensive simulations. The status detector for each
tap using only these three computationally inexpensive threshold comparisons achieves an error
reduction matching that of a close-to-perfect path death/birth detection, as shown in simulations.
This estimator was shown to greatly reduce channel tracking error in the target Signal-to-Noise
Ratio (SNR) range at a very small computational cost, thus outperforming previously known systems.
The underlying RST framework for the SMAP was then extended to combined death/birth
and SNR detection when SNR is dynamical and may drift. We analyzed how di erent quasi-ideal
SNR detectors a ect the SMAP-enhanced Kalman tracker's performance. Simulations showed
SMAP is robust to SNR drift in simulations, although it was also shown to bene t from an accurate
SNR detection.
The core idea behind the second novel tracker, NNKFs, is similar to the SMAP, but now the tap
birth/death detection will be performed via an arti cial neuronal network (NN). Simulations show
that the proposed NNKF estimator provides extremely good performance, practically identical to a detector with 100% accuracy.
These proposed Neural-Kalman schemes can work as novel trackers for multipath channels,
since they are robust to wide variations in the probabilities of tap birth and death. Such robustness
suggests a single, low-complexity NNKF could be reusable over di erent tap indices and
communication environments.
Furthermore, a di erent kind of abrupt change was proposed and analyzed: energy shifts from
one channel tap to adjacent taps (partial tap lateral hops). This Thesis also discusses how to
model, detect and track such changes, providing a geometric justi cation for this and additional
non-stationary dynamics in vehicular situations, such as road scenarios where re ections on trucks
and vans are involved, or the visual appearance/disappearance of drone swarms. An extensive
literature review of empirically-backed abrupt-change dynamics in channel modelling/measuring
campaigns is included.
For this generalized framework of abrupt channel changes that includes partial tap lateral
hopping, a neural detector for lateral hops with large energy transfers is introduced. Simulation
results suggest the proposed NN architecture might be a feasible lateral hop detector, suitable for
integration in NNKF schemes.
Finally, the newly found understanding of abrupt changes and the interactions between Kalman
lters and neural networks is leveraged to analyze the neural consequences of abrupt changes
and brie y sketch a novel, abrupt-change-derived stochastic model for neural intelligence, extract
some neuro nancial consequences of unstereotyped abrupt dynamics, and propose a new
portfolio-building mechanism in nance: Highly Leveraged Abrupt Bets Against Failing Experts
(HLABAFEOs). Some communication-engineering-relevant topics, such as a Bayesian stochastic
stereotyper for hopping Linear Gauss-Markov (LGM) models, are discussed in the process.
The forecasting problem in the presence of expert disagreements is illustrated with a hopping
LGM model and a novel structure for a Bayesian stereotyper is introduced that might eventually
solve such problems through bio-inspired, neuroscienti cally-backed mechanisms, like dreaming
and surprise (biological Neural-Kalman). A generalized framework for abrupt changes and expert
disagreements was introduced with the novel concept of Neural-Kalman Phenomena. This Thesis
suggests mathematical (Neural-Kalman Problem Category Conjecture), neuro-evolutionary and
social reasons why Neural-Kalman Phenomena might exist and found signi cant evidence for their
existence in the areas of neuroscience and nance.
Apart from providing speci c examples, practical guidelines and historical (out)performance
for some HLABAFEO investing portfolios, this multidisciplinary research suggests that a Neural-
Kalman architecture for ever granular stereotyping providing a practical solution for continual
learning in the presence of unstereotyped abrupt dynamics would be extremely useful in communications
and other continual learning tasks.Programa de Doctorado en Multimedia y Comunicaciones por la Universidad Carlos III de Madrid y la Universidad Rey Juan CarlosPresidente: Luis Castedo Ribas.- Secretaria: Ana GarcĂa Armada.- Vocal: JosĂ© Antonio Portilla Figuera
Proposed Fuzzy Real-Time HaPticS Protocol Carrying Haptic Data and Multisensory Streams
Sensory and haptic data transfers to critical real-time applications over the Internet require better than best effort transport, strict timely and reliable ordered deliveries. Multi-sensory applications usually include video and audio streams with real-time control and sensory data, which aggravate and compress within real-time flows. Such real-time are vulnerable to synchronization to synchronization problems, if combined with poor Internet links. Apart from the use of differentiated QoS and MPLS services, several haptic transport protocols have been proposed to confront such issues, focusing on minimizing flows rate disruption while maintaining a steady transmission rate at the sender. Nevertheless, these protocols fail to cope with network variations and queuing delays posed by the Internet routers.
This paper proposes a new haptic protocol that tries to alleviate such inadequacies using three different metrics: mean frame delay, jitter and frame loss calculated at the receiver end and propagated to the sender. In order to dynamically adjust flow rate in a fuzzy controlled manners, the proposed protocol includes a fuzzy controller to its protocol structure. The proposed FRTPS protocol (Fuzzy Real-Time haPticS protocol), utilizes crisp inputs into a fuzzification process followed by fuzzy control rules in order to calculate a crisp level output service class, denoted as Service Rate Level (SRL). The experimental results of FRTPS over RTP show that FRTPS outperforms RTP in cases of congestion incidents, out of order deliveries and goodput
PBE-CC: Congestion Control via Endpoint-Centric, Physical-Layer Bandwidth Measurements
Wireless networks are becoming ever more sophisticated and overcrowded,
imposing the most delay, jitter, and throughput damage to end-to-end network
flows in today's internet. We therefore argue for fine-grained mobile
endpoint-based wireless measurements to inform a precise congestion control
algorithm through a well-defined API to the mobile's wireless physical layer.
Our proposed congestion control algorithm is based on Physical-Layer Bandwidth
measurements taken at the Endpoint (PBE-CC), and captures the latest 5G New
Radio innovations that increase wireless capacity, yet create abrupt rises and
falls in available wireless capacity that the PBE-CC sender can react to
precisely and very rapidly. We implement a proof-of-concept prototype of the
PBE measurement module on software-defined radios and the PBE sender and
receiver in C. An extensive performance evaluation compares PBE-CC head to head
against the leading cellular-aware and wireless-oblivious congestion control
protocols proposed in the research community and in deployment, in mobile and
static mobile scenarios, and over busy and quiet networks. Results show 6.3%
higher average throughput than BBR, while simultaneously reducing 95th
percentile delay by 1.8x
End-to-End Simulation of 5G mmWave Networks
Due to its potential for multi-gigabit and low latency wireless links,
millimeter wave (mmWave) technology is expected to play a central role in 5th
generation cellular systems. While there has been considerable progress in
understanding the mmWave physical layer, innovations will be required at all
layers of the protocol stack, in both the access and the core network.
Discrete-event network simulation is essential for end-to-end, cross-layer
research and development. This paper provides a tutorial on a recently
developed full-stack mmWave module integrated into the widely used open-source
ns--3 simulator. The module includes a number of detailed statistical channel
models as well as the ability to incorporate real measurements or ray-tracing
data. The Physical (PHY) and Medium Access Control (MAC) layers are modular and
highly customizable, making it easy to integrate algorithms or compare
Orthogonal Frequency Division Multiplexing (OFDM) numerologies, for example.
The module is interfaced with the core network of the ns--3 Long Term Evolution
(LTE) module for full-stack simulations of end-to-end connectivity, and
advanced architectural features, such as dual-connectivity, are also available.
To facilitate the understanding of the module, and verify its correct
functioning, we provide several examples that show the performance of the
custom mmWave stack as well as custom congestion control algorithms designed
specifically for efficient utilization of the mmWave channel.Comment: 25 pages, 16 figures, submitted to IEEE Communications Surveys and
Tutorials (revised Jan. 2018
The Efficiency of Transport Protocols in Current and Future Mobile Networks
Legacy transport protocols like TCP and its variants have been mainly designed for static and fixed networks and perform inefficiently over cellular networks. Although these protocols have seen major improvements during the past years, they still suffer from the high channel variability of cellular networks. Thomas Pötsch investigates the channel properties of cellular networks and analyzes the effects that cause performance degradation of transport protocols. Inspired by the findings, a novel delay-based congestion control protocol called Verus is proposed and evaluated across a variety of network scenarios. Further, the author develops a stochastic two-dimensional discrete-time Markov modeling approach that dramatically simplifies the understanding of delay-based congestion control protocols
New RED-type TCP-AQM algorithms based on beta distribution drop functions
In recent years, Active Queue Management (AQM) mechanisms to improve the
performance of TCP/IP networks have acquired a relevant role. In this paper we
present a simple and robust RED-type algorithm together with a couple of
dynamical variants with the ability to adapt to the specific characteristics of
different network environments, as well as to the user needs. We first present
a basic version called Beta RED (BetaRED), where the user is free to adjust the
parameters according to the network conditions. The aim is to make the
parameter setting easy and intuitive so that a good performance is obtained
over a wide range of parameters. Secondly, BetaRED is used as a framework to
design two dynamic algorithms, which we will call Adaptive Beta RED (ABetaRED)
and Dynamic Beta RED (DBetaRED). In those new algorithms certain parameters are
dynamically adjusted so that the queue length remains stable around a
predetermined reference value and according to changing network traffic
conditions. Finally, we present a battery of simulations using the Network
Simulator 3 (ns-3) software with a two-fold objective: to guide the user on how
to adjust the parameters of the BetaRED mechanism, and to show a performance
comparison of ABetaRED and DBetaRED with other representative algorithms that
pursue a similar objective
Rate Control State-of-the-art Survey
The majority of Internet traffic use Transmission Control Protocol (TCP) as the transport level protocol. It provides a reliable ordered byte stream for the applications. However, applications such as live video streaming place an emphasis on timeliness over reliability. Also a smooth sending rate can be desirable over sharp changes in the sending rate. For these applications TCP is not necessarily suitable. Rate control attempts to address the demands of these applications. An important design feature in all rate control mechanisms is TCP friendliness. We should not negatively impact TCP performance since it is still the dominant protocol. Rate Control mechanisms are classified into two different mechanisms: window-based mechanisms and rate-based mechanisms. Window-based mechanisms increase their sending rate after a successful transfer of a window of packets similar to TCP. They typically decrease their sending rate sharply after a packet loss. Rate-based solutions control their sending rate in some other way. A large subset of rate-based solutions are called equation-based solutions. Equation-based solutions have a control equation which provides an allowed sending rate. Typically these rate-based solutions react slower to both packet losses and increases in available bandwidth making their sending rate smoother than that of window-based solutions. This report contains a survey of rate control mechanisms and a discussion of their relative strengths and weaknesses. A section is dedicated to a discussion on the enhancements in wireless environments. Another topic in the report is bandwidth estimation. Bandwidth estimation is divided into capacity estimation and available bandwidth estimation. We describe techniques that enable the calculation of a fair sending rate that can be used to create novel rate control mechanisms.Peer reviewe
Performance enhancement of large scale networks with heterogeneous traffic.
Finally, these findings are applied towards improving the performance of the Differentiated Services architecture by developing a new Refined Assured Forwarding framework where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to the existing Diffserv routers. The efficiency of the new architecture in enhancing the performance of Diffserv is demonstrated by simulation results under different traffic scenarios.This dissertation builds on the notion that segregating traffic with disparate characteristics into separate channels generally results in a better performance. Through a quantitative analysis, it precisely defines the number of classes and the allocation of traffic into these classes that will lead to optimal performance from a latency standpoint. Additionally, it weakens the most generally used assumption of exponential or geometric distribution of traffic service time in the integration versus segregation studies to date by including self-similarity in network traffic.The dissertation also develops a pricing model based on resource usage in a system with segregated channels. Based on analytical results, this dissertation proposes a scheme whereby a service provider can develop compensatory and fair prices for customers with varying QoS requirements under a wide variety of ambient traffic scenarios.This dissertation provides novel techniques for improving the Quality of Service by enhancing the performance of queue management in large scale packet switched networks with a high volume of traffic. Networks combine traffic from multiple sources which have disparate characteristics. Multiplexing such heterogeneous traffic usually results in adverse effects on the overall performance of the network
- …