Performance analysis of flood search algorithm with MFDL path in circuit-switched networks

The authors propose a modified flooding algorithm with minimum first-derivative length (MFDL) path for a tactical circuit-switched grid network with a maximum of four links and two priority classes of voice traffic. They consider the minimization of average end-to-end blocking probability, and study the blocking performance of the modified flooding algorithm and the flood search algorithm. They also suggest a decision rule for the search message propagation scheme and analyze the signaling traffic load of the algorithm. It is found that with the same or lower cost of switch processor loading and call set-up time as compared to the flood search algorithm, the modified flooding algorithm provides the shortest path on the basis of blocking probability. Therefore, its use can improve the blocking performance of a circuit-switched network