Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

Dennis Schol; Maria Vlasiou; Bert Zwart

doi:10.1287/moor.2021.1171

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

Dennis Schol^*, Maria Vlasiou, Bert Zwart

^*Corresponding author for this work

Mathematics of Operations Research

Research output: Contribution to journal › Article › Academic › peer-review

5 Citations (Scopus)

58 Downloads (Pure)

Abstract

In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N → ∞. This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.

Original language	English
Pages (from-to)	1335-1364
Number of pages	30
Journal	Mathematics of operations research
Volume	47
Issue number	2
Early online date	14 Dec 2021
DOIs	https://doi.org/10.1287/moor.2021.1171
Publication status	Published - May 2022

Keywords

extreme value theory
fluid limit
fork-join queue
heavy traffic
nearly deterministic
queueing network
22/3 OA procedure

Access to Document

10.1287/moor.2021.1171

moor.2021.1171Final published version, 1.4 MBLicence: Taverne

Cite this

@article{50d902ef4b25486f974ab5ddac359814,

title = "Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times",

abstract = "In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N → ∞. This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.",

keywords = "extreme value theory, fluid limit, fork-join queue, heavy traffic, nearly deterministic, queueing network, 22/3 OA procedure",

author = "Dennis Schol and Maria Vlasiou and Bert Zwart",

note = "Funding Information: Funding: This research is supported by the Netherlands Organization for Scientific Research through the programs Grip on Complexity (Schol) [Grant 438.16.121], MEERVOUD (Vlasiou) [Grant 632.003.002], and Talent VICI (Zwart) [Grant 639.033.413]. Publisher Copyright: Copyright: {\textcopyright} 2021 INFORMS.",

year = "2022",

month = may,

doi = "10.1287/moor.2021.1171",

language = "English",

volume = "47",

pages = "1335--1364",

journal = "Mathematics of operations research",

issn = "0364-765X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "2",

}

TY - JOUR

T1 - Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

AU - Schol, Dennis

AU - Vlasiou, Maria

AU - Zwart, Bert

N1 - Funding Information: Funding: This research is supported by the Netherlands Organization for Scientific Research through the programs Grip on Complexity (Schol) [Grant 438.16.121], MEERVOUD (Vlasiou) [Grant 632.003.002], and Talent VICI (Zwart) [Grant 639.033.413]. Publisher Copyright: Copyright: © 2021 INFORMS.

PY - 2022/5

Y1 - 2022/5

N2 - In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N → ∞. This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.

AB - In this paper, we study an N server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as N → ∞. This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.

KW - extreme value theory

KW - fluid limit

KW - fork-join queue

KW - heavy traffic

KW - nearly deterministic

KW - queueing network

KW - 22/3 OA procedure

UR - http://www.scopus.com/inward/record.url?scp=85134210982&partnerID=8YFLogxK

U2 - 10.1287/moor.2021.1171

DO - 10.1287/moor.2021.1171

M3 - Article

AN - SCOPUS:85134210982

SN - 0364-765X

VL - 47

SP - 1335

EP - 1364

JO - Mathematics of operations research

JF - Mathematics of operations research

IS - 2

ER -

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Large fork-join queues with nearly deterministic arrival and service times

Cite this