On analysis of periodic polling systems (Q1040473): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A model of the polling system for studying the broadband wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical methods to study the polling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity and stability of periodic polling models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5621834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187128 / rank
 
Normal rank

Latest revision as of 04:52, 2 July 2024

scientific article
Language Label Description Also known as
English
On analysis of periodic polling systems
scientific article

    Statements

    On analysis of periodic polling systems (English)
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references