1,664 research outputs found
A genetic approach to Markovian characterisation of H.264 scalable video
We propose an algorithm for multivariate Markovian characterisation of H.264/SVC scalable video traces at the sub-GoP (Group of Pictures) level. A genetic algorithm yields Markov models with limited state space that accurately capture temporal and inter-layer correlation. Key to our approach is the covariance-based fitness function. In comparison with the classical Expectation Maximisation algorithm, ours is capable of matching the second order statistics more accurately at the cost of less accuracy in matching the histograms of the trace. Moreover, a simulation study shows that our approach outperforms Expectation Maximisation in predicting performance of video streaming in various networking scenarios
The pseudo-self-similar traffic model: application and validation
Since the early 1990Āæs, a variety of studies has shown that network traffic, both for local- and wide-area networks, has self-similar properties. This led to new approaches in network traffic modelling because most traditional traffic approaches result in the underestimation of performance measures of interest. Instead of developing completely new traffic models, a number of researchers have proposed to adapt traditional traffic modelling approaches to incorporate aspects of self-similarity. The motivation for doing so is the hope to be able to reuse techniques and tools that have been developed in the past and with which experience has been gained. One such approach for a traffic model that incorporates aspects of self-similarity is the so-called pseudo self-similar traffic model. This model is appealing, as it is easy to understand and easily embedded in Markovian performance evaluation studies. In applying this model in a number of cases, we have perceived various problems which we initially thought were particular to these specific cases. However, we recently have been able to show that these problems are fundamental to the pseudo self-similar traffic model. In this paper we review the pseudo self-similar traffic model and discuss its fundamental shortcomings. As far as we know, this is the first paper that discusses these shortcomings formally. We also report on ongoing work to overcome some of these problems
Flow Level QoE of Video Streaming in Wireless Networks
The Quality of Experience (QoE) of streaming service is often degraded by
frequent playback interruptions. To mitigate the interruptions, the media
player prefetches streaming contents before starting playback, at a cost of
delay. We study the QoE of streaming from the perspective of flow dynamics.
First, a framework is developed for QoE when streaming users join the network
randomly and leave after downloading completion. We compute the distribution of
prefetching delay using partial differential equations (PDEs), and the
probability generating function of playout buffer starvations using ordinary
differential equations (ODEs) for CBR streaming. Second, we extend our
framework to characterize the throughput variation caused by opportunistic
scheduling at the base station, and the playback variation of VBR streaming.
Our study reveals that the flow dynamics is the fundamental reason of playback
starvation. The QoE of streaming service is dominated by the first moments such
as the average throughput of opportunistic scheduling and the mean playback
rate. While the variances of throughput and playback rate have very limited
impact on starvation behavior.Comment: 14 page
Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes
Many opportunistic scheduling techniques are impractical because they require
accurate channel state information (CSI) at the transmitter. In this paper, we
investigate the scheduling of unicast and multicast services in a downlink
network with a very limited amount of feedback information. Specifically,
unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs)
to a base station, and multicast users only report infrequent ACKs to avoid
feedback implosion. We consider the use of physical-layer rateless codes, which
not only combats channel uncertainty, but also reduces the overhead of ACK
feedback. A joint scheduling and power allocation scheme is developed to
realize multiuser diversity gain for unicast service and multicast gain for
multicast service. We prove that our scheme achieves a near-optimal throughput
region. Our simulation results show that our scheme significantly improves the
network throughput over schemes employing fixed-rate codes or using only
unicast communications
Quantifying the impact of daily and seasonal variation in sap pH on xylem dissolved inorganic carbon estimates in plum trees
In studies on internal CO2 transport, average xylem sap pH (pH(x)) is one of the factors used for calculation of the concentration of dissolved inorganic carbon in the xylem sap ([CO2*]). Lack of detailed pH(x) measurements at high temporal resolution could be a potential source of error when evaluating [CO2*] dynamics. In this experiment, we performed continuous measurements of CO2 concentration ([CO2]) and stem temperature (T-stem), complemented with pH(x) measurements at 30-min intervals during the day at various stages of the growing season (Day of the Year (DOY): 86 (late winter), 128 (mid-spring) and 155 (early summer)) on a plum tree (Prunus domestica L. cv. Reine Claude d'Oullins). We used the recorded pH(x) to calculate [CO2*] based on T-stem and the corresponding measured [CO2]. No statistically significant difference was found between mean [CO2*] calculated with instantaneous pH(x) and daily average pH(x). However, using an average pH(x) value from a different part of the growing season than the measurements of [CO2] and T-stem to estimate [CO2*] led to a statistically significant error. The error varied between 3.25 +/- 0.01% under-estimation and 3.97 * 0.01% over-estimation, relative to the true [CO2*] data. Measured pH(x) did not show a significant daily variation, unlike [CO2], which increased during the day and declined at night. As the growing season progressed, daily average [CO2] (3.4%, 5.3%, 7.4%) increased and average pH(x) (5.43, 5.29, 5.20) decreased. Increase in [CO2] will increase its solubility in xylem sap according to Henry's law, and the dissociation of [CO2*] will negatively affect pH(x). Our results are the first quantifying the error in [CO2*] due to the interaction between [CO2] and pH(x) on a seasonal time scale. We found significant changes in pH(x) across the growing season, but overall the effect on the calculation of [CO2*] remained within an error range of 4%. However, it is possible that the error could be more substantial for other tree species, particularly if pH(x) is in the more sensitive range (pHx > 6.5)
Learning-aided Stochastic Network Optimization with Imperfect State Prediction
We investigate the problem of stochastic network optimization in the presence
of imperfect state prediction and non-stationarity. Based on a novel
distribution-accuracy curve prediction model, we develop the predictive
learning-aided control (PLC) algorithm, which jointly utilizes historic and
predicted network state information for decision making. PLC is an online
algorithm that requires zero a-prior system statistical information, and
consists of three key components, namely sequential distribution estimation and
change detection, dual learning, and online queue-based control.
Specifically, we show that PLC simultaneously achieves good long-term
performance, short-term queue size reduction, accurate change detection, and
fast algorithm convergence. In particular, for stationary networks, PLC
achieves a near-optimal , utility-delay
tradeoff. For non-stationary networks, \plc{} obtains an
utility-backlog tradeoff for distributions that last
time, where
is the prediction accuracy and is a constant (the
Backpressue algorithm \cite{neelynowbook} requires an length
for the same utility performance with a larger backlog). Moreover, PLC detects
distribution change slots faster with high probability ( is the
prediction size) and achieves an convergence time. Our results demonstrate
that state prediction (even imperfect) can help (i) achieve faster detection
and convergence, and (ii) obtain better utility-delay tradeoffs
- ā¦