Prognosis and optimization of homogeneous Markov message handling networks

Pavel Boček; Tomáš Feglar; Martin Janžura; Igor Vajda

Kybernetika (2001)

  • Volume: 37, Issue: 6, page [625]-646
  • ISSN: 0023-5954

Abstract

top
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.

How to cite

top

Boček, Pavel, et al. "Prognosis and optimization of homogeneous Markov message handling networks." Kybernetika 37.6 (2001): [625]-646. <http://eudml.org/doc/33556>.

@article{Boček2001,
abstract = {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.},
author = {Boček, Pavel, Feglar, Tomáš, Janžura, Martin, Vajda, Igor},
journal = {Kybernetika},
keywords = {message handling system; Markov network; optimization; recursive algorithm; message handling system; Markov network; optimization; recursive algorithm},
language = {eng},
number = {6},
pages = {[625]-646},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Prognosis and optimization of homogeneous Markov message handling networks},
url = {http://eudml.org/doc/33556},
volume = {37},
year = {2001},
}

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
PB - Institute of Information Theory and Automation AS CR
VL - 37
IS - 6
SP - [625]
EP - 646
AB - 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.
LA - eng
KW - message handling system; Markov network; optimization; recursive algorithm; message handling system; Markov network; optimization; recursive algorithm
UR - http://eudml.org/doc/33556
ER -

References

top
  1. Darbellay G. A., Vajda I., 10.1109/18.825848, IEEE Trans. Inform. Theory 46 (2000), 709–712 Zbl0996.94018MR1749003DOI10.1109/18.825848
  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 Zbl0913.68003
  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 (1981) 
  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 (1999) MR1704667
  6. Menéndez M., Morales D., Pardo, L., Vajda I., 10.1023/A:1013764612571, Appl. Math. 46 (2001), 401–420 Zbl1059.62001MR1865516DOI10.1023/A:1013764612571
  7. Menéndez M., Morales D., Pardo, L., Vajda I., 10.1081/STA-100001562, Comm. Statist. Theory Methods 30 (2001), 105–134 Zbl1008.62540MR1862592DOI10.1081/STA-100001562
  8. Morales D., Pardo L., Pardo M. C., Vajda I., 10.1007/s001840000060, Metrika 52 (2000), 97–113 MR1811265DOI10.1007/s001840000060
  9. Nelson R., Probability, Stochastic Processes, and Queueing Theory, Springer, New York 1995 Zbl0839.60002MR1340628
  10. Norris J. R., Markov Chains, Cambridge University Press, Cambridge 1997 Zbl1189.60152MR1600720
  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 MR1266845
  14. Walrand J., Introduction to Queueing Networks, Prentice–Hall, Englewood Cliffs, N.J. 1988 Zbl0854.60089
  15. Whittle P., Systems in Stochastic Equilibrium, Wiley, Chichester 1986 Zbl0665.60107MR0850012

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.