Arrival probability in the stochastic networks with an established discrete time Markov chain

The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is assumed to have some wait states, if there is a physical connection but not any immediate communication between two nodes. The Numerical results show, the critical nodes and arcs are detected by the proposed method and it can be used to anticipate probable congestion in communication and transportation networks.

کلیدواژه ها:

Stochastic networks ، unstable networks ، stochastic shortest path ، discrete time Markov chain