Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
We consider the following continuous polling system: Customers arrive according to a homogeneous Poisson process (or a more general stationary point process) and wait on a circle in order to be served by a single server. The server is "greedy," in the sense that he always moves (with const...
| Veröffentlicht in: | Mathematics of Operations Research. - Institute for Operations Research and the Management Sciences. - 21(1996), 1, Seite 135-157 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1996
|
| Zugriff auf das übergeordnete Werk: | Mathematics of Operations Research |
| Schlagworte: | Queueing theory Continuous polling system Greedy server Poisson arrivals Light-traffic derivative Taylor-expansion Queue length Workload General stationary input Business mehr... |
| Online verfügbar |
Volltext |