Décomposition de M -matrice et buffer d’un multiplexeur ATM

J. Pellaumail

RAIRO - Operations Research - Recherche Opérationnelle (1992)

  • Volume: 26, Issue: 2, page 153-175
  • ISSN: 0399-0559

How to cite

top

Pellaumail, J.. "Décomposition de $M$-matrice et buffer d’un multiplexeur ATM." RAIRO - Operations Research - Recherche Opérationnelle 26.2 (1992): 153-175. <http://eudml.org/doc/105035>.

@article{Pellaumail1992,
author = {Pellaumail, J.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {-matrix; -matrix; irreducible positive matrix; steady-state probability; multiplexing ATM channels; Asynchronous Transfer Mode; messages; buffers},
language = {fre},
number = {2},
pages = {153-175},
publisher = {EDP-Sciences},
title = {Décomposition de $M$-matrice et buffer d’un multiplexeur ATM},
url = {http://eudml.org/doc/105035},
volume = {26},
year = {1992},
}

TY - JOUR
AU - Pellaumail, J.
TI - Décomposition de $M$-matrice et buffer d’un multiplexeur ATM
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 2
SP - 153
EP - 175
LA - fre
KW - -matrix; -matrix; irreducible positive matrix; steady-state probability; multiplexing ATM channels; Asynchronous Transfer Mode; messages; buffers
UR - http://eudml.org/doc/105035
ER -

References

top
  1. [BeP] R. BELLAMINE et J. PELLAUMAIL, Opérateurs positifs et probabilités stationnaires, R.A.I.R.O., Rech. Opér., 1989, 3. Zbl0678.90037MR1025079
  2. [BP] A. BERMAN et R. J. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences, Academic Press, 1979. Zbl0484.15016MR544666
  3. [Boy] P. BOYER, Bearer capabilities in ATM networks, Race 1022 workshop, Paris, October 1989, C.N.E.T., Lannion. 
  4. [Chu] K. L. CHUNG, Markov Chains with Stationary Transition Probabilities,Springer-Verlag, 1967. Zbl0146.38401MR217872
  5. [Duf] I. S. DUFF, Research Direction in Sparse Matrix Computations, Stud. Math., 1984, 24, p. 83-139, Springer-Verlag. Zbl0595.65025MR925212
  6. [Gan] F. R. GANTMACHER, Théorie des matrices, Dunod, Paris, 1966. Zbl0136.00410
  7. [GoM] G. H. GOLUB et G. A. MEURANT, Résolution numérique des grands systèmes linéaires, Eyrolles, Paris, 1983. Zbl0646.65022MR756627
  8. [GoV] G. H. GOLUB et C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University press, 1983. Zbl0733.65016MR733103
  9. [HeG] G. HEBUTERNE, A. GRAVEY, A Space-Priority Queueing Mechanism for Multiplexing ATM Channels, I.T.C. Specialist Seminar, Adelaide, September 1989. 
  10. [Leb] J. Y. LE BOUDEC, An efficient solution method for Markov models of ATM links with loss priorities, IEEE J. Commun., 1991, 9, 3. 
  11. [LJG] G. LATOUCHE, P. A. JACOBS, D. P. GAVER, Finite Markov chain skip free in one direction, Naval Res. Logist., Quarterly, 31, 1984, p. 571-588. Zbl0551.90097MR767056
  12. [Neu] M. F. NEUTS, 1. Matrix-geometric Solutions in Stochastic Models , The Johns Hopkins University Press, London, 1981. Zbl0469.60002MR618123
  13. M. F. NEUTS2. Structured Stochastic Matrices of M/G/l Type and their Applications, Marcel Dekker, 1989. Zbl0695.60088MR1010040
  14. [Pel] J. PELLAUMAIL, Graphes et probabilités stationnaires, Ann. Inst. H. Poincaré, 1990, 26, 1. Zbl0701.60064MR1075442
  15. [Pell] J. PELLAUMAIL, Décomposition de L-matrices et probabilités stationnaires, C. R. Acad. Sci. Paris, 1991, 312, série I, p. 459-462. Zbl0718.60075MR1096632
  16. [Rev] D. REVUZ, Markov Chains, North-Holland, 1975. Zbl0539.60073MR758799
  17. [Sen] E. SENETA, Non-Negative Matrices and Markov Chains, Springer-Verlag, 1981. Zbl0471.60001MR2209438
  18. [Wu] J. Y. WU, Contribution à l'étude d'une chaîne de télécommunication privée haut débit à intégration de service, Projet de thèse, 1991. 

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.