title: Stationary cycles in a deterministic service system
metadata.name: dc.contributor.author
metadata.value: Bure, Vladimir M.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Elfimov, Anton N.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Karelin, Vladimir V.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2018-04-05T09:07:33Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2018-04-05T09:07:33Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2018-03
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Bure V. M., Elfimov A. N., Karelin V. V. Stationary cycles in a deterministic service system. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2018, vol. 14, iss. 1, pp. 40–50.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: 10.21638/11701/spbu10.2018.105
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/9325
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The article describes a deterministic service system, which receives requests from three queues.
  Characteristics of the service system such as intensity and rate of service request are stable
  and do not depend on time. The paper introduces definitions of the stationary mode and the
  cycle of service for requirements from queues. The main aim this article is to find necessary and
  sufficient conditions imposed on the duration of the service cycles, under which the existence
  of a stationary mode of operation of the service system is obtained and guaranteed. When
  a stationary service mode is implemented, the possibility of infinite accumulation of requests
  is excluded, while the order of servicing queues is set in advance and does not change in the future. Within the framework of the mathematical model of the deterministic service system,
  some technological limitations have been introduced. The fulfillment of these limitations is
  necessary for the construction of an adequate model. In particular, it is assumed that the
  service of the requirement can’t be interrupted. The proof of the main result of the item is
  based on the solution of inequalities obtained by considering the mathematical model of the
  functioning of the service system. In the proof was given a geometric interpretation of the set of
  admissible (providing a stationary mode) durations of continuous service for requests received
  from the queues. Refs 12. Figs 2.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: Работа выполнена при финансовой поддержке Санкт-Петербургского государственного университета (грант № 9.38.205.2014).
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 14; Issue 1
metadata.lang: -
metadata.name: dc.subject
metadata.value: deterministic system service
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: service cycle
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: steady state
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Stationary cycles in a deterministic service system
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 05-Bure.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/9325/1/05-Bure.pdf
resources.format: Adobe PDF
resources.size: 392,08 kB