Abstract
Maximizing call acceptance probability is one of the most important
routing goals in high speed networks. In this report, we survey some of
the existing important routing algorithms aiming at achieving a low
call blocking rate for general topology networks. A new
routing algorithm based on the shortest path algorithm and the competitive
routing idea is also proposed in the paper. Extensive simulation
experiments were performed to compare the performance of these
algorithms. It is shown that the routing algorithms simply
based on the routing idea in circuit-switched networks have
satisfactory performance only at medium to high network loads. The shortest path
algorithm performs well only at low network loads. The EXP algorithm
based on the competitive and stochastic analysis can generally lead to low network
blocking, but it has the undesirable restrictions of uniform link
capacities and uniform call bandwidth requirements. Our proposed algorithm has
a desirable low call blocking rate at any network loads.
Key words: routing, general topology network, call blocking rate
Back