ROUTING FOR LOW CALL BLOCKING IN HIGH-SPEED GENERAL TOPOLOGY NETWORKS

This paper compares some typical algorithms that unify the routing and admission control decisions and have the goal of achieving low call b locking rate for general topology networks. A new algorithm based on t he shortest path and the competitive routing idea is also proposed in the paper. Extensive simulation experiments have shown that the algori thm simply based on the routing idea in circuit-switched networks has satisfactory performance only at medium to high network loads. The sho rtest path algorithm with the greedy admission control decision perfor ms well only at low network loads. The EXP algorithm based on the comp etitive and stochastic analysis can generally lead to low network bloc king, but it has the undesirable restrictions of uniform link capaciti es and uniform call bandwidth requirements. Our proposed algorithm has a desirable low call blocking rate for a wide range of network load. (C) 1998 Elsevier Science B.V.