Makale detayı · 1989
APPROXIMATE THROUGHPUT ANALYSIS OF CYCLIC QUEUING-NETWORKS WITH FINITE BUFFERS
- Yıl
- 1989
- DOI
- 10.1109/32.24733
- Tür
- article
Veri kaynağı ayrımı
- YÖKSİS YÖKSİS makale kaydı
- YÖKSİS dergi adı IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
- Katalog eşleşmesi (ISSN) IEEE Transactions on Software Engineering
- OpenAlex OpenAlex zenginleştirmesi (özet, atıf, konular)
Özet
OpenAlex · İngilizce
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.>
Konular
Atıflar
OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.
41 atıf
OpenAlex cited_by_count (önbellek / veritabanı)