Shortest paths analysis in stochastic networks
We present a new analytical algorithm for the exact computation of the probability distribution of the shortest path length in stochastic networks with independent and continuously distributed arc lengths. We show that such stochastic networks can be modeled as continuous-time Markov processes with a single absorbing state using a supplementary variable technique. An analytical algorithm utilizing the backward equations of Markov skeleton processes is presented for calculating the distribution function of the shortest path length.
networks stochastic processes shortest path.
HangshengTan Xuan Zhang
School of Mathematics, Central South University, Changsha 410075, China
国际会议
南京
英文
59-62
2010-07-29(万方平台首次上网日期,不代表论文的发表时间)