Hostname: page-component-cb9f654ff-c75p9 Total loading time: 0 Render date: 2025-08-24T20:06:53.123Z Has data issue: false hasContentIssue false
  • English
  • Français

Diffusion Approximation of State-Dependent G-Networks Under Heavy Traffic

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Saul C. Leite  and
Marcelo D. Fragoso
Saul C. Leite*
Affiliation:
LNCC
Marcelo D. Fragoso*
Affiliation:
LNCC
*
∗ Postal address: Departamento de Sistemas e Controle, LNCC, CEP 25651-075, Quitandinha, Petrópolis, RJ, Brazil.
∗∗ Email address: Email address: frag@lncc.br
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper is concerned with the characterization of weak-sense limits of state-dependent G-networks under heavy traffic. It is shown that, for a certain class of networks (which includes a two-layer feedforward network and two queues in tandem), it is possible to approximate the number of customers in the queue by a reflected stochastic differential equation. The benefits of such an approach are that it describes the transient evolution of these queues and allows the introduction of controls, inter alia. We illustrate the application of the results with numerical experiments.

Keywords

Heavy-traffic approximationG-network

MSC classification

Secondary: 60K25: Queueing theory

Information

Type
Research Article
Information
Journal of Applied Probability , Volume 45 , Issue 2 , June 2008 , pp. 347 - 362
Copyright
Copyright © Applied Probability Trust 2008 

References

