Analyzing a two-stage queueing system with many point process arrivals at upstream queue (Q702046)
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: Analyzing a two-stage queueing system with many point process arrivals at upstream queue |
scientific article; zbMATH DE number 2128481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analyzing a two-stage queueing system with many point process arrivals at upstream queue |
scientific article; zbMATH DE number 2128481 |
Statements
Analyzing a two-stage queueing system with many point process arrivals at upstream queue (English)
0 references
17 January 2005
0 references
A two-stage queueing network is considered where 1st (upstream) queue can be treated as one of the core routers with large capacity, and the downstream queues represent the periphery routers with a much smaller capacity. It is assumed that after being served at the upstream queues, the \(N\) different flows are routed to many different downstream queues. It is proved that for the point arrival process the steady-state overflow probability at a given downstream queue is asymptotically the same as for a single stage queue with the corresponding fraction of the original input (instead of corresponding fraction of the output from stage 1). This result (called a network decomposition) has been recently established (by the same authors) for many arrival fluid sources. The main difference between these inputs concerns the value of the large deviation rate function at zero which in turn implies the difference of the behavior of the overflow probability as the number of sources \(N\) goes to infinity.
0 references
two-stage queueing network
0 references
overflow probabilities
0 references
many-sources-asymptotics
0 references
0.88436973
0 references
0.8834462
0 references
0.8807148
0 references
0.8778281
0 references
0.87418526
0 references
0.8729778
0 references
0.8713639
0 references