On analysis of periodic polling systems (Q1040473)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On analysis of periodic polling systems |
scientific article; zbMATH DE number 5637670
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On analysis of periodic polling systems |
scientific article; zbMATH DE number 5637670 |
Statements
On analysis of periodic polling systems (English)
0 references
24 November 2009
0 references
Polling models have a wide range of applications especially in the area of telecommunications systems. This immense flow of publications is due to the great variety of service procedures that makes it difficult to investigate such systems in general. The majority of the polling systems investigations deal with the stationary regime at server attending points of time. In contrast to the classical studies on polling processes, which assume that a server continues attending queues, regardless of the presence of calls in the system, the proposed approach assumes that the system is partially controllable, and the queue attending procedure stops when there are no calls in the system. This way, the service processes of the polling systems become very close to the analogous processes of the priority queuing systems, which makes it possible to use for their analysis the tools of the theory of decomposable semi-regenerative processes.
0 references
polling systems
0 references
priority queueing systems
0 references