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ı | |||
| Makale Dili | – | Basım Tarihi | 01-1988 |
| Cilt / Sayı / Sayfa | 0 / 0 / 1501–1501 | DOI | – |
| Makale Linki | https://elibrary.ru/item.asp?id=7518838 | ||
| UAK Araştırma Alanları |
Bilgisayar ve İletişim Ağları
|
||
| Özet |
| In recent years, there has been a growing interest in the development of computational methods for the analysis of queueing networks with finite buffers. This is primarily due to a growing need to model actual systems which have finite capacity resources such as production systems, computer systems, distributed systems and flexible manufacturing systems.An important feature of networks with finite buffers is that a server can become blocked when the capacity limitation of another queue (ie destination) is reached. Various blocking mechanisms, which arose out of studying real life systems, have been considered in the literature so far. In this study, we first compared the most commonly used blocking mechanisms that have been reported in the literature. The objective of these comparisons was to obtain equivalencies between different types of blocking. |
| Anahtar Kelimeler |
