img
img
APPROXIMATE THROUGHPUT ANALYSIS OF CYCLIC QUEUING-NETWORKS WITH FINITE BUFFERS       
Yazarlar (2)
Prof. Dr. Oruç Raif ÖNVURAL Prof. Dr. Oruç Raif ÖNVURAL
Nc State College Of Engineering, Amerika Birleşik Devletleri
Hg Perros
Nc State College Of Engineering, Amerika Birleşik Devletleri
Devamını Göster
Özet
We present an approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it. 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. © 1989 IEEE
Anahtar Kelimeler
Blocking | closed queueing networks | deadlock
Makale Türü Özgün Makale
Makale Alt Türü SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale
Dergi Adı IEEE Transactions on Software Engineering
Dergi ISSN 0098-5589 Wos Dergi Scopus Dergi
Dergi Tarandığı Indeksler SCI
Dergi Grubu Q4
Makale Dili İngilizce
Basım Tarihi 01-1989
Cilt No 15
Sayı 6
Sayfalar 800 / 808
DOI Numarası 10.1109/32.24733