APPROXIMATE THROUGHPUT ANALYSIS OF CYCLIC QUEUING-NETWORKS WITH FINITE BUFFERS
Yazarlar (2)
Prof. Dr. Oruç Raif ÖNVURAL Maltepe Üniversitesi, Türkiye
Hg Perros Nc State College Of Engineering, Amerika Birleşik Devletleri
| Makale Türü | Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | IEEE Transactions on Software Engineering (Q4) | ||
| Dergi ISSN | 0098-5589 Wos Dergi Scopus Dergi | ||
| Dergi Tarandığı Indeksler | SCI | ||
| Makale Dili | İngilizce | Basım Tarihi | 01-1989 |
| Cilt / Sayı / Sayfa | 15 / 6 / 800–808 | DOI | 10.1109/32.24733 |
| Makale Linki | http://ieeexplore.ieee.org/document/24733/ | ||
| UAK Araştırma Alanları |
Bilgisayar ve İletişim Ağları
|
||
| Özet |
| An approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it is presented. The approximation method was developed for two different blocking mechanisms. It was also extended to the case of the central server model with blocking. Validation tests show that the algorithm is fairly accurate.<> |
| Anahtar Kelimeler |
| Blocking | closed queueing networks | deadlock |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 27 |
| Scopus | 35 |
| Google Scholar | 56 |