Abstract
Routing algorithms for general topology broadband networks should make
sensible tradeoffs between optimality and complexity. An algorithm
based on the shortest path algorithm and competitive analysis recently
proposed by us was found to perform very well for general traffic
patterns at any network loads when the Quality of Service (QoS)
constraints are not considered.. In this paper, we show that the
proposed algorithm also has very good performance while satisfying
stringent delay bound requirements. The proposed algorithm and several
other existing relatively efficient routing algorithms for general topology
networks are fairly evaluated and compared through
simulations by using call rejection probability, network
throughput and fairness measures for the first time.
To my homepage