Mean waiting and sojourn times in multichannel priority systems
Abstract
A method is proposed to compute mean waiting and sojourn times for n-channel system with preemptive, non-preemptive and mixed priorities. Service time distributions are supposed to be distinct and arbitrary. The precision of the algorithm is demonstrated by a comparison with the results of imitation and calculations on the basis of «relation invariants». Closed priority systems are discussed.
Published
2006-12-20
How to Cite
Ryzhikov, Y. (2006). Mean waiting and sojourn times in multichannel priority systems. Information and Control Systems, (6), 43-49. Retrieved from http://proceedings.spiiras.nw.ru/index.php/ius/article/view/14569
Issue
Section
Information channels and medium