Diffusion approximation of star-shaped symmetric networks with losses (Q1177805): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implied costs in loss networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Blocking probabilities in large circuit-switched networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3035879 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5560061 / rank | |||
Normal rank | |||
Latest revision as of 11:36, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diffusion approximation of star-shaped symmetric networks with losses |
scientific article |
Statements
Diffusion approximation of star-shaped symmetric networks with losses (English)
0 references
26 June 1992
0 references
A star-like circuit switching queueing network is considered. Blocked calls are lost. As the main process a vector-valued process of the numbers of lines with a given number of busy channels is examined. The main result states that when the number of nodes tends to infinity, this process (after scaling) weakly converges to a certain multidimensional Ornstein-Uhlenbeck process. The proof is based on the analysis of the infinitesimal generator of the above process.
0 references
loss model
0 references
queueing network
0 references
number of busy channels
0 references
Ornstein-Uhlenbeck process
0 references
infinitesimal generator
0 references
