On deciding stability of multiclass queueing networks under buffer priority scheduling policies
One of the basic properties of a queueing network is stability. Roughly speaking, it is the property that the total number of jobs in the network remains bounded as a function of time. One of the key questions related to the stability issue is how to determine the exact conditions under which a give...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Mathematical Statistics
2011
|
| Online Access: | http://hdl.handle.net/1721.1/64941 https://orcid.org/0000-0001-8898-8778 |