| HAL-Inria | Publications, software ... of Inria's scientists |
Reports
Ergodicity of conservative communication networks
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.
https://hal.inria.fr/inria-00077012
Contributor : Rapport de Recherche Inria <>
Submitted on : Monday, May 29, 2006 - 11:50:06 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Friday, May 13, 2011 - 8:57:00 PM
Contributor : Rapport de Recherche Inria <>
Submitted on : Monday, May 29, 2006 - 11:50:06 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Friday, May 13, 2011 - 8:57:00 PM