Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T19:41:53.807Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  14 July 2016

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.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2008