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.