{"paper":{"title":"An Infinite Dimensional Model for A Single Server Priority Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"math.PR","authors_text":"Neal Master, Nicholas Bambos, Zhengyuan Zhou","submitted_at":"2016-09-26T14:49:07Z","abstract_excerpt":"We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability measure rather than a discrete one. Because the priority levels are drawn from a continuum, the queue is modeled by a measure-valued stochastic process. We analyze the steady state behavior of this process and provide several results. We derive a measure that describes the average distribution of customer priority levels in the system; we provide a formula for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07996","kind":"arxiv","version":1},"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"}