Exact analysis of asymmetric polling systems with single buffers
- 1 October 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (10) , 1119-1127
- https://doi.org/10.1109/26.7529
Abstract
A unified approach to general asymmetric polling systems with a single buffer at each station is presented. Two variations of single-buffer polling system are considered: the conventional system and the buffer-relaxation system. In the conventional system, a new massage is not allowed to queue until the previous message has been completely transmitted, while in the buffer-relaxation system, a newly arriving message can be stored in the buffer once the previous message's transmission has started. For each system, the Laplace-Stieltjies transform (LST) of the joint probability-distribution function (PDF) of station times is derived, from which the LST of the PDF of message delay is straightforwardly obtained.Keywords
This publication has 6 references indexed in Scilit:
- Performance Analysis of a Polling System with Single Buffers and Its Application to Interconnected NetworksIEEE Journal on Selected Areas in Communications, 1986
- Approximate Delay Analysis and Results for Asymmetric Token-Passing and Polling NetworksIEEE Journal on Selected Areas in Communications, 1986
- On the analysis of a symmetric polling system with single-message buffersPerformance Evaluation, 1985
- Exact Results for Nonsymmetric Token Ring SystemsIEEE Transactions on Communications, 1985
- The Efficiency of N Machines Uni-Directionally Patrolled by One Operative When Walking Time is Constant and Repair Times are VariableJournal of the Royal Statistical Society Series B: Statistical Methodology, 1957
- The Efficiency of N Machines Uni-Directionally Patrolled by One Operative When Walking Time and Repair Times are ConstantsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1957