1987
DOI: 10.1080/17442508708833469
|View full text |Cite
|
Sign up to set email alerts
|

Brownian models of open queueing networks with homogeneous customer populations

Abstract: We consider a family of multidimensional diffusion processes that arise as heavy traffic approximations for open queueing networks. More precisely, the diffusion processes considered here arise as approximate models of open queueing networks with homogeneous customer populations, which means that customers occupying any given node or station of the network are essentially indistinguishable from one another. The classical queueing network model of J. R. Jackson fits this description, as do other more general ty… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

6
294
0
1

Year Published

1998
1998
2011
2011

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 302 publications
(301 citation statements)
references
References 20 publications
6
294
0
1
Order By: Relevance
“…Arratia in [5] (see also [4]) observes that instead of Brownian motion, if one considers the exclusion process associated with the nearest neighbor random walk on Z, then the corresponding stationary system of spacings between particles can be interpreted as a finite or infinite series of queues. We direct the reader to the seminal articles by Harrison and his coauthors for a background on systems of Brownian queues: [16], [17], [18], [19], and [20]. Baryshnikov [7] establishes the connections between Brownian queues and GUE random matrices.…”
Section: Introductionmentioning
confidence: 99%
“…Arratia in [5] (see also [4]) observes that instead of Brownian motion, if one considers the exclusion process associated with the nearest neighbor random walk on Z, then the corresponding stationary system of spacings between particles can be interpreted as a finite or infinite series of queues. We direct the reader to the seminal articles by Harrison and his coauthors for a background on systems of Brownian queues: [16], [17], [18], [19], and [20]. Baryshnikov [7] establishes the connections between Brownian queues and GUE random matrices.…”
Section: Introductionmentioning
confidence: 99%
“…if b ∈ C then the corresponding constrained diffusion is transient [5]. In the context of the constant drift case, this necessary and sufficient condition for positive recurrence, for constrained diffusions which correspond to single class networks, was first proved in [14].…”
Section: Introductionmentioning
confidence: 99%
“…Static planning problems are formulated by constructing a system where the fluid-scaled processes are replaced by their long-run averages (or fluid limits) and solving a suitable optimization problem involving those averages (see [19,25,28,29]). In the fluid limit, we formulate a deterministic problem to choose ρ andμ that maximize the profit rate subject to stability conditions on both queues.…”
Section: Static Planning Problemmentioning
confidence: 99%