Time-Dependent Analysis Of Queueing Systems

References

• Ackroyd, M.H. (1982) “M/M/1 transient state occupancy probabilities via the discrete Fourier transform,” IEEE Trans. Comm., COM-30:3
   Google Scholar
• Agrawala, A.K. and S.K. Tripathi (1980) “Transient solution of the virtual waiting time of a single server queue and its applications,” Information Sciences, 21, 141–58
   Google Scholar
• Agrawala, A.K. S.K. Tripathi, and G. Ricart (1982) “Adaptive routing using a virtual waiting time technique,” IEEE Trans. Soft. Engin., SE-4, 76–81
   Google Scholar
• Badel, M. E. Gelenbe, J. Leroudier, and D. Potier (1975), “Adaptive optimization of a time-sharing system’s performance,” Proc. IEEE, 63 (June), 958–65
   Google Scholar
• Baiocchi, C. A.C. Capelo, V. Comincioli, and G. Serazzi (1983) “A mathematical model for transient analysis of computer systems,” Performance Evaluation, 3, 247–64
   Google Scholar
• Blasgen M. et al. (1979) “The convoy phenomenon,” Operating Systems Review, 13, 20–5
   Google Scholar
• Clark, G.M. (1981) “Use of Polya Distributions in approximate solution to nonstationary M/M/s queues,” Comm. of ACM, 24, 206–17
   Google Scholar
• Clark, A.B. (1953) “On time dependent waiting line processes,” Ann. Math. Statist., 24, 491–2
   Google Scholar
• Cohen, J.W. (1982) The Single Server Queue (Second ed.). Amsterdam: North Holland
   Google Scholar
• Coviello, G.J. O.L. Lake, and G.R. Redino (1977) “System design implications of packetized voice,” Int. Comm. Conf. Rec, 3, Chicago
   Google Scholar
• Chang, S.S.L. (1977) “Simulation of transient and time varying conditions in queueing networks,” Proc. 7th Annual Pittsburgh Conference, Modelling and Simulation, 8: 2, Pittsburgh
   Google Scholar
• Duda, A. (1983a) “Transient diffusion approximation for some queueing systems,” Performance Evaluation Review, Special Issue (August), 118–28
   Google Scholar
• (1983b) “Application of the transient diffusion approximation to adaptive routing,” Research Report No. 14, ISEM, Orsay, France
   Google Scholar
• (1984)” Analysis and modeling of the transient behavior of computer systems,” Docteur-Ingenieur thesis, Universite de Paris-Sud, Orsay, France
   Google Scholar
• Fan, W. (1976) “Simulation of queueing network with time varying arrival rates,” Mathematics and Computers in Simulation, 18, 165–70
   Google Scholar
• Gaver, D.P. Jr (1968) “Diffusion approximation and models for certain congestion problems,” J. Appl. Prob., 5, 607–23
   Google Scholar
• Gelenbe, E. (1975) “On approximate computer system models,” J. of ACM 22, 261–9
   Google Scholar
• Gelenbe, E. and G. PujoUe (1976) “The behavior of a single queue in a general queueing network,” Acto/n/ormai/ca, 7, 123–36
   Google Scholar
• Gelenbe, E. and A. Kurinckx (1978) “Random injection control of multiprogramming in virtual memory,” IEEE Trans. on Soft. Engin., SE-4: (January)
   Google Scholar
• Grassmann, W.K. (1977) “Transient solutions in markovian queueing systems,” Comput. & Ops. Res., 4, 47–53
   Google Scholar
• Harrison, P.J. (1981) “Time-dependent properties of queueing networks,” J. Applied Prob.
   Google Scholar
• Heyman, D.P. and W. Whitt (1984) “The asymptotic behavior of queues with time-varying arrival rates,” J. Applied Prob., 21, 143–56
   Google Scholar
• Iglehart, D.L. and W. Whitt (1970) “Multiple Channel Queues in Heavy Traffic,” Parts i and II, Adv. Appl. Frob., 2, 150–77, 355–64
   Google Scholar
• Jones, S.K. R.K. Cavin, and D.A. Johnston (1980) “An Efficient Computational Procedure for the Evaluation of the M/M/1 Transient State Occupancy Probabilities,” IEEE Trans, on Comm., COM-28: 12, 2019–20
   Google Scholar
