On the Large Deviations Behaviour of Acyclic Networks of G / G / 1 Queues 1

We consider a single class, acyclic network of G/G/1 queues. We impose some mild assumptions on the service and external arrival processes and we characterize the large deviations behaviour of all the processes resulting from various operations in the network. For the network model that we are considering, these operations are passing-through-a-single-serverqueue (the process resulting from this operation being the departure process), superposition of independent processes, and Bernoulli splitting of a process to a number of processes. We also characterize the large deviations behaviour of the waiting time and the queue length observed by a typical customer in a single server queue. We prove that the assumptions imposed on the external arrival processes are preserved by these operations, and we show how to inductively apply these results to obtain the large deviations behaviour of the waiting time and the queue length in all the queues of the network. Our results indicate how these large deviations occur, by concretely characterizing the most likely path that leads to them.

[1]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[2]  Venkat Anantharam,et al.  How large delays build up in a GI/G/1 queue , 1989, Queueing Syst. Theory Appl..

[3]  Dimitris Bertsimas,et al.  The departure process from a GI/G/1 queue and its applications to the analysis of tandem queues , 1990 .

[4]  S. Asmussen.  Conditioned limit theorems relating a random walk to its associate, with applications to risk reserve processes and the GI/G/ 1 queue , 1982 .

[5]  G. Parmigiani.  Large Deviation Techniques in Decision, Simulation and Estimation , 1992 .

[6]  David Tse,et al.  Variable-rate lossy compression and its effects on communication networks , 1995 .

[7]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[8]  James A. Bucklew,et al.  Large Deviation Techniques in Decision, Simulation, and Estimation , 1990 .

[9]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[10]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[11]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[12]  Philip Heidelberger,et al.  Effective Bandwidth and Fast Simulation of ATM Intree Networks , 1994, Perform. Evaluation.

[13]  Gustavo de Veciana,et al.  Bandwidth allocation for multiple qualities of service using generalized processor sharing , 1996, IEEE Trans. Inf. Theory.

[14]  Jean C. Walrand,et al.  Effective bandwidths: Call admission, traffic policing and filtering for ATM networks , 1995, Queueing Syst. Theory Appl..

[15]  J. Walrand,et al.  Effective Bandwidths: Call Admission, Traffic Policing & Filtering for , 1993 .

[16]  Richard J. Gibbens,et al.  Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..

[17]  Ward Whitt,et al.  Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues , 1993, Telecommun. Syst..

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

[19]  Cheng-Shang Chang,et al.  Effective bandwidths of departure processes from queues with time varying capacities , 1995, Proceedings of INFOCOM'95.

[20]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[21]  A. Dembo,et al.  Large deviations: From empirical mean and measure to partial sums process , 1995 .

[22]  Jean C. Walrand,et al.  Decoupling bandwidths for networks: a decomposition approach to resource management , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[23]  P. Glynn,et al.  Logarithmic asymptotics for steady-state tail probabilities in a single-server queue , 1994, Journal of Applied Probability.

[24]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[25]  Gustavo de Veciana,et al.  Traffic shaping for atm networks: asymptotic analysis and simulations , 1992 .

[26]  Costas Courcoubetis,et al.  EFFECTIVE BANDWIDTHS FOR STATIONARY SOURCES , 1995 .

[27]  J. Kingman.  Inequalities in the Theory of Queues , 1970 .

[28]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[29]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[30]  D. Bertsimas,et al.  The general distributional Little's law and its applications , 1991 .

[31]  Cheng-Shang Chang,et al.  Sample path large deviations and intree networks , 1995, Queueing Syst. Theory Appl..

[32]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.