Geodesic
Prognosis and optimization of homogeneous Markov message handling networks
Kybernetika, Tome 37 (2001) no. 6, pp. 625-646
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well as the practical applicability of the program are illustrated on a hypermarket network with 34 servers at different locations of the Czech Republic.
Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well as the practical applicability of the program are illustrated on a hypermarket network with 34 servers at different locations of the Czech Republic.
Classification : 60J20, 60J27, 62M05, 68M12, 90B15, 90B18
Keywords: message handling system; Markov network; optimization; recursive algorithm 
@article{KYB_2001_37_6_a0,
     author = {Bo\v{c}ek, Pavel and Feglar, Tom\'a\v{s} and Jan\v{z}ura, Martin and Vajda, Igor},
     title = {Prognosis and optimization of homogeneous {Markov} message handling networks},
     journal = {Kybernetika},
     pages = {625--646},
     year = {2001},
     volume = {37},
     number = {6},
     mrnumber = {1936992},
     zbl = {1265.60140},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2001_37_6_a0/}
}
TY  - JOUR
AU  - Boček, Pavel
AU  - Feglar, Tomáš
AU  - Janžura, Martin
AU  - Vajda, Igor
TI  - Prognosis and optimization of homogeneous Markov message handling networks
JO  - Kybernetika
PY  - 2001
SP  - 625
EP  - 646
VL  - 37
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_2001_37_6_a0/
LA  - en
ID  - KYB_2001_37_6_a0
ER  - 
%0 Journal Article
%A Boček, Pavel
%A Feglar, Tomáš
%A Janžura, Martin
%A Vajda, Igor
%T Prognosis and optimization of homogeneous Markov message handling networks
%J Kybernetika
%D 2001
%P 625-646
%V 37
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_2001_37_6_a0/
%G en
%F KYB_2001_37_6_a0
Boček, Pavel; Feglar, Tomáš; Janžura, Martin; Vajda, Igor. Prognosis and optimization of homogeneous Markov message handling networks. Kybernetika, Tome 37 (2001) no. 6, pp. 625-646. http://geodesic.mathdoc.fr/item/KYB_2001_37_6_a0/

[1] Darbellay G. A., Vajda I.: Entropy expressions for multivariate continuous distributions. IEEE Trans. Inform. Theory 46 (2000), 709–712 | DOI | MR | Zbl

[2] Esteban M., Castellanos M., Morales, D., Vajda I.: A comparative study of the normality tests based on sample entropies. Comm. Statist. Simulation Comput., to appear

[3] Higginbottom G. N.: Performance Evaluation of Communication Networks. Artech House, Boston 1998 | Zbl

[4] Janžura M., Boček P.: Stochastic Methods of Prognosis of Parameters in Data Networks (in Czech). Research Report No. 1981, Institute of Information Theory and Automation, Prague 2000

[5] Menéndez M., Morales D., Pardo, L., Vajda I.: Inference about stationary distributions of Markov chains based on divergences with observed frequencies. Kybernetika 35 (1999), 265–280 | MR

[6] Menéndez M., Morales D., Pardo, L., Vajda I.: Minimum disparity estimators for discrete and continuous models. Appl. Math. 46 (2001), 401–420 | DOI | MR | Zbl

[7] Menéndez M., Morales D., Pardo, L., Vajda I.: Approximations to powers of $\phi $-disparity goodness of fit tests. Comm. Statist. Theory Methods 30 (2001), 105–134 | DOI | MR | Zbl

[8] Morales D., Pardo L., Pardo M. C., Vajda I.: Extension of the Wald statistics to models with dependent observations. Metrika 52 (2000), 97–113 | DOI | MR

[9] Nelson R.: Probability, Stochastic Processes, and Queueing Theory. Springer, New York 1995 | MR | Zbl

[10] Norris J. R.: Markov Chains. Cambridge University Press, Cambridge 1997 | MR | Zbl

[11] Pardo M. C., Pardo, L., Vajda I.: Consistent tests of homogeneity for independent samples from arbitrary models, submitte.

[12] Pattavina A.: Switching Theory: Architecture and Performance in Broadbard ATM Networks. Wiley, New York 1998

[13] Dijk N. M. van: Queueing Networks and Product Forms. A System Approach. Wiley, New York 1993 | MR

[14] Walrand J.: Introduction to Queueing Networks. Prentice–Hall, Englewood Cliffs, N.J. 1988 | Zbl

[15] Whittle P.: Systems in Stochastic Equilibrium. Wiley, Chichester 1986 | MR | Zbl