Fault-tolerant routing algorithms using estimator discretized learning automata for high-speed packet-switched networks

We present an adaptive routing algorithm (VP-LA) for high speed packet-switched networks. We use the source routing strategy. VP-LA uses anew S-Model Ergodic Discretized Estimator Learning Automaton (SEDEL), specially designed for the routing problem, to select accurately and rapidly the minimum delay routes in high-speed packet-switched networks. The estimator provides VP-LA with excellent fault-tolerant properties. Moreover, the VP-LA is E-optimal. VP-LA was extensively simulated; the results showed the superiority of VP-LA over other source and link-by-link routing algorithms. VP-LA performs quite well even where the network feedback is misleading, and can be easily and efficiently applied because of its reduced complexity and overhead.<
>