Article

Article title QUEUING MODELS TO OBTAIN CHARACTERISTICS OF AVAILABILITY
Authors Smirnov S.N.
Section SECTION II. SECURITY OF INFORMATION SYSTEMS AND NETWORKS
Month, Year 08, 2008 @en
Index UDC 681.018
DOI
Abstract The high bound for average service time, which guarantee a bound for waiting time in queuing system has been obtained. The exact solution has been derived for standard M/G/1 model and appoximate solution has been obtained for G /G/1 model. The problem also solved for Mn/Gn/1 model with non-preemptive priority and special kind queue with one priority class with preemptive priority which model a hardware fail.

Download PDF

Keywords arbitrary input system reliability, failure flow rate.
References 1. Башарин Г.П., Бочаров П.П., Коган Я.А. Анализ очередей в вычислительных сетях. Теория и методы расчета. – М.: Наука, 1989. – 336 с.
2. Клейнрок Л. Вычислительные системы с очередями – М.: Мир, 1979. – 600 с.
3. Смирнов С.Н. Метод проектирования систем с заданными задержками обслуживания. // Вестник Российского университета дружбы народов. Серия “Прикладная и компьютерная математика”. – М.: Изд-во Российского университета дружбы народов, 2003. Т.2. –
№ 1. – С. 52-67.
4. Cohen J.W. The single-server queue. – NY: Prentice-Hall, 1969. – 736 p.

Comments are closed.