[1] Altman, E. and Kushner, H. J. (1999). Admission control for combined guaranteed performance and best effort communications systems under heavy traffic. SIAM J. Control Optimization 37, 1780–1807.CrossRefGoogle Scholar
[2] Altman, E. and Kushner, H. J. (2002). Control of polling in presence of vacations in heavy traffic with applications to satellite and mobile radio systems. SIAM J. Control Optimization 41, 217–252.Google Scholar
[3] Arazi, A., Ben-Jacob, E. and Yechiali, U. (2004). Bridging genetic networks and queueing theory. Physica A 332, 585–616.Google Scholar
[4] Arazi, A., Ben-Jacob, E. and Yechiali, U. (2005). Controlling an oscillating Jackson-type network having state-dependent service rates. Math. Meth. Operat. Res. 62, 453–466.CrossRefGoogle Scholar
[5] Artalejo, J. R. (2000). G-networks: a versatile approach for work removal in queueing networks. Europ. J. Operat. Res. 126, 233–249.Google Scholar
[6] Atalay, V. and Gelenbe, E. (1992). Parallel algorithm for color texture generation using the random neural network model. Internat. J. Pattern Recognition Artificial Intelligence 6, 437–446.Google Scholar
[7] Atalay, V., Gelenbe, E. and Yalabik, N. (1992). The random neural network model for texture generation. Internat. J. Pattern Recognition Artificial Intelligence 6, 131–141.Google Scholar
[8] Billingsley, P. (1968). Convergence of Probability Measures. John Wiley, New York.Google Scholar
[9] Bocharov, P. P., Gavrilov, E. V. and Pechinkin, A. V. (2004). Exponential queuing network with dependent servicing, negative customers, and modification of the customer type. Automation Remote Control 65, 35–59.Google Scholar
[10] Borovkov, A. (1964). Some limit theorems in the theory of mass service. I. Theory Prob. Appl. 9, 550–565.CrossRefGoogle Scholar
[11] Borovkov, A. (1965). Some limit theorems in the theory of mass service. II. Theory Prob. Appl. 10, 375–400.Google Scholar
[12] Brémaud, P. (1981). Point Processes and Queues, Martingale Dynamics. Springer, New York.Google Scholar
[13] Buche, R. and Kushner, H. J. (2002). Control of mobile communications with time-varying channels in heavy traffic. IEEE Trans. Automatic Control 47, 992–1003.Google Scholar
[14] Chakka, R. and Do, T. V. (2007). The mm ∑{k=1}k cpp_k/ge/c/l G-queue with heterogeneous servers: steady state solution and an application to performance evaluation. Performance Evaluation 64, 191–209.Google Scholar
[15] Chao, X. (1995). A queueing network model with catastrophes and product form solution. Operat. Res. Lett. 18, 75–79.Google Scholar
[16] Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks. Springer, New York.Google Scholar
[17] Fourneau, J. and Verchère, D. (1995). G-networks with triggered batch state-dependent movement. In MASCOTS '95: Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (Washington, DC), IEEE, New York, pp. 33–37.Google Scholar
[18] Fourneau, J., Gelenbe, E. and Suros, R. (1996). G-networks with multiple classes of negative and positive customers. Theoret. Comput. Sci. 155, 141–156.Google Scholar
[19] Gaver, D. P. (1968). Diffusion approximations and models for certain congestion problems. J. Appl. Prob. 5, 607–623.Google Scholar
[20] Gelenbe, E. (1975). On approximate computer system models. J. Assoc. Comput. Mach. 22, 261–269.Google Scholar
[21] Gelenbe, E. (1989). Random neural networks with negative and positive signals and product form solution. Neural Computation 1, 502–511.Google Scholar
[22] Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. J. Appl. Prob. 28, 656–663.Google Scholar
[23] Gelenbe, E. (1993). G-networks with triggered customer movement. J. Appl. Prob. 30, 742–748.Google Scholar
[24] Gelenbe, E. (1994). G-networks: a unifying model for neural and queueing networks. Ann. Operat. Res. 48, 433–461.Google Scholar
[25] Gelenbe, E. (2007). Steady-state solution of probabilistic gene regulatory networks. Phys. Rev. E 76, 031903.Google Scholar
[26] Gelenbe, E. and Fourneau, J. (2002). G-networks with resets. Performance Evaluation 49, 179–191.CrossRefGoogle Scholar
[27] Gelenbe, E. and Hussain, K. F. (2002). Learning in the multiple class random neural network. IEEE Trans. Neural Networks 13, 1257–1267.Google Scholar
[28] Gelenbe, E. and Pujolle, G. (1976). The behaviour of a single queue in a general queueing network. Acta Informatica 7, 123–136.CrossRefGoogle Scholar
[29] Gelenbe, E. and Schassberger, R. (1992). Stability of product form G-networks. Prob. Eng. Inf. Sci. 6, 271–276.Google Scholar
[30] Gelenbe, E. and Stafylopatis, A. (1991). Global behavior of homogeneous random neural systems. Appl. Math. Modelling 15, 534–541.Google Scholar
[31] Gelenbe, E., Mang, X. and Onvural, R. (1996). Diffusion based statistical call admission control in atm. Performance Evaluation 27, 411–436.Google Scholar
[32] Gelenbe, E., Mang, X. and Onvural, R. (1997). Bandwidth allocation and call admission control in high-speed networks. IEEE Commun. Mag. 35, 122–129.Google Scholar
[33] Gòmez-Corral, A. (2002). On a tandem G-network with blocking. Adv. Appl. Prob. 34, 626–661.Google Scholar
[34] Gòmez-Corral, A. and Martos, M. E. (2006). Performance of two-stage tandem queues with blocking: the impact of several flows of signals. Performance Evaluation 63, 910–938.CrossRefGoogle Scholar
[35] Guffens, V., Gelenbe, E. and Bastin, G. (2006). Qualitative dynamical analysis of queueing networks with inhibition. In INTERPERF '06: Proceedings from the 2006 Workshop on Interdisciplinary Systems Approach in Performance Evaluation and Design of Computer & Communications Sytems, ACM, New York.Google Scholar
[36] Harrison, P. G. (2004). Compositional reversed Markov processes, with applications to G-networks. Performance Evaluation 57, 379–408.Google Scholar
[37] Harrison, P. G. and Pitel, E. (1996). The M/G/1 queue with negative customers. Adv. Appl. Prob. 28, 540–566.CrossRefGoogle Scholar
[38] Henderson, W., Nothcote, B. S. and Taylor, P. G. (1994). State dependent signalling in queueing networks. Adv. Appl. Prob. 26, 436–455.Google Scholar
[39] Iglehart, D. L. and Whitt, W. (1970). Multiple channel queues in heavy traffic. I. Adv. Appl. Prob. 2, 150–177.Google Scholar
[40] Jarvis, D. and Kushner, H. J. (1996). Codes for optimal stochastic control: documentation and users guide. Tech. Rep. 96-3, Brown University.Google Scholar
[41] Kingman, J. F. C. (1961). The single server queue in heavy traffic. Proc. Camb. Philos. Soc. 57, 902–904.Google Scholar
[42] Kloeden, P. E., Platen, E. and Schurz, H. (1994). Numerical Solution of SDE Through Computer Experiments. Springer, New York.Google Scholar
[43] Kushner, H. J. (2001). Heavy Traffic Analysis of Controlled Queueing and Communication Networks. Springer, New York.Google Scholar
[44] Kushner, H. J. and Dupuis, P. G. (1992). Numerical Methods for Stochastic Control Problems in Continuous Time. Springer, New York.Google Scholar
[45] Kushner, H. J. and Martins, L. F. (1993). Heavy traffic analysis of a data transmission system with many independent sources. SIAM J. Appl. Math. 53, 1095–1122.Google Scholar
[46] Kushner, H. J., Yang, J. and Jarvis, D. (1995). Controlled and optimally controlled multiplexing systems: a numerical exploration. Queueing Systems 20, 255–291.Google Scholar
[47] Leite, S. C. and Fragoso, M. D. (2007). On the analysis of G-queues under heavy traffic. Submitted.Google Scholar
[48] Li, Q. and Zhao, Y. Q. (2004). A MAP/G/1 queue with negative customers. Queueing Systems 47, 5–43.Google Scholar
[49] Mandelbaum, A. and Gennady, P. (1998). State-dependent stochastic networks. Part I. Approximations and applications with continuous diffusion limits. Ann. Appl. Prob. 8, 569–646.Google Scholar
[50] Prohorov, Yu. (1963). Transient phenomena in process of mass service. Litovsk. Mat. Sb. 3, 199–205 (in Russian).Google Scholar
[51] Reiman, M. I. (1984). Open queueing networks in heavy traffic. Math. Operat. Res. 9, 441–458.Google Scholar
[52] Shin, Y. W. (2007). Multi-server retrial queue with negative customers and disasters. Queueing Systems 55, 223–237.Google Scholar
[53] Whitt, W. (1972). Complements to heavy traffic limit theorems for the GI/G/1 queue. J. Appl. Prob. 9, 185–191.Google Scholar
[54] Whitt, W. (1974). Heavy traffic limit theorems for queues: a survey. In Mathematical Methods in Queueing Theory (Lecture Notes in Econom. Math. Systems 98), eds Beckmann, M. and Kunzi, H. P., Springer, New York, pp. 307–350.Google Scholar