Related papers: On the Sojourn Time Distribution in a Finite Popul…
The paper deals with a sharing economy system with various management factors by using a bulk input G/M/1 type queuing model. The effective management of operating costs is vital for controlling the sharing economy platform and this…
We study the asymptotics of the stationary sojourn time Z of a "typical customer" in a tandem of single-server queues. It is shown that, in a certain "intermediate" region of light-tailed service time distributions, Z may take a large value…
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…
New algorithms for construction of asymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces are presented. These algorithms are based on a special technique of sequential…
This paper considers a multiclass processor-sharing queue with feedback. Jobs arrive according to renewal processes, and service times follow general distributions. Upon service completion, jobs may either depart the system or re-enter as a…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
The discrete time queueing system is highly applicable to modern telecommunication systems, where it provides adaptive packet handling, congestion controlled security/inspection, energy efficient operation, and supports bursty traffic…
This paper studies the diffusion limit for a network of infinite-server queues operating under Markov modulation (meaning that the system's parameters depend on an autonomously evolving background process). In previous papers on (primarily…
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps…
We study stochastic pairwise interaction network systems whereby a finite population of agents, identified with the nodes of a graph, update their states in response to both individual mutations and pairwise interactions with their…
The single server queue with multiple customer types and semi-Markovian service times, sometimes referred to as the $M/SM/1$ queue, has been well-studied since its introduction by Neuts in 1966. In this paper, we apply an extension of this…
Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and…
This paper considers the mean waiting times in discrete-time preemptive-resume and nonpreemptive priority single-server queues fed by K independent batch Markovian arrival streams with geometrically distributed idle periods. While being…
The model of population protocols provides a universal platform to study distributed processes driven by pairwise interactions of anonymous agents. While population protocols present an elegant and robust model for randomized distributed…
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When…
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…
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue…
Asymptotic expansions with explicit upper bounds for remainders are given for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces. The corresponding algorithms are based on a special technique of…
We consider a class of multi-agent distributed synchronization systems, which are modeled as $n$ particles moving on the real line. This class generalizes the model of a multi-server queueing system, considered in [15], employing so-called…
Discrete-time queueing system has widespread applications in packet switching networks, internet protocol, Broadband Integrated Services Digital Network (B-ISDN), circuit switched time-division multiple access etc. In this paper, we analyze…