Bounds on the asymptotic buffer overflow probabilities of a parallel processing system
In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is, stabilize the system under the maximum possible arrival rates, when the buffers are of infinite capacity. However, very little is known regardi...
Uloženo v:
| Vydáno v: | 1998 Information Theory Workshop, Killarney, Ireland : Great Southern Hotel and Conference Centre, 22-26 June, 1998 s. 145 - 146 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
1998
|
| Témata: | |
| ISBN: | 9780780344082, 0780344081 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is, stabilize the system under the maximum possible arrival rates, when the buffers are of infinite capacity. However, very little is known regarding the delay or buffer overflow performance of weighted queue length policies in such queueing systems when the buffers are of finite capacity. We consider a time-slotted "fluid" queueing system consisting of two heterogeneous processors in parallel and two queues with finite capacity buffers. There are two classes of job flows. We present some preliminary results that use techniques of large deviations to derive upper and lower bounds on the asymptotic buffer overflow probabilities under any stabilizing scheduling policy (including weighted queue length policies) as the capacities of the buffers tend to infinity. The queueing system has applications in a number of wired and wireless telecommunication networks, computer systems, and flexible manufacturing systems. |
|---|---|
| ISBN: | 9780780344082 0780344081 |
| DOI: | 10.1109/ITW.1998.706484 |