Verified computing of the stationary workload distribution of a GI/GI/1 server

Recent Advances in Circuits, Systems and Signal Processing

Volumn , Issue , 2002, Pages 169-174

  Fausten, Daniela ^a   Luther, Wolfram ^a   Hasslinger, Gerhard ^b  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Enclosure of complex roots; GI GI 1 workload distribution; Quality of service; Result verification

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; QUALITY OF SERVICE;

ENCLOSURE OF COMPLEX ROOTS; GI/GI/1 WORKLOAD DISTRIBUTION; RESULT VERIFICATION; ROUNDING ERRORS;

SERVERS;

EID: 4944248957     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Article

References (17)

1. Alefeld, G., Herzberger, J., Introduction to interval computations, Acad. Press, New York, 1983.
2. Chaudhry, M. L., Alternative Numerical Solutions of Stationary Queueing-Time Distributions in Discrete-Time Queues: GI/G/1, J. Opl. Res. Soc., Vol. 44, No. 10, 1993, pp. 1035-1051.
3. Elwalid, A., Mitra, D., Effective bandwidth of general Markovian traffic sources and admission control of high speed networks, IEEE & ACM Trans. on Networking, Vol. 1, 1993, pp. 329-343.
4. Engeln-Müllges, G., Uhlig, F., Numerical Algorithms with C, Springer, 1996.
5. Fausten, D., Luther, W., Verified solutions of systems of nonlinear polynomial equations, in: Walter Krämer, Jürgen Wolff v. Gudenberg (eds.), Scientific Computing, Validated Numerics, Interval Methods, Kluwer, 2001, pp. 141-152.
6. Hammer, R., Hocks, M., Kulisch, U., Ratz, D., Numerical Toolbox for Verified Computing I, Springer, 1993.
7. Haßlinger, G., A polynomial factorization approach to the discrete time GI/GI/1/(N) queue size distribution, Performance Evaluation, Vol. 23, 1995, pp. 217-240.
8. Haßlinger, G., Waiting times, busy periods and characterization of the output of a server analyzed via Wiener-Hopf factorization, Performance Evaluation, Vol. 40, 2000, pp. 3-26.
9. Haßlinger, G., Quality-of-Service analysis for statistical multiplexing with Gaussian distributed and autoregressive input modeling, Telecommunication Systems, Vol. 16, 2001, pp. 315-334.
10. Klatte, R., Kulisch, U., Wiethoff, A., Lawo, C., Rauch, M., C-XSC, Springer, 1993.
11. Kleinrock, L., Queueing systems, Vol. 1/2, Wiley, 1975/6.
12. Krämer, W., Die Berechnung von Standard-funktionen in Rechenanlagen (in German), in: Chatterji, S. D. et al. (eds.), Jahrbuch Überblicke Mathematik 1992, Vieweg, Braunschweig, 1992, pp. 97-115.
13. Latouche, G., Ramaswami, V., The PH/PH/1 queue at epochs of queue size change, Queueing Systems, Vol. 25, 1997, pp. 97-114.
14. Li, S.-Q., A general solution technique for discrete queueing analysis of multimedia traffic over ATM, IEEE Trans. on Commun., Vol. 39, 1991, pp. 1115-1132.
15. Lindley, D. V., The theory of queues with a single server, Proc. Cambridge Philos. Soc., Vol. 48, 1952, pp. 277-289.
16. Neuts, M. F., Matrix geometric solutions in stochastic models, John Hopkins, 1981.
17. http://www.math.uni-wuppertal.de/wrswt/xsc-sprachen.html