Explicit Stationary Comparisons for Join-the-Shortest-Queue Approximations

We compare the stationary occupancy law of a finite join-the-shortest-queue system with its finite-buffer and sampled-routing approximations. For N unit-rate exponential servers, Poisson arrival rate 0<lambda

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-28
DOI
https://doi.org/10.5281/zenodo.23024007
Primary Topic
Advanced Queuing Theory Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Explicit Stationary Comparisons for Join-the-Shortest-Queue Approximations

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Advanced Queuing Theory Analysis
preprint

Explicit Stationary Comparisons for Join-the-Shortest-Queue Approximations

Alper Ferudun
preprint en

Abstract

We compare the stationary occupancy law of a finite join-the-shortest-queue system with its finite-buffer and sampled-routing approximations. For N unit-rate exponential servers, Poisson arrival rate 0<lambda

Zenodo (CERN European Organization for Nuclear Research)
Reduced inequalities
Advanced Queuing Theory Analysis
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Explicit Stationary Comparisons for Join-the-Shortest-Queue Approximations — Alper Ferudun · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS