Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/192898
Title: | A Tandem Queueing System With Renewal Input |
Authors: | Klimenok, V. Kim, C. S. |
Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика ЭБ БГУ::ОБЩЕСТВЕННЫЕ НАУКИ::Информатика |
Issue Date: | 2009 |
Publisher: | Минск:РИВШ |
Citation: | Массовое обслуживание : потоки, системы, сети : материалы междунар. науч. конф. «Современные математические методы анализа и оптимизации информационно-телекоммуникационных сетей», Минск, 26 - 29 янв. 2009 г. Вып. 20 / редкол. : А. Н. Дудин (отв. ред.) [и др.]. - Минск : РИВШ, 2009. - С.108-113. |
Abstract: | We consider a tandem qucueing system consisting of two stations in serious. The first station is represented by a single-server queue with renewal input, PH (Phase-type) service time distribution and waiting room. After service at the first station a customer proceeds to the second station that is described by a single-server queue without a buffer. In case a customer completes the service at the first server and meets the second server being busy, it waits until the second server becomes free and then occupies this server immediately. The waiting period is accompanied by blocking the first stage server operation. The service time of a customer by the second server has the Ptf-type distribution. We derive the ergodicity condition and calculate the stationary distribution of the system states. The Laplace-Stielijes transforms of the distribution of the sojourn time at both the stations as well as the whole system are derived. The mean values of these sojourn times are calculated. |
URI: | http://elib.bsu.by/handle/123456789/192898 |
ISBN: | 978-985-500-244-5 |
Appears in Collections: | 2009. Массовое обслуживание: потоки, системы, сети |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Klimenok.pdf | 757,23 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.