Title :
Multiple path routing in networks with inaccurate link state information
Author :
Jia, Yanxia ; Nikolaidis, Ioanis ; Gburzynski, Pawel
Author_Institution :
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
Abstract :
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
Keywords :
network topology; telecommunication network routing; telecommunication traffic; K-shortest path routing schemes; blocking probability; incurred bandwidth; link state exchange; link state information; link utilisation; multiple path routing; network topologies; traffic conditions; Bandwidth; Computer networks; Delay; Frequency; Intelligent networks; Intserv networks; Network topology; Processor scheduling; Routing protocols; Telecommunication traffic;
Conference_Titel :
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location :
Helsinki
Print_ISBN :
0-7803-7097-1
DOI :
10.1109/ICC.2001.936616
