The Community for Technology Leaders
Green Image
Issue No. 06 - November (1979 vol. 5)
ISSN: 0098-5589
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.
time sharing systems, Bounded variation periodic functions, computer networks, computer system modeling, eigenvalue and eigenvector problem, periodic servers, queuing networks

D. Morgan and G. Gonnet, "Analysis of Closed Queuing Networks with Periodic Servers," in IEEE Transactions on Software Engineering, vol. 5, no. , pp. 653-659, 1979.
87 ms
(Ver 3.3 (11022016))