Throughput analysis in closed queueing networks with finite buffers
Yazarlar (1)
Prof. Dr. Oruç Raif ÖNVURAL Beykoz Üniversitesi, Türkiye
| Makale Türü | Özgün Makale (Uluslararası alan indekslerindeki dergilerde yayınlanan tam makale) | ||
| Dergi Adı | Computer Science Rept., North Carolina State Univ., Raleigh, NC | ||
| Makale Dili | – | Basım Tarihi | 01-1987 |
| Makale Linki | https://www.academia.edu/download/107641792/CCSP_1987_02.pdf | ||
| UAK Araştırma Alanları |
Bilgisayar ve İletişim Ağları
|
||
| Özet |
| The behavior of throughput in closed queueing networks with finite buffers is studied as the number of customers changes from one to the capacity of the network. Based on the results obtained, an approximation algorithm is developed to calculate the throughput of large closed queueing networks under two different types of blocking mechanisms. Validation tests show that the algorithm is fairly accurate. |
| Anahtar Kelimeler |
