Related papers: A Lindley-type equation arising from a carousel pr…
The study of the dynamics of the size of a population via mathematical modelling is a problem of interest and widely studied. Traditionally, continuous deterministic methods based on differential equations have been used to deal with this…
In many cognitive radio applications, there are multiple types of message queues. Existing queueing analysis works in underlay CR networks failed to discuss packets heterogeneity. Therefore high priority packets with impatient waiting time…
What determines the average length of a queue which stretches in front of a service station? The answer to this question clearly depends on the average rate at which jobs arrive at the queue and on the average rate of service. Somewhat less…
Consider an M/M/$s$ queue with the additional feature that the arrival rate is a random variable of which only the mean, variance, and range are known. Using semi-infinite linear programming and duality theory for moment problems, we…
We introduce a fractional generalization of the Erlang Queues $M/E_k/1$. Such process is obtained through a time-change via inverse stable subordinator of the classical queue process. We first exploit the (fractional) Kolmogorov forward…
We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…
We derive the limiting waiting-time distribution $F_W$ of a model described by the Lindley-type equation $W=\max\{0, B - A - W\}$, where $B$ has a polynomial distribution. This exact solution is applied to derive approximations of $F_W$…
We study a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays $\xi_{i}$. The standard deviation $\sigma$ of the delay is finite, but its value is much larger than the deterministic unit service time.…
Approximations for the mean performance indices for the M/G/c queue rely on the approximate computation of the probability that an arriving request has to wait for service and of the minimum of residual service times if all servers are…
We examine the phase transition phenomenon for the Knapsack problem from both a computational and a human perspective. We first provide, via an empirical and a theoretical analysis, a characterization of the phenomenon in terms of two…
Many transport processes in nature exhibit anomalous diffusive properties with non-trivial scaling of the mean square displacement, e.g., diffusion of cells or of biomolecules inside the cell nucleus, where typically a crossover between…
In two intersecting many-particle streams, one can often find the emergence of oscillatory patterns. Here, we investigate the interaction of pedestrians with vehicles, when they try to cross a road. A numerical study of this coupled…
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or points) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.)…
It has been noticed that when the waiting time distribution exhibits a transition from an intermediate time power law decay to a long-time exponential decay in the continuous time random walk model, a transition from anomalous diffusion to…
In the infinite servers queue with Poisson arrivals real life practical applications, the busy period and the busy cycle probabilistic study is of main importance. But it is a very difficult task. In this text, we show that by solving a…
In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler…
We introduce the {\Delta}(i)/GI/1 queue, a new queueing model. In this model, customers from a given population independently sample a time to arrive from some given distribution F. Thus, the arrival times are an ordered statistics, and the…
We study the MAP/M/s+G queuing model with MAP (Markovian Arrival Process) arrivals, exponentially distributed service times, infinite waiting room, and generally distributed patience times. Using sample-path arguments, we propose to obtain…
Maintainability analysis is a cornerstone of reliability engineering. While the Markov approach is the classical analytical foundation, its reliance on the exponential distribution for failure and repair times is a major and often…
A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a…