Referenced Items are not available for this document.
The behavior of the automata at the nodes of a data network is studied for an abstract network representation in which only very general functional properties are assumed. A model of a nonstationary environment is proposed with state variables as penalty parameters. The limiting behavior of the model is studied. Simulation results shown that under abnormal conditions (i.e. change of topology) the learning algorithms outperformed existing routing algorithms. Using a minimal amount of feedback, the equalizing properties of automata in equilibrium can still be used to produce optimal or nearly optimal routing
Published in:
Electrotechnics, 1988. Conference Proceedings on Area Communication, EUROCON 88., 8th European Conference on
Date of Conference: 13-17 Jun 1988
- Page(s):
- 218 - 221
- Meeting Date :
- 13 Jun 1988-17 Jun 1988
- INSPEC Accession Number:
- 3327669
- Conference Location :
- Stockholm
- Digital Object Identifier :
- 10.1109/EURCON.1988.11143
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
