In this paper a study of the transient behavior of sojourn distributions of particular customers traversing serial networks of single-server queues is presented. It is motivated by the need to project completion times of critical customers in loaded, capacitated queueing systems. In particular, serial networks with First-Come-First-Served queueing discipline which do not allow overtaking are considered. An analytic model based on a Markovian state space is shown to be computationally prohibitive even for relatively small scenarios. Given the limitation of the exact solution, heuristic schemes, based on a characterization of the behavior of the exact solution and the Central Limit Theorem, are developed as an alternative to digital Monte-Carlo simulation. A hybrid technique combining the estimated mean from one of the heuristics and the estimated variance from another proves to be accurate and efficient in approximating the mean and variance of the sojourn distribution in a variety of application scenarios.
Serial queueing networks Sojourn times Phase-type distributions
North Carolina State University
Birincil Dil | İngilizce |
---|---|
Konular | Sayısal Hesaplama ve Matematiksel Yazılım |
Bölüm | Research Article |
Yazarlar | |
Yayımlanma Tarihi | 30 Mayıs 2024 |
Gönderilme Tarihi | 29 Nisan 2024 |
Kabul Tarihi | 13 Mayıs 2024 |
Yayımlandığı Sayı | Yıl 2024 Cilt: 1 Sayı: 1 |