Reduction of a polling network to a single node
Queueing Systems: Theory and Applications
| Hi-index | 754.84 |
In this correspondence, we analyze feedforward tree networks of queues serving fixed-length packets. Using sample path conservation properties and stochastic coupling techniques, we analyze these systems without making any assumptions about the nature of the underlying input processes. In the case when the server rate is the same for all queues, the exact packet occupancy distribution in any queue of a multistage network is obtained in terms of a reduced two-stage equivalent model. Simple and exact expressions for occupancy mean and variance are derived from this result, and the network is shown to exhibit a natural traffic smoothing property, where preliminary stages act to smooth or improve traffic for downstream nodes. In the case of heterogeneous server rates, a similar type of smoothing is demonstrated, and upper bounds on the backlog distribution are derived. These bounds hold for general input streams and are tighter than currently known bounds for leaky bucket and stochastically bounded bursty traffic.