{"paper":{"title":"On queues with service and interarrival times depending on waiting times","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maria Vlasiou, Onno J. Boxma","submitted_at":"2014-04-22T16:43:17Z","abstract_excerpt":"We consider an extension of the standard G/G/1 queue, described by the equation $W\\stackrel{\\mathcal{D}}{=}\\max\\{0, B-A+YW\\}$, where $\\mathbb{P}[Y=1]=p$ and $\\mathbb{P}[Y=-1]=1-p$. For $p=1$ this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for $p=0$ it describes the waiting time of the server in an alternating service model. For all other values of $p$ this model describes a FCFS queue in which the service times and interarrival times depend linearly and randomly on the waiting times. We derive the distribution of $W$ when $A$ is generally d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5549","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"}