Strong approximations for multiclass feedforward queueing networks
Authors:
- Hong ChenHCHong Chen
- Xinyang ShenXSXinyang Shen
Open Access
- 1 August 2000
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 10 (3) , 828-876
Abstract
This paper derives the strong approximation for a multiclass queueing network,where jobs after service completion can only move to a downstream service station. Job classes are partitioned into groups. Within a group, jobs are served in the order of arrival; that is, a first-in first-out (FIFO) discipline is in force, and among groups, jobs are served under a preassigned preemptive priority discipline. We obtain the strong approximation for the network through an inductive application of an input–output analysis for a single-station queue. Specifically, we show that if the input data (i.e., the arrival and the service processes) satisfy an approximation (such as the functional law-of-iterated logarithm approximation or the strong approximation), then the output data (i.e., the departure processes) and the performance measures (such as the queue length, the workload and the sojourn time processes) satisfy a similar approximation. Based on the strong approximation, some procedures are proposed to approximate the stationary distribution of various performance measures of the queueing network. Our work extends and complements the existing work of Peterson and Harrison and Williams on the feedforward queueing network. The numeric examples show that strong approximation provides a better approximation than that suggested by a straightforward interpretation of the heavy traffic limit theorem.Keywords
This publication has 19 references indexed in Scilit:
- State-dependent stochastic networks. Part I. Approximations and applications with continuous diffusion limitsThe Annals of Applied Probability, 1998
- Strong Approximations of Irreducible Closed Queueing NetworksAdvances in Applied Probability, 1997
- A sufficient condition for the positive recurrence of a semimartingale reflecting Brownian motion in an orthantThe Annals of Applied Probability, 1996
- Brownian models of multiclass queueing networks: Current status and open problemsQueueing Systems, 1993
- Brownian Models of Feedforward Queueing Networks: Quasireversibility and Product Form SolutionsThe Annals of Applied Probability, 1992
- Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State AnalysisThe Annals of Applied Probability, 1992
- Strong approximations for multiple channel queues in heavy trafficJournal of Applied Probability, 1990
- Chapter 4 Diffusion approximations1990
- Dependence in packet queuesIEEE Transactions on Communications, 1989
- Heavy Traffic Limit Theorems for Queues: A Survey1974