1,866 research outputs found
Perturbation analysis of an M/M/1 queue in a diffusion random environment
We study in this paper an queue whose server rate depends upon the
state of an independent Ornstein-Uhlenbeck diffusion process so that
its value at time is , where is some bounded
function and . We first establish the differential system for the
conditional probability density functions of the couple in the
stationary regime, where is the number of customers in the system at
time . By assuming that is defined by for some positive real numbers
, and , we show that the above differential system has a
unique solution under some condition on and . We then show that this
solution is close, in some appropriate sense, to the solution to the
differential system obtained when is replaced with
for sufficiently small . We finally
perform a perturbation analysis of this latter solution for small
. This allows us to check at the first order the validity of the
so-called reduced service rate approximation, stating that everything happens
as if the server rate were constant and equal to \mu(1-\eps\E(X(t)))
Perturbation analysis of an M/M/1 queue in a diffusion random environment
An queue whose server rate depends on the state of an independent Ornstein-Uhlenbeck diffusion process is studied in this paper by means of a regular perturbation analysis. Specifically, if denotes the modulating Ornstein-Uhlenbeck process, then the server rate at time is , where is some given function. After establishing the Fokker-Planck equation characterizing the joint distribution of the occupation process of the queue and the state of the modulating Ornstein-Uhlenbeck process, we show, under the assumption that the server rate is weakly perturbed by the diffusion process, that the problem can be solved via a perturbation analysis of a self-adjoint operator defined in an adequate Hilbert space. We then perform a detailed analysis when the perturbation function is linear, namely of the form \phi(x) = 1-\varepsilonx. We compute in particular the different terms of the expansion of the solution in power series of and we determine the radius of convergence of the solution. The results are finally applied to study of the integration of elastic and streaming flows in telecommunication network and we show that at the first order the reduced service rate approximation is valid
Perturbation Analysis of a Variable M/M/1 Queue: A Probabilistic Approach
Motivated by the problem of the coexistence on transmission links of
telecommunication networks of elastic and unresponsive traffic, we study in
this paper the impact on the busy period of an M/M/1 queue of a small
perturbation in the server rate. The perturbation depends upon an independent
stationary process (X(t)) and is quantified by means of a parameter \eps \ll 1.
We specifically compute the two first terms of the power series expansion in
\eps of the mean value of the busy period duration. This allows us to study the
validity of the Reduced Service Rate (RSR) approximation, which consists in
comparing the perturbed M/M/1 queue with the M/M/1 queue where the service rate
is constant and equal to the mean value of the perturbation. For the first term
of the expansion, the two systems are equivalent. For the second term, the
situation is more complex and it is shown that the correlations of the
environment process (X(t)) play a key role
Integration of streaming services and TCP data transmission in the Internet
We study in this paper the integration of elastic and streaming traffic on a
same link in an IP network. We are specifically interested in the computation
of the mean bit rate obtained by a data transfer. For this purpose, we consider
that the bit rate offered by streaming traffic is low, of the order of
magnitude of a small parameter \eps \ll 1 and related to an auxiliary
stationary Markovian process (X(t)). Under the assumption that data transfers
are exponentially distributed, arrive according to a Poisson process, and share
the available bandwidth according to the ideal processor sharing discipline, we
derive the mean bit rate of a data transfer as a power series expansion in
\eps. Since the system can be described by means of an M/M/1 queue with a
time-varying server rate, which depends upon the parameter \eps and process
(X(t)), the key issue is to compute an expansion of the area swept under the
occupation process of this queue in a busy period. We obtain closed formulas
for the power series expansion in \eps of the mean bit rate, which allow us to
verify the validity of the so-called reduced service rate at the first order.
The second order term yields more insight into the negative impact of the
variability of streaming flows
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
Heavy-tailed Distributions In Stochastic Dynamical Models
Heavy-tailed distributions are found throughout many naturally occurring
phenomena. We have reviewed the models of stochastic dynamics that lead to
heavy-tailed distributions (and power law distributions, in particular)
including the multiplicative noise models, the models subjected to the
Degree-Mass-Action principle (the generalized preferential attachment
principle), the intermittent behavior occurring in complex physical systems
near a bifurcation point, queuing systems, and the models of Self-organized
criticality. Heavy-tailed distributions appear in them as the emergent
phenomena sensitive for coupling rules essential for the entire dynamics
Numerical methods for queues with shared service
A queueing system is a mathematical abstraction of a situation where elements, called customers, arrive in a system and wait until they receive some kind of service. Queueing systems are omnipresent in real life. Prime examples include people waiting at a counter to be served, airplanes waiting to take off, traffic jams during rush hour etc. Queueing theory is the mathematical study of queueing phenomena. As often neither the arrival instants of the customers nor their service times are known in advance, queueing theory most often assumes that these processes are random variables. The queueing process itself is then a stochastic process and most often also a Markov process, provided a proper description of the state of the queueing process is introduced.
This dissertation investigates numerical methods for a particular type of Markovian queueing systems, namely queueing systems with shared service. These queueing systems differ from traditional queueing systems in that there is simultaneous service of the head-of-line customers of all queues and in that there is no service if there are no customers in one of the queues. The absence of service whenever one of the queues is empty yields particular dynamics which are not found in traditional queueing systems.
These queueing systems with shared service are not only beautiful mathematical objects in their own right, but are also motivated by an extensive range of applications. The original motivation for studying queueing systems with shared service came from a particular process in inventory management called kitting. A kitting process collects the necessary parts for an end product in a box prior to sending it to the assembly area. The parts and their inventories being the customers and queues, we get ``shared service'' as kitting cannot proceed if some parts are absent. Still in the area of inventory management, the decoupling inventory of a hybrid make-to-stock/make-to-order system exhibits shared service. The production process prior to the decoupling inventory is make-to-stock and driven by demand forecasts. In contrast, the production process after the decoupling inventory is make-to-order and driven by actual demand as items from the decoupling inventory are customised according to customer specifications. At the decoupling point, the decoupling inventory is complemented with a queue of outstanding orders. As customisation only starts when the decoupling inventory is nonempty and there is at least one order, there is again shared service. Moving to applications in telecommunications, shared service applies to energy harvesting sensor nodes. Such a sensor node scavenges energy from its environment to meet its energy expenditure or to prolong its lifetime. A rechargeable battery operates very much like a queue, customers being discretised as chunks of energy. As a sensor node requires both sensed data and energy for transmission, shared service can again be identified.
In the Markovian framework, "solving" a queueing system corresponds to finding the steady-state solution of the Markov process that describes the queueing system at hand. Indeed, most performance measures of interest of the queueing system can be expressed in terms of the steady-state solution of the underlying Markov process. For a finite ergodic Markov process, the steady-state solution is the unique solution of balance equations complemented with the normalisation condition, being the size of the state space. For the queueing systems with shared service, the size of the state space of the Markov processes grows exponentially with the number of queues involved. Hence, even if only a moderate number of queues are considered, the size of the state space is huge. This is the state-space explosion problem. As direct solution methods for such Markov processes are computationally infeasible, this dissertation aims at exploiting structural properties of the Markov processes, as to speed up computation of the steady-state solution.
The first property that can be exploited is sparsity of the generator matrix of the Markov process. Indeed, the number of events that can occur in any state --- or equivalently, the number of transitions to other states --- is far smaller than the size of the state space. This means that the generator matrix of the Markov process is mainly filled with zeroes. Iterative methods for sparse linear systems --- in particular the Krylov subspace solver GMRES --- were found to be computationally efficient for studying kitting processes only if the number of queues is limited. For more queues (or a larger state space), the methods cannot calculate the steady-state performance measures sufficiently fast. The applications related to the decoupling inventory and the energy harvesting sensor node involve only two queues. In this case, the generator matrix exhibits a homogene block-tridiagonal structure. Such Markov processes can be solved efficiently by means of matrix-geometric methods, both in the case that the process has finite size and --- even more efficiently --- in the case that it has an infinite size and a finite block size. Neither of the former exact solution methods allows for investigating systems with many queues. Therefore we developed an approximate numerical solution method, based on Maclaurin series expansions. Rather than focussing on structural properties of the Markov process for any parameter setting, the series expansion technique exploits structural properties of the Markov process when some parameter is sent to zero. For the queues with shared exponential service and the service rate sent to zero, the resulting process has a single absorbing state and the states can be ordered such that the generator matrix is upper-diagonal. In this case, the solution at zero is trivial and the calculation of the higher order terms in the series expansion around zero has a computational complexity proportional to the size of the state space. This is a case of regular perturbation of the parameter and contrasts to singular perturbation which is applied when the service times of the kitting process are phase-type distributed. For singular perturbation, the Markov process has no unique steady-state solution when the parameter is sent to zero. However, similar techniques still apply, albeit at a higher computational cost.
Finally we note that the numerical series expansion technique is not limited to evaluating queues with shared service. Resembling shared queueing systems in that a Markov process with multidimensional state space is considered, it is shown that the regular series expansion technique can be applied on an epidemic model for opinion propagation in a social network. Interestingly, we find that the series expansion technique complements the usual fluid approach of the epidemic literature
- …