Limit theorems for priority queues with patch processing in heavy traffic. I (Q756869)
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: Limit theorems for priority queues with patch processing in heavy traffic. I |
scientific article; zbMATH DE number 4192845
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Limit theorems for priority queues with patch processing in heavy traffic. I |
scientific article; zbMATH DE number 4192845 |
Statements
Limit theorems for priority queues with patch processing in heavy traffic. I (English)
0 references
1989
0 references
An M/G/1 queue with r types of customers is considered. Customers of type i-1 have priority over those of type i, and when the server becomes idle, he immediately serves the whole batch of customers having the lowest priority number. A heavy-traffic limit theorem is proved for the virtual waiting time \(w_ i\) of a batch that contains an i-request arriving at time t.
0 references
batch processing
0 references
priority queueing
0 references
heavy-traffic limit theorem
0 references
