The Calculus of Self-Modifiable Algorithm Based Evolutionary Computer Network Routing

The Calculus of Self-Modifiable Algorithms (CSA) is a universal approach to parallel and intelligent system. Its aim is to integrate different styles of programming and is applied to different areas of future generation computers. Potential applications of CSA include expert systems, machine learning, adaptive systems and many others. The problem of route optimization in computer networks is identified as a task that requires some sort of cost-driven solution that allows for the computation of paths in a network based on experience and inference. The Calculus of Self-Modifiable Algorithm is used to do the specification of this problem by modeling a system of machine learning algorithms that learn proper routing techniques for a particular computer network by incorporating an apportionment of credit system and various rule discovery concepts similar to the learning techniques used in evolutionary computing and symbolic learning.

[1]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.

[2]  C. Cheng,et al.  On the design of resilient protocols for spanning tree problems , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[3]  John H. Holland,et al.  Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems , 1995 .

[4]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[5]  Eugene Eberbach.  CSA: In the Direction of Greater Representational Power for Neurocomputing , 1994, J. Parallel Distributed Comput..

[6]  Eugene Eberbach,et al.  Neural networks and adaptive expert systems in the CSA approach , 1993, Int. J. Intell. Syst..

[7]  Barr and Feigenbaum Edward A. Avron,et al.  The Handbook of Artificial Intelligence , 1981 .

[8]  Eugene Eberbach.  Semal: a Cost Language Based on the Calculus of Self-Modifiable Algorithms , 1994, Int. J. Softw. Eng. Knowl. Eng..

[9]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[10]  Eugene Eberbach,et al.  A CSA-based robot plan generator , 1993, CSC '93.

[11]  Eugene Eberbach,et al.  Selected Aspects of the Calculus of Self-Modifiable Algorithms Theory , 1991, ICCI.

[12]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[13]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[14]  C. Cheng,et al.  A protocol to maintain a minimum spanning tree in a dynamic topology , 1988, SIGCOMM 1988.