Multiple path routing in networks with inaccurate link state information
Yuxi Jia, Ioanis Nikolaidis, Paweł Gburzyński · 2002
We study a collection of K-shortest path routing schemes and investigate their performance under a diverse set of network topologies and traffic conditions. We subsequently demonstrate that K-shortest path routing offers a lower blocking probability and more balanced link utilisation than other routing methods. With the proposed approach, it is possible to reduce the frequency of link state exchange, and the incurred bandwidth overhead, without sacrificing the overall performance of the network.