Stationary tail probabilities in exponential server tandems with renewal arrivals (Q2564185): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Ayalvadi J. Ganesh / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Venkat Anantharam / rank | |||
Normal rank |
Revision as of 13:44, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stationary tail probabilities in exponential server tandems with renewal arrivals |
scientific article |
Statements
Stationary tail probabilities in exponential server tandems with renewal arrivals (English)
0 references
23 January 1997
0 references
The model consists of two queues in series. Customers arrive in the first queue according to a renewal process, move to the second queue after receiving service, and leave the system after being served at the second queue. The authors estimate the tail stationary probability for these two exponential server queues. They give necessary and sufficient conditions on the path of the arrival and virtual service process in order to get a large queue size at the second queue.
0 references
tandem queue
0 references
large deviation rare event
0 references
queue
0 references
stationary probability
0 references