Simulation study of switched circuit communication networks using learning automata routing

M.S. Chrystall and P. Mars

Mathematics and Computers in Simulation (MATCOM), 1982, vol. 24, issue 4, 281-287

Abstract: Traffic Routing in switched circuit communication networks is considered using both alternate or fixed rule and learning automaton routing strategies. The simulation studies using a microprocessor based real-time simulator are shown to provide confirmation that the automaton routing scheme performs at least as well as the optimal fixed rule. In addition, studies under failure mode conditions, including link, node and focussed overloads, conclusively demonstrate the superior performance of learning automata routing.

Date: 1982
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475482900714
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:24:y:1982:i:4:p:281-287

DOI: 10.1016/0378-4754(82)90071-4

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().