Related papers: Analysis of an infinite-buffer batch-size-dependen…
In this paper, we consider discrete-time D-BMAP/G/\inf queueing model. We construct effective discrete-time Markovian dynamics for this model and utilize it to derive exact time-dependent distribution of customer number and the…
In this paper we study the number of customers in infinite-server queues with a self-exciting (Hawkes) arrival process. Initially we assume that service requirements are exponentially distributed and that the Hawkes arrival process is of a…
We consider a tandem queue with coupled processors, which is subject to global breakdowns. When the network is in the operating mode and both queues are non empty, the total service capacity is shared among the stations according to fixed…
We consider a finite population processor-sharing (PS) queue, with Markovian arrivals and an exponential server. Such a queue can model an interactive computer system consisting of a bank of terminals in series with a central processing…
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…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
In this paper we revisit the Markovian queueing system with a single server, infinite capacity queue and the special queue skipping policy. Customers arrive in batches, but are served one by one according to any conservative discipline. The…
In the present work we study Bayesian nonparametric inference for the continuous-time M/G/1 queueing system. In the focus of the study is the unobservable service time distribution. We assume that the only available data of the system are…
We consider a Markovian many server queueing system in which customers are preemptively scheduled according to exogenously assigned priority levels. The priority levels are randomly assigned from a continuous probability measure rather than…
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…
We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a…
The performance of non-preemptive M/M/1 queueing system with two priority is analyzed. By using complementary variable method to make vector Markov process and analyzing the state-change equations of the queueing system, the generating…
The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions…
In this paper, we consider a $G_t/G_t/\infty$ infinite server queueing model in a random environment. More specifically, the arrival rate in our server is modeled as a highly fluctuating stochastic process, which arguably takes into account…
We consider an infinite-buffer single-server queue where inter-arrival times are phase-type ($PH$), the service is provided according to Markovian service process $(MSP)$, and the server may take single, exponentially distributed vacations…
This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…
Multi-server queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
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 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,…