论文信息 - A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems

A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems

We give a discrete-time model for a central server computer system, and show that the equilibrium distribution is of product-form Given the requests for workload at the different stations of a cycle, we compute the conditional cycle time distribution, which is linear in that requests.

Hans Daduna | Rolf Schassberger | R. Schassberger | H. Daduna

[1] Leonard Kleinrock,et al. Time-shared Systems: a theoretical treatment , 1967, JACM.

[2] Frank Kelly,et al. Reversibility and Stochastic Networks , 1979 .

[3] Hans Daduna,et al. Networks of queues in discrete time , 1983, Z. Oper. Research.

[4] A. Barbour,et al. INSENSITIVE AVERAGE RESIDENCE TIMES IN GENERALIZED SEMI-MARKOV PROCESSES , 1981 .

[5] Rolf Schassberger,et al. The doubly stochastic server: A time-sharing model , 1981, Z. Oper. Research.

[6] Shoichi Noguchi,et al. An Analysis of the M/G/1 Queue Under Round-Robin Scheduling , 1971, Oper. Res..

[7] Jeffrey P. Buzen,et al. Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.