Stability of Single Class Queueing Networks
The stability of queueing networks is a fundamental problem in modern communications and computer networks. Stability (or recurrence) is known under various independence or ergodic conditions on the service and interarrival time processes if the “fluid or mean approximation” is asymptotically stable. The basic property of stability should be robust to variations in the data. Perturbed Liapunov function methods are exploited to give effective criteria for the recurrence under very broad conditions on the “driving processes” if the fluid approximation is asymptotically stable. In particular, stationarity is not required, and the data can be correlated. Various single class models are considered. For the problem of stability in heavy traffic, where one is concerned with a sequence of queues, both the standard network model and a more general form of the Skorohod problem type are dealt with and recurrence, uniformly in the heavy traffic parameter, is shown. The results can be extend ed to account for many of the features of queueing networks, such as batch arrivals and processing or server breakdown. While we concentrate on the single class network, analogous results can be obtained for multiclass systems.
KeywordsHeavy Traffic Queueing System Reflection Direction Service Completion Batch Arrival
Unable to display preview. Download preview PDF.
- Banks, J. and J.G. Dai. (1997). Simulation studies of multiclass queueing networks. IEE Trans., 29:213–219.Google Scholar
- Bramson, M. and J.G. Dai. (1999). Heavy traffic limits for some queueing networks. Preprint.Google Scholar
- Dai, J. and J. Vande Vate. (2001). The stability of two station multi-type fluid networks. To appear in Operations Research.Google Scholar
- Khasminskii, R. Z. (1982). Stochastic Stability of Differential Equations. Sijthoff, Noordhoff, Alphen aan den Rijn, Amsterdam.Google Scholar
- Kushner, H. J. (1972). Stochastic stability. In R. Curtain, editor, Stability of Stochastic Dynamical Systems; Lecture Notes in Math. 294, pages 97–124, Berlin and New York, Springer-Verlag.Google Scholar
- Kushner, H. J. (2000). Heavy Traffic Analysis of Controlled and Uncontrolled Queueing and Communication Networks. Springer Verlag, Berlin and New York.Google Scholar
- Lu, S. H. and P.R. Kumar. (1991). Distributed scheduling based on due dates and buffer priorities. IEEE Trans. on Automatic Control, 36:1406–1416.Google Scholar
- Solo, V. and X. Kong. (1995). Adaptive Signal Processing Algorithms. Prentice-Hall, Englewood Clffs, NJ.Google Scholar