An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks

We introduce a network model that allows us to capture the time-varying service delivered to a traffic stream due to the presence of random perturbations (e.g., cross-traffic in a communication network). We first present the model for a single network element and then describe how such elements may be interconnected using the operations offork andjoin. Such networks may be seen as a generalization of stochastic event graphs and of the class of fork-join networks. The departure processes in such a network satisfy a system of equations along with the exogenous arrival processes and the service processes of the various network elements. This system can be seen as a general time-varying linear system in the (min, plus) semi-field. We obtain an explicit representation of the departure process in terms of the exogenous arrival processes and the service processes. Sufficient conditions are derived for this system to have a unique solution. We also study liveness and absence of explosion in this class of networks. Under appropriate stationarity and ergodicity assumptions, we establish stability theorems for such networks. To this end we first obtain a rate result for the departure process in terms of the rates of the exogenous arrival process and the throughput of a saturated system. We then use this result to show that in a network with a single exogenous arrival, all queue lengths are finite with probability one if the arrival rate is less than the throughput of the saturated system, and to give a representation of the queue-length process. This class of networks allows for a detailed description of controlled sessions in integrated service networks. We also show that it contains several earlier discrete event models of the literature pertaining to stochastic Petri nets, service curves, and fork-join networks and show how the present model unifies them in a single algebraic structure. This structure is that of a semi-ring of functions of two real variables, where the addition is the pointwise minimum and the multiplication a generalization of inf-convolution.

[1]  J. Boudec Network Calculus Made Easy , 1996 .

[2]  J. Harrison,et al.  Reflected Brownian Motion on an Orthant , 1981 .

[3]  J. Kingman Subadditive Ergodic Theory , 1973 .

[4]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[5]  F. Baccelli Ergodic Theory of Stochastic Petri Networks , 1992 .

[6]  Cheng-Shang Chang On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[7]  Didier Dubois,et al.  A linear-system-theoretic view of discrete-event processes , 1983 .

[8]  François Baccelli,et al.  Generalized Precedence-Based Queueing Systems , 1992, Math. Oper. Res..

[9]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  François Baccelli,et al.  TCP is max-plus linear: and what tells us on its throughput , 2000, SIGCOMM.

[11]  F. Baccelli,et al.  On a Class of Stochastic Recursive Sequences Arising in Queueing Theory , 1992 .

[12]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[13]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1998, TNET.

[14]  Reinhard Lang,et al.  Spectral Theory of Random Schrödinger Operators , 1991 .

[15]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Rajeev Agrawal,et al.  Performance bonds for flow control protocols , 1999, TNET.

[17]  Rajeev Agrawal,et al.  Synchronous Constrained Uid Systems , 1995 .

[18]  Geert Jan Olsder,et al.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[19]  Cheng-Shang Chang Matrix extensions of the filtering theory for deterministic traffic regulation and service guarantees , 1998, IEEE J. Sel. Areas Commun..