Search Results

This study considers Markovian queues with different service speeds, where the server speed can only be changed at control instants assumed to follow a Poisson process. Núñez-Queija et al. (Queueing Syst 100:233–235, 2022, Indag Math 34:990–1013, ...

We study a multi-stage tandem queueing system and develop the law of the iterated logarithm (LIL) for performance measures including the queue length, workload, busy time, idle time and departure processes. These LIL results can help quantify the ...

We consider the resource management of a data center by using a discrete-time single-server queue with an unlimited-size batch service, where the next queue to be served is the one with the most senior waiting client (the so-called ‘Informal Queue’...

This article analyzes an $M_1^X,M_2/G_1,G_2/1$ retrial queue with two-way communication under constant retrial policy. A server handles both inbound and outbound calls. The inbound calls arrive in batches according to a compound Poisson process. The ...

Consider a LCFS-PR M / G / 1 queue and assume that at time t = 0, there are n + 1 customers c 1 , c 2 , . . . , c n + 1 who arrived in that order. In addition, at time t = 0 there is an additional customer c with service requirement x > 0 who ...

In this paper, we consider a queueing-inventory system with modified delayed vacation under Bernoulli schedule. If the inventory is empty upon completion of the service, the server will take the modified delayed vacation. During the modified ...$\mathrm{}\mathrm{}$$\mathrm{}$

The current article is about a finite buffer, group size dependent bulk service queue, in which a single server renders two type of services, first essential service (FES) and second optional service (SoS). Customers arrive at the system in the ...

The objective of this study is devoted to studying the equilibrium strategy of an unreliable M/M/1+1 retrial queue model, which contains two types of parallel customers and batch service provided by a standby server. Two kinds of customers in this ...

This paper considers a capacity allocation problem in a two-channel service system. Customers can receive service from either a single-server queueing system, which serves the customers waiting in line one by one, or a clearing service system, ...

This article deals with the problem of estimating the service time distribution of the $M_t/G/\infty$ queue from observation of the departure epochs. We develop minimax optimal estimators of G and study behavior of the minimax pointwise risk over a ...

We consider Palm distributions arising in a Markov process with time homogeneous transitions which is jointly stationary with multiple point processes. Motivated by a BAR approach studied in the recent paper (Braverman et al. in the BAR approach ...

We develop an efficient reinforcement learning algorithm that learns the optimal admission control policy in a partially observable queueing network. Specifically, only the arrival and departure times from the network are observable, optimality ...$\stackrel{}{}\left(\sqrt{\mathrm{}}\right)$$\mathrm{}\mathrm{}$$\mathrm{}$$\mathrm{}$$\stackrel{}{}\left(\sqrt{\mathit{}}\right)$$\mathrm{}$

We study a type of correlated queue in which its inter-arrival and service times are correlated, with their joint distribution being characterized by a copula function. This characterization allows for very generally correlated inter-arrival and ...

This paper considers an M/G/1 queue with delayed uninterrupted multiple vacation and N-policy, in which (i) the server remains dormant from vacation to a non-empty system with no more than N customers, and (ii) when the system becomes exhausted, ...

A new approach is developed for the joint queue-length distribution of the two-level non-pre-emptive M/M/c (i.e. Markovian) priority queue that allows explicit and exact results to be obtained. Marginal distributions are derived for the general ...

We investigate the dynamics of customer geometric abandonment within a queueing framework characterized by renewal input batch arrivals and multiple vacations. Customers’ impatience becomes evident when confronted with server vacations, triggering ...

We study in this paper a variation of the acclaimed carrier sense multiple access (CSMA) protocol. A random access algorithm is where back-off rates depend on the state of the network through queue lengths. We provide the first case where full ...

Dense network deployment is now being evaluated as one of the viable solutions to meet the capacity and connectivity requirements of the fifth-generation (5G) cellular system. The goal of 5G cellular networks is to offer clients with faster ...${}^{}\mathrm{}$

This paper focuses on an unreliable M/M/1 retrial queue with delayed repair, in which a novel breakdown mechanism is considered, i.e., a normal breakdown may deteriorate into a major breakdown. Arriving customers are not provided with the system’s ...