In this paper we present SEATER - an environment in which any general telephone traffic routing problem can be set up and simulated using a variety of routing methods. The routing methods available are the fixed rule, random routing, and routing utilizing a complete assortment of different learning automata. The general telephone traffic routing problem is described, and various existing fixed rule routing schemes supported by the system are explained. Additionally, most learning automata routing techniques are briefly described, and are supported by the system implemented. These schemes have been implemented and compared to the existing fixed rule algorithms in terms of minimizing the blocking probability of the network. The simulations show that learning automata solutions are far superior to any fixed rule solutions. The advantage of the former lies in their adaptability to changes in telephone traffic. The system is written in SMALLTALK V and runs on a MAC II.

Additional Metadata
Persistent URL dx.doi.org/10.1109/ICSMC.1992.271804
Conference IEEE International Conference on Systems, Man, and Cybernetics, SMC 1992
Citation
Zgierski, J.R. (Jack R.), & Oommen, J. (1992). SEATER: A simulation environment using learning automata for telephone traffic routing. In Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics (pp. 43–48). doi:10.1109/ICSMC.1992.271804