ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a cyclic polling system have general renewal arrival processes and deterministic switch-over times. The system is considered in the regime where the deterministic switch-over times tend to infinity. Renewal-arrival deterministic-limit conjecture. The cyclic polling system converges to a deterministic cyclic system in this limit. The conjecture proposes that the limiting behaviour previously established for Poisson arrivals remains valid for general renewal arrivals, for which corresponding results were not known at the time of the paper.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.