Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-10T20:49:17.995Z Has data issue: false hasContentIssue false
  • English
  • Français

A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks

Published online by Cambridge University Press:  14 July 2016

James McKenna
James McKenna*
Affiliation:
AT&T Bell Laboratories
*
∗Postal address: AT&T Bell Laboratories Murray Hill, NJ 07974, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Little's theorem states that under very general conditions L = λW, where L is the time average number in the system, W is the expected sojourn time in the system, and λ is the mean arrival rate to the system. For certain systems it is known that relations of the form E((L)l) = λ lE((W)l) are also true, where (L)l = L(L – 1)· ·· (L – l + 1). It is shown in this paper that closely analogous relations hold in closed, product-form queueing networks. Similar expressions relate Nji and Sji, where Nji is the total number of class j jobs at center i and Sji is the total sojourn time of a class j job at center i, when center i is a single-server, FCFS center. When center i is a c-server, FCFS center, Qji and Wji are related this way, where Qji is the number of class j jobs queued, but not in service at center i and Wji is the waiting time in queue of a class j job at center i. More remarkably, generalizations of these results to joint moments of queue lengths and sojourn times along overtake-free paths are shown to hold.

Type
Research Papers
Information
Journal of Applied Probability , Volume 26 , Issue 1 , March 1989 , pp. 121 - 133
Copyright
Copyright © Applied Probability Trust 1989 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975) Open, closed, and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260.Google Scholar
[2] Brumelle, S. L. (1971) On the relation between customer and time averages in queues. J. Appl. Prob. 8, 508–520.Google Scholar
[3] Brumelle, S. L. (1972) A generalization of L = λW to moments of queue length and waiting times. Operat. Res. 20, 1127–1136.Google Scholar
[4] Daduna, H. (1982) Passage times for overtake-free paths in Gordon–Newell networks. Adv. Appl. Prob. 14, 672–686.CrossRefGoogle Scholar
[5] Gelenbe, E. and Mitrani, I. (1980) Analysis and Synthesis of Computer Systems. Academic Press, New York.Google Scholar
[6] Glynn, P. and Whitt, W. (1986) A central-limit-theorem version of L = λW. Queueing Systems 2, 191–225.Google Scholar
[7] Glynn, P. and Whitt, W. (1988) Extensions of the queueing relations L = λW and H = ?G. Operat. Res. Google Scholar
[8] Gould, H. W. (1972) Combinatorial Identities. Morgantown Printing and Binding Co., Morgantown, WV.Google Scholar
[9] Gross, D. and Harris, C. M. (1974) Fundamentals of Queueing Theory. Wiley, New York.Google Scholar
[10] Heffes, H. (1982) Moment formulae for a class of mixed multi-job-type queueing networks. Bell System Tech. J. 61, 709–745.Google Scholar
[11] Kelly, F. P. (1975) Networks of queues with customers of different types. J. Appl. Prob. 12, 542–554.Google Scholar
[12] Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.CrossRefGoogle Scholar
[13] Kelly, F. P. and Pollett, P. K. (1983) Sojourn times in closed queueing networks. Adv. Appl. Prob. 15, 638–656.CrossRefGoogle Scholar
[14] Little, J. D. C. (1961) A proof of the queueing formula: L = λW. Operat. Res. 9, 383–387.Google Scholar
[15] Marshall, K. T. and Wolff, R. W. (1971) Customer average and time average queue lengths and waiting times. J. Appl. Prob. 8, 535–542.CrossRefGoogle Scholar
[16] McKenna, J. (1987) Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product form queueing networks. J. Assoc. Comput. Mach. 34, 985–1003.Google Scholar
[17] McKenna, J. and Mitra, D. (1982) Integral representation and asymptotic expansions for closed queueing networks: normal usage. Bell System Tech. J. 61, 661–683.Google Scholar
[18] McKenna, J. and Mitra, D. (1984) Asymptotic expansions and integral representations of queue lengths in closed Markovian networks. J. Assoc. Comput. Mach. 31, 346–360.CrossRefGoogle Scholar
[19] Mitra, D. and McKenna, J. (1986) Asymptotic expansions for closed Markovian networks with state-dependent service rates. J. Assoc. Comput. Mach. 33, 568–592.CrossRefGoogle Scholar
[20] Sevcik, K. C. and Mitrani, I. (1981) The distribution of network states at input and output instants. J. Assoc. Comput. Mach. 28, 358–371.Google Scholar
[21] Stidham, S. (1972) L = λW: A discounted analog and a new proof. Operat. Res. 20, 1115–1126.CrossRefGoogle Scholar
[22] Stidham, S. (1974) A last word on L = λW. Operat Res. 22, 417–421.Google Scholar
[23] Walrand, J. and Varaiya, P. (1980) Sojourn times and the overtaking condition in Jackson networks. Adv. Appl. Prob. 12, 1000–1018.Google Scholar