Multiplicativity of Markov Chains with Multiaddress Routing

  • Authors:
  • M. Yu. Tyurikov

  • Affiliations:
  • -

  • Venue:
  • Problems of Information Transmission
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A broad class of network Markov processes (including open queueing networks) with multiaddress routing and one type of calls is considered. Under such routing, the same call can simultaneously arrive at several nodes. For these processes, we found necessary and sufficient conditions of multiplicativity, that is, conditions of representability of a stationary distribution as a product of factors characterizing separate nodes.