论文信息 - A perturbation method for solving some queues with processor sharing discipline

A perturbation method for solving some queues with processor sharing discipline

In this paper, we present a perturbation method of solving a second-order difference equation with variable coefficients with some additional assumptions. This method can be used to devise an algorithmic solution for the moments of sojourn times in some processor sharing queues. In particular, we examine three queues. The first has exponential service and a fairly general interrupted arrival mechanism. The second is a cyclic queue. The third is a model for a computer system in which finite and infinite sources interact. SOJOURN TIMES; COMMUNICATIONS SYSTEMS

Bhaskar Sengupta

[1] Marcel F. Neuts,et al. Matrix-Geometric Solutions in Stochastic Models , 1981 .

[2] R. Schassberger,et al. A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[3] R. Bellman. Perturbation techniques in mathematics, physics, and engineering , 1972 .

[4] Edward G. Coffman,et al. Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[5] T. Ott. THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .

[6] B. Sengupta,et al. A conditional response time of the M/M/1 processor-sharing queue , 1985, AT&T Technical Journal.

[7] Kiran M. Rege,et al. Response Time Distribution in a Multiprogrammed Computer with Terminal Traffic , 1988, Perform. Evaluation.

[8] O. J. Boxma,et al. The cyclic queue with one general and one exponential server , 1983, Advances in Applied Probability.

[9] Richard Bellman,et al. Introduction to Matrix Analysis , 1972 .

[10] Hans Daduna. Cycle Times in Two-Stage Closed Queueing Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory , 1986, Oper. Res..