HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Ergodicity of conservative communication networks

Dmitri D. Botvich 1 A.A. Zamyatin 1
1 MEVAL - Methods, algorithms and software in automatic control
Inria Paris-Rocquencourt
Abstract : We analyze a communication network with several types of calls. For a wide class of conservative service disciplines, we give ergodicity criteria. Exponentially fast convergence to steady state is also proved.
Document type :
Reports
Complete list of metadata
https://hal.inria.fr/inria-00077012
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:50:06 AM
Last modification on : Friday, February 4, 2022 - 3:08:44 AM
Long-term archiving on: : Friday, May 13, 2011 - 8:57:00 PM

Files

Vignette du document
RR-1772.pdf

Identifiers

  • HAL Id : inria-00077012, version 1

Collections

INRIA | INRIA-RRRT | LARA | INRIA2

Citation

Dmitri D. Botvich, A.A. Zamyatin. Ergodicity of conservative communication networks. [Research Report] RR-1772, INRIA. 1992. ⟨inria-00077012⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

81

Files downloads

94

 

Contact                    Legal Notice                    Personal Data