scientific article; zbMATH DE number 4043000

From MaRDI portal
Publication:3780228





[For the entire collection see Zbl 0636.00014.] We provide a survey of sample-path methods in queueing theory, particularly in connection with ``distribution-free analysis such as (i) relations between customer averages and time averages, such as \(L=\lambda W\) (Little's formula); (ii) relations between the stationary distribution of a process and an imbedded process; and (iii) the phenomenon of insensitivity. We compare these results to those obtained in the computer-science literature by operational analysis, in which behavior of processes over finite time intervals is emphasized. We study probabilistic assumptions under which relations between ensemble averages can be inferred from such finite-time behavior. (Without some probabilistic assumptions, operational analysis is limited to describing past behavior, rather than predicting future behavior.) The theory of random (marked) point processes provides a natural set of weak probabilistic assumptions. We discuss the relationship between the sample-path approach and the point- process approach.











This page was built for publication:

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