Performance analysis of Markovian polling systems with single buffers

DOI10.1016/0166-5316(94)90044-2zbMath0802.60090OpenAlexW2061366070MaRDI QIDQ4305002

No author found.

Publication date: 15 December 1994

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(94)90044-2

zbMATH Keywords

Laplace-Stieltjes transformscycle timemean queue lengthsjoint generating functionbuffer relaxationintervisit timeload-oriented- priority polling schemesmarginal generating functionMarkovian polling systemsingle buffersvirtual buffer model

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Queueing theory (aspects of probability theory) (60K25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (6)

Exact analysis of asymmetric random polling systems with single buffers and correlated input process ⋮ Large deviations of Markovian polling models with applications to admission control ⋮ Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times ⋮ On competitive analysis for polling systems ⋮ Mathematical methods to study the polling systems ⋮ Gated polling with stationary ergodic walking times, Markovian routing and random feedback

This page was built for publication: Performance analysis of Markovian polling systems with single buffers