An Approximation for Performance Evaluation of Stationary Single Server Queues

IEEE Transactions on Communications

Volumn 42, Issue 12, 1994, Pages 3150-3160

  Addie, Ronald G ^a   Zukerman, Moshe ^b  

^a UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

^b Telecom Research Laboratories   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATA COMMUNICATION EQUIPMENT; MARKOV PROCESSES; PARAMETER ESTIMATION; QUEUEING THEORY; STATE SPACE METHODS; STATISTICS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

AUTOCOVARIANCE SUM; AUTOREGRESSIVE PROCESSES; FINITE DIMENSIONAL CASE; FUNCTIONAL EQUATION; STATISTICAL MULTIPLEXER; VARIABLE BIT RATE;

DATA COMMUNICATION SYSTEMS;

EID: 0028715509     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.339836     Document Type: Article

References (44)

1. R. G. Addie. “Queues with semi—Markov input and service times,” in, Teletraffic Issues in an Advanced Information Society, Proceedings of the Eleventh International Teletraffic Congress, M. Akiyama, Ed. New York: North—Holland, 1985, Part 1, pp. 336–342.
2. R. G. Addie, “Theory and applications of discrete time Markov additive processes,” Ph.D. dissertation, Monash Univ., Aug. 1986.
3. R. G. Addie and M. Zukerman, “An asymptotically accurate method for performance evaluation of semi-Markov queues with large state space,” in Proc.6th ATRS, Wollongong, Australia, Nov. 1991.
4. R. G. Addie and M. Zukerman, “An approximate solution of a semi—Markov queue with large state space,” Proc. 13th ITC Copenhagen, Denmark, June 1991.
5. D. Anick, D. Mitra, and M. M. Sondhi, “Stochastic theory of a data handling system with multiple resources,” Bell Syst Tech. J., vol. 61, no. 8, pp. 1871–1894, 1982.
6. E. Arjas, “On a fundamental identity in the theory of semi-Markov processes,” Advances in Appl. Prob., vol. 4, pp. 258–270, 1972.
7. E. Arjas, “On the use of a fundamental identity in the theory of semi-Markov Markov queues,” Advances in Appl. Prob., vol. 4, pp. 271–284, 1972.
8. E. Arjas and T. P. Speed, “Symmetric Wiener-Hopf factorizations in Markov-additive processes,” Z. Wahrscheinlichkeitstheorie und Verwandt wandt Gebeite, vol 26, pp. 105–118, 1973.
9. Von F. L. Bauer, “Ein direktes Iterationsverfahren zur Hurwitz—Zerlegung eines Polynoms,” Archiv der Electrischen Ubertragung, vol. 9, pp. 285–290, 1955.
10. B. Bensaou, J. Guibert and J. W. Roberts, “Fluid approximation for a superposition of on/off sources,” in Proc. ITC Seminar, Morristown, NJ, Oct. 1990.
11. G. Doetsch, Introduction to the Theory and Applications of the Laplace Transforms. New York: Springer Verlag, 1970.
12. K. W. Fendick, V. R. Saksena, and W. Whitt, “Dependence in packet queues,” IEEE Trans. Commun., vol. 37, Nov. 1989.
13. O. Gihr and P. Tran-Gia, “A layered description of ATM cell traffic streams and correlation analysis,” ATR, vol. 24, no. 2, pp. 9–18, 1990.
14. J. J. Gordon, “Modelling bursty traffic with two—state sources,” ATR, vol. 24, no. 2, pp. 51–63, 1990.
15. P. R. Halmos, Measure Theory. New York: Springer-Verlag, 1974.
16. O. Hashida, Y. Takahashi, and B. Sengupta, “Switched batch Bernoulli process (SBBP) and the discrete—time SBBP /G/1 queue with application to statistical multiplexer performance,” IEEE J. Select. Areas Commun., vol. 9, pp. 394–401, Apr. 1991.
17. H. Heffes, “A class of data traffic processes—covariance function characterization and related queueing results,” Bell Syst. Tech. J., vol. 59, pp. 897–929, 1980.
18. H. Heffes and D. Lucantoni, “A Markov modulated characterization of voice and data traffic and related statistical multiplexer performance,” IEEE J. Select. Areas Commun., vol. SAC-4, pp. 856–867, Sept. 1986.
19. J. F. C. Kingman, “The single server queue in heavy traffic,” in Proc. Camb. Phil. Soc., vol. 57, 1961, pp. 902–904.
20. J. F. C. Kingman, “On queues in heavy traffic,” J. Roy. Statist. Soc., vol. B24, pp. 383–392, 1962.
21. L. Kleinrock, Queueing Systems, Volume 1: Theory New York: Wiley, 1975.
22. J. Lamperti, Stochastic Processes-A Survey of the Mathematical Theory. New York: Springer—Verlag, 1977.
23. S.Q. L i and C. L. Hwang, “Queue response to input correlation functions: Discrete spectral analysis” in Proc. INFOCOM '92, Florence, Italy, May 1992, 3C.1.
24. B. Maglaris, D. Anastassiou, P. Sen, G. Karlsson, and J. Robbins, “Performance models of statistical multiplexing in packet video communications,” IEEE Trans. Commun., vol. 36, pp. 834–844, July 1988.
25. K. S. Meier—Hellstern, “A fitting algorithm for Markov—modulated Poisson process having two arrival rates,” European J. Oper. Res., vol. 29, pp. 370–377, 1987.
26. H. D. Miller, “A convexity property in the theory of random variables defined on a finite Markov chain,” Ann. Math. Statist., vol. 32, pp. 1260–1270, 1961.
27. H. D. Miller, “A matrix factorization problem in the theory of random variables Defined on a Finite Markov Chain,” Proc. Cambridge Philos. Soc. math. phys., vol. 58, pp. 268–285, 1962.
28. H. D. Miller, “Absorption probabilities for sums of random variables defined on a finite Markov chain,” in Proc. Cambridge Philos. Soc. math. phys., vol. 58, 1962, pp. 286–298.
29. M. F. Neuts, “The single server queue with Poisson input and semi—Markov service times,” J. Appl. Prob., vol. 3, 202–230, 1966.
30. Matrix—Geometric Solutions in Stochastic Models: An Algorithmic Approach. Baltimore, MD: The John Hopkins University Press, 1981.
31. I. NOITOS, J. W. Roberts, A. Simonian, and J. T. Virtamo, “The superposition of variable bit rate sources in an ATM multiplexer,” IEEE J. Select. Areas Commun., vol. 9, pp. 378–387, Apr. 1991.
32. E. Nummelin, General Irreducible Markov Chains and Non-negative Operators,. Cambridge, England: Cambridge University Press, 1984.
33. R. E. A. C. Paley and N. Wiener, “Fourier transforms in the complex domain,” Amer. Math. Soc., 1934.
34. E. L. Presman, “Factorization methods and boundary problems for sums of random variables given on a Markov chain,” Math. USSR Izvestiya, vol. 3, no. 4, pp. 815–852, 1969.
35. V. Ramaswami, “Traffic performance modelling for packet communication whence, where and wither,” in Proc. 3rd ATRS, Nov. 1988.
36. S. M. Ross, Applied Probability Models with Optimization Applications. San Francisco, CA: Holden—Day, 1970.
37. M. H. Rossiter, “A switched Poisson model for data traffic,” ATR, vol. 21, no. 1, 1987.
38. L. A. Sahnovic, “On the factorization of an operator-valued transfer function,” Soviet Math. Dokl., vol. 17, pp. 203–207, 1976.
39. H. Saito, M. Kawarasaki and H. Yamada, “An analysis of statistical multiplexing in an ATM transport network,” IEEE J. Select. Areas Commun., vol. 9, pp. 359–367, Apr. 1991.
40. W. L. Smith, “On the distribution of queueing times,” in Proc. Cambridge Phil. Soc., vol. 49, pp. 449–461, 1953.
41. K. Sriram and W. Whitt, “Characterizing superposition arrival processes in packet multiplexers for voice and data,” IEEE J. Select. Areas Commun., vol. SAC-4, pp. 833–846, Sept. 1986.
42. L. Takacs, “A Banach space of matrix functions and its application in the theory of queues,” Sankhya, vol. 38, pp 201–211, 1976.
43. H. C. Tijms, Stochastic Modelling and Analysis: A Computational Approach,. New York: Wiley, 1986.
44. M. Zukerman and I. Rubin, “Queue size and delay analysis for a communication system subject to traffic activity mode changes,” IEEE Trans. Commun., vol. COM-34, pp. 622–628, June 1986.