Performance Analysis of Saturation Routing Algorithm in Non-Hierarchical Networks
Young Chul Park · Journal of Digital Contents Society · 2002
Saturation routing algorithm is known to be an effective routing mechanism for tactical application and packet radio networks, since it minimizes the call set-up time and does not have to maintain routing tables. But, it is known that it has significant drawbacks with respect to the network efficiency, the overhead on the control messages [1]. We consider a tactical circuit-switched grid network with a maximum of tour links and two priority classes of voice traffic. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched network without increasing the call set-up time and processor loading of the algorithm.