Article ID: | iaor20172887 |
Volume: | 86 |
Issue: | 3 |
Start Page Number: | 277 |
End Page Number: | 299 |
Publication Date: | Aug 2017 |
Journal: | Queueing Systems |
Authors: | Kella Offer, Miyazawa Masakiyo, Boon Marko A A, Boxma Onno J |
Keywords: | queues: applications |
A classical result for the steady‐state queue‐length distribution of single‐class queueing systems is the following: The distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid is that arrivals, and also service completions, with probability one occur individually, i.e., not in batches. We show that it is easy to write down somewhat similar balance equations for