Queueing networks with finite capacities
Yazarlar (1)
Prof. Dr. Oruç Raif ÖNVURAL International Business Machines, Amerika Birleşik Devletleri
| Bildiri Türü |
Tebliğ/Bildiri
|
Bildiri Dili | İngilizce |
| Bildiri Alt Türü | Tam Metin Olarak Yayınlanan Tebliğ (Uluslararası Kongre/Sempozyum) | ||
| Bildiri Niteliği | |||
| DOI Numarası | 10.1007/bfb0013862 | ||
| Kongre Adı | Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics | ||
| Kongre Tarihi | / | ||
| Basıldığı Ülke | Basıldığı Şehir | ||
| Bildiri Linki | https://link.springer.com/content/pdf/10.1007%2FBFb0013862.pdf | ||
| UAK Araştırma Alanları |
Mühendislik
|
||
| Özet |
| In this paper, we give a tutorial of queueing networks with blocking. Except for a few special cases, these networks could not be shown to have product form solutions. Although the steady state queue length distributions of these networks can, in theory, be calculated by solving the global balance equations together with the normalization equation numerically, this procedure can, in practice, be restrictive due to the time complexity of the procedure and the large storage required to store the rate matrices, particularly for large networks. Since exact values of their steady state queue length distributions are, in general, not attainable, good approximation algorithms are required to analyze queueing networks with finite queues. |
| Anahtar Kelimeler |
