Capacity reliability algorithm in communication network based on the shortest delay

In communication network, the transmission delay varied with flow fluctuation will change the shortest delay. Previous reliability algorithms in communication network have been used to determine the shortest path, which means links in such network have fixed average delay, so they can not indicate the delay´s transient variation caused by flow fluctuation. This leads to erroneous conclusions about the performance of the network. This paper introduces a capacity reliability algorithm based on the shortest delay. The traffic will be forwarded to a path with shortest delay rather than a determined shortest path, so traffic in the network will be subject to stochastic user equilibrium model. We assume that transmission delay has certain functional relationship with the size of traffic, then we calculate the capacity reliability with Monte Carlo simulation. An example illustrates the method, which is different with algorithms based on the shortest path, the result proves the algorithm has more reasonable evaluation to the stochastic flow network.