Application of stochastic automaton theory for routing in a packet-switched network

Author

Daneshrad, Babak ; Morgera, Salvatore D.

Author_Institution

Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada

fYear

1989

fDate

15-18 Oct 1989

Firstpage

205

Abstract

The automaton-based routing algorithm suggested by R.M. Glorioso (Engineering Cybernetics, Englewood Cliffs, NJ: Prentice Hall, 1975) is modified to operate in a packet-switched environment. The modified algorithm is simulated, and its performance is compared with that of three existing routing algorithms: shortest path, proportional (bifurcated), and shortest queue next. It was found that the algorithm is well suited for distributed implementation and has performance that is consistently superior to that of both the shortest-path and proportional routing schemes. The algorithm yields a performance that is comparable with that of shortest-queue-next routing, but it uses fewer control packets

Keywords

packet switching; stochastic automata; bifurcated; control packets; distributed; packet-switched network; proportional; routing; shortest path; shortest queue next; stochastic automaton theory; Bifurcation; Circuit simulation; Communication networks; Cost function; Intelligent networks; Learning automata; Routing; Stochastic processes; Switching circuits; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 1989. MILCOM '89. Conference Record. Bridging the Gap. Interoperability, Survivability, Security., 1989 IEEE

Conference_Location

Boston, MA

Type

conf

DOI

10.1109/MILCOM.1989.103926

Filename

103926