An asymmetric multiqueue with a single server, p priority levels of messages, one limited service and nonpreemptive discipline is approximately analyzed on the basis of the ‘independent hypothesis’. From a balance equation for the probabilities of the number of messages at the server’s arrival, probabilities for the number of messages and a mean cycle time of the server are derived. Next, a mean waiting time of message with each priority is calculated by using the root of the denominator of generating function. It is proved that the root exists within the weighted domain. For the mean waiting time, calculated values and simulated values in some cases are illustrated. In addition, with the ‘work conservation law’ the authors discuss a method to obtain an accurate mean waiting time. [In Japanese.]
