AVERAGE SHARE OF NOT-COMPLETELY-SERVED DEMANDSIN QUEUING SYSTEMS (QS)


Cite item

Full Text

Abstract

In this article a special characteristic is entered - an average share of not-completely-served demands. It is shown that this characteristic is defined by a difference of the second and first initial moments of demands number arriving during each interval of a holding time.

References

  1. Основы теории вычислительных систем. Под ред. С.А. Майорова. М.: Высшая школа, 1978. - 408 с.
  2. Клейнрок Л. Вычислительные системы с очередями. Пер. с англ. М.: Мир, 1979. - 600 с.

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2009 Likhttsinder B.Y., Makarov I.S., Lichtzinder B.Y., Makarov I.S.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies