Bridges and networks: exact asymptotics (Q1774188)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bridges and networks: exact asymptotics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bridges and networks: exact asymptotics |
scientific article |
Statements
Bridges and networks: exact asymptotics (English)
0 references
29 April 2005
0 references
Extending the Markov additive methodology developed by the second author [Ann. Appl. Probab. 9, No. 1, 110--145 (1999; Zbl 0937.60091)] and the authors [ibid. 11, No. 3, 569--607 (2001; Zbl 1016.60078)], it is applied, amongst other things, to a modified, stable, two-node Jackson network where the second server helps the first one whenever he is free. For the network referred to, the sharp asymptotics of the steady state distribution of the number of customers queued at each node as the number of customers queued at the first server grows large, are arrived at. The paper also contains some other relevant findings.
0 references
rare events
0 references
change of measure
0 references
h-transforms
0 references
quasi-stationary
0 references
queueing networks
0 references
0 references
0.7832047939300537
0 references
0.7832047939300537
0 references
0.7674036026000977
0 references
0.7561790943145752
0 references
0.7559589147567749
0 references