Abstract
This paper presents the use of connectionnist techniques for optimum routing in packet-switched telecommunication networks. The aim is to minimize connection costs and optimize resource utilization. The core of the presented routing algorithm is based on a cellular automaton. Simulations have been run based on realistic X.25 network topologies and show that this connectionnist routing algorithm performs better than classical ones. Thanks to these simulations, this algorithm has been selected for the realization of the adaptive routing task in Philips X.25 switches.
Work supported by TRT / Philips Communication Systems
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Aicardi, F. Davoli, R. Minciardi, and R. Zoppoli. Decentralized routing, tearns and neural networks in communications. In Proc. of GLOBECOM'91, Phoenix, pages 2386–2390, December 1991.
N. Ansari and D. Lin. The performance evaluation of a new neural network based traffic management scheme for a satellite communication network. In Proc. of GLOBECOM'91, Phoenix, pages 0110–0114, December 1991.
E.W. Dijkstra. A note on two problems in connection with graphs. Numeric Math., 1:269–271, 1959.
L.R. Ford and D.R. Fulkerson. Flows in network, pages 130–134. Princeton university, Princeton, Cambridge, 1962.
F. Glover, R. Glover, and D. Klingman. Computational study of an improved shortest path. Networks, 14:25–36, 1984.
J. J. Hopfield and D. Tank. ”Neural” computation of decisions in optimization problems. Biological Cybernetics, 5:141–152, 1985.
I. Iida, A. Chugo, and R. Yatsuboshi. Autonomous routing scheme for large scale network based on neural processing. In 1989 IEEE International Conference on Systems, Man and Cybernetics, pages 194–199, November 1989.
ISO/IEC DIS 10589:1990 Information technology — Telecommunication and information exchange between systems. Intermediate system to intermediate system intra-domain routeing exchange protocol for use in conjunction with the protocol for providing the connectionless-mode network service. (ISO 8473), October 1990. (Draft International Standard).
F. Kamoun and M.K. Mehmet Ali. A neural network shortest path algorithm for optimum routing in packet switched communication networks. In Proc. of GLOBECOM'91, Phoenix, pages 0120–0124, December 1991.
J. Minot. Recherche du plus court chemin par automate cellulaire. technical report, Laboratoires d'Electronique Philips, April 1992.
E.F. Moore. The shortest path through a maze. In International Symposium on the Theory of Switching, Cambridge, volume II, pages 285–292, 1957.
U. Pape. Algorithm 562: Shortest path length. ACM Trans. Math. Software, 6:450–455, 1980.
G. Scheys. Description et comparaison des algorithmes de calcul de l'arbre des plus courtes routes. Technical note, Philips Research Lab. Brussels, May 1991.
A. Tanenbaum. Computer networks. Prentice Hall, Englewood Cliffs, NJ, 1989.
G.Y. Vichniac. Cellular automata models of disorder and organization. In G. Weisbuch E. Bienenstock, F. Fogelman-Soulié, editor, Disordered systems and biological organization, chapter 1, pages 3–20. Springer-Verlag Berlin, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Minot, J. (1993). Adaptive routing using cellular automata. In: Mira, J., Cabestany, J., Prieto, A. (eds) New Trends in Neural Computation. IWANN 1993. Lecture Notes in Computer Science, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56798-4_208
Download citation
DOI: https://doi.org/10.1007/3-540-56798-4_208
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56798-1
Online ISBN: 978-3-540-47741-9
eBook Packages: Springer Book Archive