Algorithm of calculation of the operating characteristics of closed-loop queuing systems with absolute priorities
A two-phase closed-loop queueing system is considered in which calls belonging to R priority-ordered classes are circulating. The first phase has one server (arbitrary distribution of the time of service of calls served in accordance with an absolute priority discipline), the second phase has a number of service lines larger than the total number of calls in the system and an exponential distribution of the sojourn time. \(q_ p\), \(t_ p\), \(\tau_ p\), \(\lambda_ p\) are resp. the average number, average time of sojourn in the first and second phase, rate of the flow of calls of class p; \(q^*_ p\), \(t^*_ p\), \(\tau^*_ p\), \(\lambda^*_ p\) are resp. the aggregate analogues for the first p classes. Using the relations between these two sets of parameters, a fixed point algorithm is proposed aiming at determining accurate approximatios for the parameters \(\lambda_ p\), \(t_ p\), \(q_ p\).
- A Fixed-Point Algorithm for Closed Queueing Networks
- Computational algorithms of optimization of closed queuing networks
- An iterative method for computing closed queueing networks
- Characteristics of optimal workload allocation for closed queueing networks
- Determination of the characteristics of the total amount of customers in queues with absolute priority
- Queue length in an absolute priority system with hyperexponential input flow
- scientific article; zbMATH DE number 870457
- Calculation of output characteristics of a priority queue through a busy period analysis
- An operational approach to perturbation analysis of closed queuing networks
This page was built for publication: Algorithm of calculation of the operating characteristics of closed-loop queuing systems with absolute priorities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079478)
