Related papers: Modeling and analysis of a discrete-time group-arr…
This paper examines a continuous-time routing system with general interarrival and service time distributions, operating under the join-the-shortest-queue and power-of-two-choices policies. Under a weaker set of assumptions than those…
The paper studies a closed queueing network containing two types of node. The first type (server station) is an infinite server queueing system, and the second type (client station) is a single server queueing system with autonomous…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
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…
We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
We study a many-server queueing model with server vacations, where the population size dynamics of servers and customers are coupled: a server may leave for vacation only when no customers await, and the capacity available to customers is…
We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of finitely many arrivals in an infinitesimal time interval. We call it the Erlang queue…
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…
We introduce the {\Delta}(i)/GI/1 queue, a new queueing model. In this model, customers from a given population independently sample a time to arrive from some given distribution F. Thus, the arrival times are an ordered statistics, and the…
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…
We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability…
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…
Queueing systems with a single server in which customers wait to be served at a finite number of distinct locations (buffers/queues) are called discrete polling systems. Polling systems in which arrivals of users occur anywhere in a…
Estimation of the service time distribution in the discrete-time $GI/G/\infty$-queue based solely on information on the arrival and departure processes is considered. The focus is put on the estimation approach via the so called "sequence…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…
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…
In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are…
By analyzing energy-efficient management of data centers, this paper proposes and develops a class of interesting {\it Group-Server Queues}, and establishes two representative group-server queues through loss networks and impatient…
We consider a service system with two Poisson arrival queues. A server chooses which queue to serve at each moment. Once a queue is served, all the customers will be served within a fixed amount of time. This model is useful in studying…