Extreme values for the waiting time in large fork-join queues

09/15/2023
by   Dennis Schol, et al.
0

We prove that the scaled maximum steady-state waiting time and the scaled maximum steady-state queue length among N GI/GI/1-queues in the N-server fork-join queue, converge to a normally distributed random variable as N→∞. The maximum steady-state waiting time in this queueing system scales around 1/γlog N, where γ is determined by the cumulant generating function Λ of the service distribution and solves the Cramér-Lundberg equation with stochastic service times and deterministic inter-arrival times. This value 1/γlog N is reached at a certain hitting time. The number of arrivals until that hitting time satisfies the central limit theorem, with standard deviation σ_A/√(Λ'(γ)γ). By using distributional Little's law, we can extend this result to the maximum queue length. Finally, we extend these results to a fork-join queue with different classes of servers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/25/2019

Large fork-join networks with nearly deterministic service times

In this paper, we study an N server fork-join queueing network with near...
research
12/31/2019

The MAP/M/s+G Call Center Model with General Patience Times: Stationary Solutions and First Passage Times

We study the MAP/M/s+G queuing model with MAP (Markovian Arrival Process...
research
01/19/2014

An algorithm for calculating steady state probabilities of M|E_r|c|K queueing systems

This paper presents a method for calculating steady state probabilities ...
research
03/25/2020

A Robust Queueing Network Analyzer Based on Indices of Dispersion

We develop a robust queueing network analyzer algorithm to approximate t...
research
08/15/2023

Quantifying the Cost of Learning in Queueing Systems

Queueing systems are widely applicable stochastic models with use cases ...
research
02/21/2018

Skueue: A Scalable and Sequentially Consistent Distributed Queue

We propose a distributed protocol for a queue, called Skueue, which spre...
research
05/28/2021

Cost analysis of a MAP/PH/S performability model with PH retrial times using simulated annealing method

This work focuses over the performability analysis of a multi-server ret...

Please sign up or login with your details

Forgot password? Click here to reset