Optimal flow control of multi server time sharing queueing network with priority (Q2204251)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal flow control of multi server time sharing queueing network with priority |
scientific article |
Statements
Optimal flow control of multi server time sharing queueing network with priority (English)
0 references
15 October 2020
0 references
Summary: In this investigation, a multi server queueing network problem with cutoff priority is studied. The two types of input traffic are allowed in the system with different arrival rates. One type of input traffic has priority over the other type of traffic. Service times of the input traffic are independent and identically distributed according to exponential distribution. The maximum number of packets of each class traffic and the optimal input rates in the system are determined under the maximum allowed mean time delay and maximum input rate. The product type solution has been employed to obtain the queue size. Numerical illustrations are given to validate the analytical results.
0 references
cutoff priority
0 references
throughput
0 references
mean time delay
0 references
time sharing
0 references
blocking
0 references
probability
0 references
optimal flow control
0 references
multi server queueing networks
0 references