Issue No.03 - May (1981 vol.7)
R.M. Bryant , Department of Computer Sciences and the Madison Academic Computing Center, University of Wisconsin-Madison
Operational analysis replaces certain classical queueing theory assumptions with the conditions of "homogeneous service times" and "on-line= off-line behavior." In this paper we explore the relationship between the operational and classical concepts for the sample paths of an M/G/1 queueing system. The primary results are that the sample paths can have these operational properties with nonzero probability if and only if the service time is exponential. We also state dual results for interarrival times in G/M/l. Additionally, we show that open, feedforward networks of single server queues can have product form solutions valid across a range of system arrival rates if and only if all of the service times are exponential. Finally, we consider the relationship between the operational quantities S(n) and the mean service time in M/G/1. This relationship is shown to depend on the form of the service time distribution. It follows that using operational analysis to predict the performance of an M/G/1 queueing system will be most successful when the service time is exponential. Simulation evidence is presented which supports this claim.
service functions, Computer system modeling, decomposition, G/M/1, M/G/1, networks of queues, operational analysis
R.M. Bryant, "On Homogeneity and On Line=Off-Line Behavior in M/G/1 Queueing Systems", IEEE Transactions on Software Engineering, vol.7, no. 3, pp. 291-299, May 1981, doi:10.1109/TSE.1981.230840