Abstract
Priority queueing is the basic technique for providing real-time Quality of Service to packet-based networking. The mathematical analysis of priority queues with general traffic models is, however, prohibitively difficult, in particular when the traffic is long-range dependent. This paper provides some important steps forward in this direction. Our analysis is the first mathematically rigorous treatment of path-space large deviations of priority queues with class-wise heterogeneous Gaussian input having an arbitrary correlation structure. This includes the computation of the most probable paths that lead to overflow in one of the queues. Compared with earlier work on the same topic, the paper provides three novel contributions: a new representation of the workload in the low-priority queues, an exact characterization of the most probable paths, and an extension of the analysis to virtual waiting times, in addition to queue lengths.
| Original language | English |
|---|---|
| Title of host publication | Performance Challenges for Efficient Next Generation Networks |
| Subtitle of host publication | Proceedings of the 19th International Teletraffic Congress ITC19 |
| Pages | 1135-1144 |
| Publication status | Published - 2005 |
| MoE publication type | A4 Article in a conference publication |
| Event | 19th International Teletraffic Congress, ITC 19 - Beijing, China Duration: 29 Aug 2005 → 2 Sept 2005 Conference number: 19 |
Conference
| Conference | 19th International Teletraffic Congress, ITC 19 |
|---|---|
| Abbreviated title | ITC19 |
| Country/Territory | China |
| City | Beijing |
| Period | 29/08/05 → 2/09/05 |
Keywords
- priority queue
- large deviations
- Gaussian processes
- fractional Brownian motion