Asymptotically Exact Decomposition Approximations for Queueing Networks

We present two decomposition approximations for open single class queueing networks with a single bottleneck station which are asymptotically exact in both light and heavy traffic. When applied to Jackson networks, these approximations are exact. The approximations also yield the exact mean values when applied to the M/G/1 queue.