Tandem queues with subexponential service times and finite buffers (Q600897)
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: Tandem queues with subexponential service times and finite buffers |
scientific article; zbMATH DE number 5809645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tandem queues with subexponential service times and finite buffers |
scientific article; zbMATH DE number 5809645 |
Statements
Tandem queues with subexponential service times and finite buffers (English)
0 references
3 November 2010
0 references
The authors study tandem queues with subexponential service times and finite waiting room between stations. They derive (max, +) linear recursion formulas for the departure times of customers from stations, and using these they obtain the tail asymptotics of the response and waiting times of the customers. They find these asymptotics for both communication blocking and manufacturing blocking schemes.
0 references
subexponential distribution
0 references
tail asymptotics
0 references
communication blocking
0 references
manufacturing blocking
0 references
response time
0 references
waiting time
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8194923996925354
0 references
0.8194923996925354
0 references
0.8154554963111877
0 references
0.813396155834198
0 references
