The problem of stability in queueing theory

The problem of stability is enclosed in this paper in a more general characterization problem for queueing. A queueing process is treated as a mapping F from the set \({\mathcal U}\) of input data U into the set \({\mathcal V}\) of output data V. Let \(Z=(U,V)\) and \(W=W(Z)\) be some mapping \({\mathcal U}\times {\mathcal V}\to {\mathcal W}\) which is called ``observation. Let us fix subsets \({\mathcal U}^*\subset {\mathcal U}\), \({\mathcal W}^*\subset {\mathcal W}\), \({\mathcal Z}^*\subset {\mathcal U}\times {\mathcal V}\). Then a pure characterisation problem is as follows: \[ \{Z\in {\mathcal Z}^*,\quad W\in {\mathcal W}^*\}\Leftrightarrow \{U\in {\mathcal U}^*\}\Rightarrow \{V\in F({\mathcal U}^*)\}. \] Delivering metrics in sets U,V,W it is easy to formulate the stability problem for this characterization. As for queues, the mentioned sets are that of probability distribitions or random variables (as a rule). So, the main instrument of stability analysis is the theory of probability metrics. Using this approach the author shows different estimates of continuity of queues (mainly, single-server ones under different suppositions on input flow and service times), stability estimates for characterizations of input flows (using aging properties of inter-arrival times), and estimates of approximation accuracy.

Recommendations

Cites work

Cited in

(24)

This page was built for publication: The problem of stability in queueing theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122882)