This Article 
 Bibliographic References 
 Add to: 
Analysis of Closed Queuing Networks with Periodic Servers
November 1979 (vol. 5 no. 6)
pp. 653-659
G.H. Gonnet, Pontificia Universidade Catolica
A periodic network is a queuing network whose steady-state behavior is not constant in time, but repeats itself in a cycle. This behavior may be caused by the introduction of periodic servers, e.g., paging drums. The model presented is a generalization of some other models of queuing networks, and provides a more general definition of steady-state behavior. A theoretical solution is presented. Examples of theoretical and approximate solutions are presented for a well-known queuing network model of a computer system.
Index Terms:
time sharing systems, Bounded variation periodic functions, computer networks, computer system modeling, eigenvalue and eigenvector problem, periodic servers, queuing networks
G.H. Gonnet, D.E. Morgan, "Analysis of Closed Queuing Networks with Periodic Servers," IEEE Transactions on Software Engineering, vol. 5, no. 6, pp. 653-659, Nov. 1979, doi:10.1109/TSE.1979.230201
Usage of this product signifies your acceptance of the Terms of Use.