Skip to Main content Skip to Navigation
Reports

Classification of Markov chains describing the evolution of random strings

Abstract : We consider LIFO queue with several customer types, batch arrival and batch services. We get necessary and sufficient conditions for this queue to be ergodic, null recurrent and transient. These are given in terms of positive solutions of finite system of equations pi = Fi(p1, ..., pk), i = 1, ..., k, where Fi are polynomials with positive coefficients.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074649
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:59:40 PM
Last modification on : Friday, February 4, 2022 - 3:08:32 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:01:26 PM

Identifiers

  • HAL Id : inria-00074649, version 1

Collections

Citation

A. Gajrat, Vadim A. Malyshev, M.V. Menshikov. Classification of Markov chains describing the evolution of random strings. [Research Report] RR-2022, INRIA. 1993. ⟨inria-00074649⟩

Share

Metrics

Record views

45

Files downloads

42