D. Mitra
ABSTRACT
This paper gives a simple, accurate first order asymptotic analysis of the transient and steady state behavior of a network which is closed, not product-form and has multiple classes. One of the two nodes of the network is an infinite server and the discipline in the other node is discriminatory processor-sharing. Specifically, if there are nj jobs of class j at the latter node, then each class j job receives a fraction wj/(Σwini) of the processor capacity. This work has applications to data networks. For the asymptotic regime of high loading of the processor and high processing capacity, we derive the explicit first order transient behavior of the means of queue lengths. We also give explicit expressions for the steady state mean values and a simple procedure for finding the time constants (eigenvalues) that govern the approach to steady state. The results are based on an extension of Kurtz's theorem concerning the fluid limit of Markov processes. Some numerical experiments show that the analysis is quite accurate.
- 1.T. G. Kurtz, "Strong Approximation Theorems for Density Dependent Markov Chains", Stoch. Proc. Applic., 6 (1978), pp. 223.2443.Google Scholar
Cross Ref
- 2.A. Weiss, monograph in preparation, 1988.Google Scholar
- 3.A. G. Fraser, "Towards a Universal Data Transport System", IEEE J. Sel. Areas in Commun., SAC-I, No. 5, Nov. 1985, pp. 803.816.Google Scholar
- 4.A, O. Fraser and S. P. Morgan, "Queueing and Framing Disciplines for a Mixture of Data Traffic Types", AT&T Bell Labs. Tech. J., Vol. 63, No. 6, July.August 1984, pp. 1061-1087.Google ScholarCross Ref
- 5.C,-Y. Lo, "Performance Analysis and Applications of a Two-Priority Packet Queue", AT&T Tech. J., Vol. 66, May/June 1987, Issue 3, pp. 82-99.Google Scholar
- 6.L. Kleinrock, ''Time-shared systems: A theoretical treatment", i. ACM, Vol. 14, No. 2, April 1967, pp. 242-261. Google ScholarDigital Library
- 7.(3. Fayolle, I. Mitrani and R. Iasnosorodski, "Sharing a Processor Among Many Job Classes", J. ACM, Vol. 27, No. 3, July 1980, pp. 519-532. Google ScholarDigital Library
- 8.I. Mitrani and J. H. Hine, "Complete parameterized families of job schedulin8 strategies", Acta Inform., Vol. 8, 1977, pp. 61.73.Google ScholarDigital Library
- 9.V. E. BeneJ, "Mathemat/ca/ Theory of Connecrb~g Networks and Telephone Tra.O~", Chapter 6, Academic Press, 1965.Google Scholar
- 10.M.F. Norman, "A Central Limit Theorem For Markov Processes That Move By Small Steps", Ann. Prob., 1974, Vol. 2, No. 6, pp. 1065-1074.Google ScholarCross Ref
- 11.H. J. Kushner and D. S. Clark, "$wchastic. Approximation Methods for Constrained and Unconstrained Systems", Springer-Verlag, New York, 1978.Google ScholarCross Ref
- 12.L. Ljung, "Analysis of Recursive Stochastic Algorithms", IEEE Trans. Aut. Cont., Vol. AC-22, 1977, pp. 551-575.Google ScholarCross Ref
- 13.P. R. Kumar and P. V araiya, "$tochast/c Systems: Estimation, Identification and Adaptive Control", Prentice-Hall, 1986. Google ScholarDigital Library
- 14.A. Weiss, "A New Technique for Analyzing Large Traffic Systems", Adv. Appl. Prob., Vol. 18, 1986, pp. 506-532.Google ScholarCross Ref
- 15.D. Mitra, "Stochastic Fluid Models" in Performance '87, Ed. P.J. Courtois and O. Lawuche, Elsevier Science Publishers (North-Holland), 1988, pp. 39-51. Google ScholarDigital Library
- 16.J. McKenna, D. Mitra and K. G. llamakrishnan, "A Class of Closed Markovian Queuein8 Networks: Integral Representation, Asymptotic Expansions, and Generalizations", Bell. Sys. Tech. J., Vol. 60, May 1981, pp. 599-641.Google ScholarCross Ref
- 17.j. A. Morrison and D. Mitra, "Heavy-Usage Asymptotic Expansions for the Waiting Time in Closed Processor-Sharing Systems with Multiple Classes", Adv. Appl. Prob., Vol. 17, 1985, pp. 163-183.Google ScholarCross Ref
- 18.D, Mitra and A. Weiss, "The Transient Behavior in Erlang's Model for Large Trunk Groups and Various Traffic Conditions", Proc. 122 Int. Teletraffic Congress, Torino, June 1988, pp. 5.1B4.1-5.1B4.8.Google Scholar
- 19.M. I. Freidlin and A. D. Wentzell, "Random Perturbations of Dynamical Systems", Springer-Verlag, New York, 1984.Google ScholarCross Ref
- 20.S. R. S. Varadhan, "Large Deviations and Applications", SIAM, 1984.Google Scholar
- 21.R. Ellis, "Entropy, Large Deviations, and Statistical Mechanics", Springer-Verlag, New York, 1985.Google Scholar
- 22.A. Weiss and D. Mitra, "The Fluid Limit of a Markovian Closed Network with a Discriminatory Processor-Sharing Server", submitted for publication, 1988.Google Scholar
- 23.W. A. Coppel, "Stability and Asymptotic Behavior of Differential Equations", D.C. Heath & Co., Boston, 1965.Google Scholar
- 24.A.A. Weiss and D. Micra, "A transient analysis of a data network wlth a processor-sharing switch", AT&T Tech. J., Vol. 67, No. 5, 1988, pp. 4-16.Google ScholarCross Ref
- 25.S. N. Ethier and T.G. Kurtz, "Markov Processes: Characterization and Convergence", Wiley, New York, 1986.Google Scholar
Index Terms
- A closed network with a discriminatory processor-sharing server
Recommendations
Slowdown in the M/M/1 discriminatory processor-sharing queue
We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the ...
A closed network with a discriminatory processor-sharing server
This paper gives a simple, accurate first order asymptotic analysis of the transient and steady state behavior of a network which is closed, not product-form and has multiple classes. One of the two nodes of the network is an infinite server and the ...
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
We analyze a generalization of the discriminatory processor-sharing (DPS) queue in a heavy-traffic setting. Customers present in the system are served simultaneously at rates controlled by a vector of weights. We assume that customers have phase-type ...
Comments