• Kobayashi, H. (1974a) “Application of the diffusion approximation to queueing networks i: Equilibrium queue distributions,” J. of ACM 21, 316–28
   Google Scholar
• (1974b) “Application of the diffusion approximation to queueing networks ii: Nonequilibrium distributions and applications to computer modelling,” J. of ACM, 21, 459–69
   Google Scholar
• Kotiah, T.C.T. (1978) “Approximate transient analysis of some queueing systems,” Oper. Res., 26, 334–46
   Google Scholar
• Kouvatsos, D.D. and M.A. El-Affendi (1985) “On the analysis of the G/G/1 Queue,” Research Report, CCR18. University of Bradford
   Google Scholar
• Kuehn, P.J. (1979) “Apprpximate analysis of general queuing networks by decomposition,” IEEE Trans. Comm., coM-27, 113–26
   Google Scholar
• Labetoulle, J. (1984) “Performance evaluation of communication networks,” Proc. Int. Conf. Modelling Techniques and Tools for Performance Analysis, May, Paris, France
   Google Scholar
• Lederman, W. and G.E.H. Reuter (1954) “Spectral theory for the differential equations of simple birth and death processes,” Phil. Trans. R. Soc. A9, 246, 321–69
   Google Scholar
• Lewis, P.A.W. andG.S. Shedler (1976) “Statistical analysis of non-stationary series of events in a data base system,” IBM Joumal of Research and Development, 20: 5, 465–82
   Google Scholar
• Marshall, K.T. (1968) “Some relationships between the distributions of waiting time, idle time and interoutput time in the G/G/1 queue,” SIAM J. Appl. Math., 16, 324–7
   Google Scholar
• Moore, S.C. (1975) “Approximating the behavior of non-stationary single-server queue,” Opcr. Res., 23, 1011–32
   Google Scholar
• Morse, P.M. (1958) Queues, Inventories and Maintenance. New York; Wiley and Sons
   Google Scholar
• Newell, G.F. (1971) Applications of queueing theory. Londcjn: Chapman and Hall
   Google Scholar
• Rider, K.L. (1976) “A simple approximation to the average queue size in the time dependent WMIl queue,” J. of ACM 23, 361–7
   Google Scholar
• Rothkopf, M.H. and S.S. Oren (1979) “A closure approximation for the nonstationary M/M/s queue,” Management Sci., 25, 522–34
   Google Scholar
• Sevcik, K.C. A.L Levy, S.K. Tripathi, and J.L. Zahorjan (1977) “Improving Approximations of Aggregated Queuing Network Subsystems,” in K.M. Chandy and M. Reiser (eds.) Computer Performance. New York: North-Holland
   Google Scholar
• Skoog, R.A. (1984) “Transient considerations in the performance of ring-based packet switches,” Proc. 2nd Int. Symp. Performance of Computer-Communication Systems, 3–16, Zurich
   Google Scholar
• Stehfest, H. (1970) “Numerical inversion of Laplace transforms,” Comm. of ACM 13, 47–8
   Google Scholar
• Stem, T.E. (1979) “Approximations of queue dynamics and their application to adaptive routing in computer-communication networks,’ EEEE Trans. Comm., COM-27, 1331–5
   Google Scholar
• Upton, R.A. (1984) “A transient analysis of computer communication networks,” PHDthesis, University of Maryland
   Google Scholar
• Upton, R.A. and S.K. Tripathi (1982) “An approximate transient analysis of the M(t)/m/l queue,” Performance Evaluation, 2, 118–32
   Google Scholar
• (1984) “An analysis of integrated voice and data buffer 7 channel sharing schemes in a packet communication network,” Tech. Report No. 1313, University of Maryland, Department of Computer Science
   Google Scholar
• Van As, H.R. (1984) “Congestion control in packet switching networks by a dynamic foreground-background storage strategy,” Proc. 2nd Int. Symp. Performance of Computer-Communication Systems, 433–8, Zurich
   Google Scholar
• Whitt, W. (1982) “On the heavy-traffic limit theorem for GI/G/oo queues,” Adv. Appl. Prob., 14, 171–90
   Google Scholar
• (1983) “The Queueing Network Analyzer,” Bell System Technical Joumal, 62, 2779–815
   Google Scholar