Related papers: Analysis of a non-work conserving Generalized Proc…
This paper considers a multichannel preemptive-resume priority queueing system with a Poisson input and an arbitrary service time distribution depending on the priority of job. Jobs of the same priority are serviced according to the LIFO…
In this work, nonparametric statistical inference is provided for the continuous-time M/G/1 queueing model from a Bayesian point of view. The inference is based on observations of the inter-arrival and service times. Beside other…
Gaussian Process State Space Models (GP-SSM) are a data-driven stochastic model class suitable to represent nonlinear dynamics. They have become increasingly popular in non-parametric modeling approaches since they provide not only a…
We study an edge-weighted online stochastic \emph{Generalized Assignment Problem} with \emph{unknown} Poisson arrivals. In this model, we consider a bipartite graph that contains offline bins and online items, where each offline bin is…
We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formmulas are derived for the j-th moments (j=1,2,...) of the (conditional) stationary sojourn…
We revisit a single-server retrial queue with two independent Poisson streams (corresponding to two types of customers) and two orbits. The size of each orbit is infinite. The exponential server (with a rate independent of the type of…
We consider a discrete-time version of a Hawkes process defined as a Poisson auto-regressive process whose parameters depend on the past of the trajectory. We allow these parameters to take on negative values, modelling inhibition. More…
The optimal scheduling problem in single-server queueing systems is a classic problem in queueing theory. The Gittins index policy is known to be the optimal preemptive nonanticipating policy (both for the open version of the problem with…
We investigate the stability condition of redundancy-$d$ multi-server systems. Each server has its own queue and implements popular scheduling disciplines such as First-Come-First-Serve (FCFS), Processor Sharing (PS), and Random Order of…
U-statistics of spatial point processes given by a density with respect to a Poisson process are investigated. In the first half of the paper general relations are derived for the moments of the functionals using kernels from the Wiener-Ito…
A non-Markovian counting process, the `generalized fractional Poisson process' (GFPP) introduced by Cahoy and Polito in 2013 is analyzed. The GFPP contains two index parameters $0<\beta\leq 1$, $\alpha >0$ and a time scale parameter.…
The infinite-server queueing models with homogeneous and non-homogeneous arrivals of customers and catastrophes are considered. The probability generating functions of joint distributions of numbers of busy servers and served customers, as…
The Gaussian process (GP) is a widely used probabilistic machine learning method with implicit uncertainty characterization for stochastic function approximation, stochastic modeling, and analyzing real-world measurements of nonlinear…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…
In this paper, we present a kernel-based, multi-task Gaussian Process (GP) model for approximating the underlying function of an individual's mobility state using a time-inhomogeneous Markov Process with two states: moves and pauses. Our…
Supermarket models are a class of parallel queueing networks with an adaptive control scheme that play a key role in the study of resource management of, such as, computer networks, manufacturing systems and transportation networks. When…
We consider the $M/M/1$-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn…
We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties…
We compute the stationary performance metrics of a single server $M^X/G/1$ queue under a class of generalized processor-sharing scheduling policies that are proposed by Grishechkin. This class of processor-sharing policies allow service…
In this paper, we establish two different results. The first result is a characterization theorem saying that if the stationary state probabilities for originally described Markovian discriminatory processor sharing (DPS) system have a…