English
Related papers

Related papers: The Maximum Overlap Time in the M/M/1 Queue

200 papers

In this work, we analyze the steady-state maximum overlap time distribution in a single-server queue by introducing a dependence structure between service and interarrival times under the Farlie-Gumber-Morgenstern copula. We provide…

Probability · Mathematics 2025-09-18 Ioannis Dimitriou

In this paper, we investigate overlap times in a two-dimensional infinite server tandem queue. Specifically, we analyze the amount of time that a pair of customers spend overlapping in any station of the two dimensional tandem network. We…

Probability · Mathematics 2024-03-13 Ruici Gao , Jamol Pender

Overlap times have been studied as a way of understanding the time of interaction between customers in a service facility. Most of the previous analysis relies on the single jump assumption for arrivals, which implies the queue increases by…

Probability · Mathematics 2023-02-16 Sergio D Palomo , Jamol Pender

Imagine, you enter a grocery store to buy food. How many peopledo you overlap with in this store? How much time do you overlap witheach person in the store? In this paper, we answer these questions bystudying the overlap times between…

Probability · Mathematics 2021-04-30 Jamol Pender , Sergio Palomo

In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…

Probability · Mathematics 2007-05-23 Misja Nuyens

Motivated by the ongoing COVID-19 pandemic, this paper investigates customers' infection risk by evaluating the overlapping time of a virtual customer with others in queueing systems. Most of the current methodologies focus on…

Probability · Mathematics 2022-11-09 Young Myoung Ko , Jin Xu

We investigate an M/M/1 queue operating in two switching environments, where the switch is governed by a two-state time-homogeneous Markov chain. This model allows to describe a system that is subject to regular operating phases alternating…

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…

Probability · Mathematics 2011-03-22 Mariana Olvera-Cravioto , Peter W. Glynn

In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…

Performance · Computer Science 2015-12-21 Daniel Marian Merezeanu , Daniela Andone

We give a simple derivation of the distribution of the maximum L of the length of the queue during a busy period for the M/M/1 queue with lambda<1 the ratio between arrival rate and service rate. We observe that the asymptotic behavior of…

Probability · Mathematics 2011-06-21 Patrick Eschenfeldt , Ben Gross , Nicholas Pippenger

We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the beginning, at the end, or in the middle of the busy period.…

Discrete Mathematics · Computer Science 2007-07-30 Moez Draief , Jean Mairesse

In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the…

History and Overview · Mathematics 2022-08-30 Steven Finch

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…

Performance · Computer Science 2021-10-22 Omer Gursoy , Kamal Adli Mehr , Nail Akar

In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean…

Probability · Mathematics 2025-07-02 Young Myoung Ko , Jamol Pender , Jin Xu

We study the stationary sojourn time distribution in an M/G/1 queue operating under heavy traffic. It is known that the sojourn time converges to an exponential distribution in the limit. Our focus is on obtaining pre-asymptotic,…

Probability · Mathematics 2026-01-21 Bihan Chatterjee , Siva Theja Maguluri , Debankur Mukherjee

In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…

Probability · Mathematics 2008-08-01 Vyacheslav M. Abramov

In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a…

Probability · Mathematics 2015-11-13 Andrei Sleptchenko , Jori Selen , Ivo Adan , Geert-Jan van Houtum

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…

Probability · Mathematics 2025-04-25 Bernardo D'Auria , Ivo J. B. F. Adan , René Bekker , Vidyadhar Kulkarni

We study a generalization of the $M/G/1$ system (denoted by $rM/G/1$) with independent and identically distributed (iid) service times and with an arrival process whose arrival rate $\lambda_0f(r)$ depends on the remaining service time $r$…

Probability · Mathematics 2017-10-05 Benjamin Legros , Ali Devin Sezer

We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service control. The service rate switches between a low and a high value depending on system congestion. Arriving customers do not observe the…

Optimization and Control · Mathematics 2011-12-07 Y. Dimitrakopoulos , A. Burnetas
‹ Prev 1 2 3 10 Next ›