Abstract
We consider the problem of estimating tail probabilities of waiting times and queue lengths in statistical multiplexing systems with two classes of sources - one with high priority and the other with low priority. The priority discipline is assumed to be nonpreemptive. Exact expressions for the transforms of these quantities are derived assuming that packet or cell streams are generated by Markovian Arrival Processes (MAPs). Then we numerically investigate the large-buffer asymptotic behavior of the waiting-time distribution for low-priority sources and show that these asymptotics may be non-exponential.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1780-1785 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 2 |
| State | Published - 1997 |
| Event | Proceedings of the 1997 36th IEEE Conference on Decision and Control. Part 1 (of 5) - San Diego, CA, USA Duration: Dec 10 1997 → Dec 12 1997 |
ASJC Scopus subject areas
- Control and Optimization
- Control and Systems Engineering
- Modeling and Simulation