Pith. Sign in

RECORD

Two queues with random time-limited polling

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Mayank Saxena, Onno Boxma, Stella Kapodistria, Rudesindo Núñez Queija

Probability · Submitted 24 Jan 2017

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1701.06834 (version 2)
Pith IDSVDMXB3U, Pith's permanent record of this paper and its review
CitationMayank Saxena, Onno Boxma, Rudesindo N\'u\~nez Queija, Stella Kapodistria. "Two queues with random time-limited polling." arXiv:1701.06834 (2017). https://pith.science/paper/SVDMXB3U
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,370 input tokens.

What the abstract itself states, as probabilities: claims first 0.02 · states limitation 0.28 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.02 · states quantitative result 0.24 · compares with prior results 0.04 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service times. The server spends an exponentially distributed amount of time in each queue. After the completion of this residing time, the server instantaneously switches to the other queue, i.e., there is no switch-over time. For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results. Furthermore, we also calculate the joint queue length distribution for the special case of exponentially distributed service times using singular perturbation analysis.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 In this paper, we analyse a single server polling model with two queues. contribution 0.77 0.83 0.03 asserted 0.96
s1 Customers arrive at the two queues according to two independent Poisson processes. method 0.80 0.20 0.02 asserted 1.00
s2 There is a single server that serves both queues with generally distributed service times. method 0.82 0.14 0.02 asserted 1.00
s3 The server spends an exponentially distributed amount of time in each queue. method 0.91 0.23 0.03 asserted 1.00
s4 After the completion of this residing time, the server instantaneously switches to the other queue, i.e., there is no switch-over time. method 0.95 0.33 0.03 asserted 1.00
s5 For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results. result 0.76 0.97 0.63 asserted 1.00
s6 Furthermore, we also calculate the joint queue length distribution for the special case of exponentially distributed service times using singular perturbation analysis. contribution 0.53 0.96 0.11 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service times. The server spends an exponentially distributed amount of time in each queue. After the completion of this residing time, the server instantaneously switches to the other queue, i.e., there is no switch-over time. For this polling model we derive the steady-state marginal workload distribution, as well as heavy traffic and heavy tail asymptotic results. Furthermore, we also calculate the joint queue length distribution for the special case of exponentially distributed service times using singular perturbation analysis.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.