{"paper":{"title":"Queue lengths and workloads in polling systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Kamil Marcin Kosinski, Offer Kella, Onno Boxma","submitted_at":"2011-06-06T06:21:09Z","abstract_excerpt":"We consider a polling system: a queueing system of $N\\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating function $\\mathscr Q(\\cdot)$ of the joint queue length distribution at an arbitrary epoch in a stationary cycle, under no assumptions on service disciplines. We also derive the Laplace-Stieltjes transform $\\mathscr W(\\cdot)$ of the joint workload distribution at an arbitrary epoch. We express $\\mathscr Q$ and $\\mathscr W$ in the probability generating functions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0964","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}