Application of stochastic automaton theory for routing in a packet-switched network
Babak Daneshrad, S.D. Morgera · 2003
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.>