Related papers: On the BMAP_1, BMAP_2/PH/g, c retrial queueing sys…
The presented study elaborates a multi-server priority queueing model considering the pre-emptive repeat policy and phase-type distribution (PH) for retrial process. The incoming heterogeneous calls are categorized as handoff calls and new…
Demand for studying queueing systems with multiple servers providing correlated services was created about 60 years ago, motivated by various applications. In recent years, the importance of such studies has been significantly increased,…
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…
This paper discusses a maintenance network with failed items that can be removed, repaired, redistributed, and reused under two batch policies: one for removing the failed items from each base to a maintenance shop and the other for…
We consider a single server retrial queue with the server subject to interruptions and classical retrial policy for the access from the orbit to the server. We analyze the equilibrium distribution of the system and obtain the generating…
When decomposing the total orbit into $N$ sub-orbits (or simply orbits) related to each of $N$ servers and through comparing the numbers of customers in these orbits, we introduce a retrial supermarket model of $N$ identical servers, where…
Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: the retrial queueing systems with priority. This type of queueing system is…
It is interesting and challenging to study double-ended queues with First-Come-First-Match discipline under customers' impatient behavior and non-Poisson inputs. The system stability can be guaranteed by the customers' impatient behavior,…
We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has $c$ identical servers and can accommodate the maximal number of $K$ jobs. If a…
In this paper, we develop a more general framework of block-structured Markov processes in the queueing study of blockchain systems, which can provide analysis both for the stationary performance measures and for the sojourn times of any…
This paper considers a BMAP/M/$\infty$ queue with a batch Markovian arrival process (BMAP) and an exponential service time distribution. We first prove that the BMAP/M/$\infty$ queue is stable if and only if the expectation of the logarithm…
This paper studies an infinite buffer single server queueing model with exponentially distributed service times and negative arrivals. The ordinary (positive) customers arrive in batches of random size according to renewal arrival process,…
We consider a Markovian single server queue with impatient customers. There is a customer abandonment cost and a holding cost for customers in the system. We consider two versions of the problem. In the first version, customers pay a reward…
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and…
We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…
This paper proposes a Markovian model of 1-persistent CSMA/CA protocols with K-Exponential Backoff scheduling algorithms. The input buffer of each access node is modeled as a Geo/G/1 queue, and the service time distribution of each…
A complex multi-state redundant system undergoing preventive maintenance and experiencing multiple events is being considered in a continuous time frame. The online unit is susceptible to various types of failures, both internal and…
This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…
An important fundamental problem in green communications and networking is the operation of servers (routers or base stations) with sleeping mechanism to optimize energy-delay tradeoffs. This problem is very challenging when considering…
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…