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

Author

Vasilakos, Athanasios V. ; Paximadis, Constantinos T.

Author_Institution

Hellenic Air-Force Acad., Athens, Greece

Volume

43

Issue

4

fYear

1994

fDate

12/1/1994 12:00:00 AM

Firstpage

582

Lastpage

593

Abstract

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

Keywords

automata theory; learning automata; packet switching; protocols; telecommunication network routing; S-Model Ergodic Discretized Estimator Learning Automaton; estimator discretized learning automata; fault-tolerant properties; fault-tolerant routing algorithms; high-speed packet-switched networks; link-by-link routing algorithms; network feedback; Algorithm design and analysis; Computer networks; Convergence; Delay estimation; Fault tolerance; Feedback; High-speed networks; Learning automata; Routing protocols; Virtual colonoscopy;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.370222

Filename

370222