An Optimized Method Of Genetic Algorithms And It's Application In Network

We are living in an information society in which Infobahn transmits our information as a carrier, and network acts as a core role. There are many problems need to be resolved in communication. One of them is how to choose a better route. Routing Information Protocol (RIP) make every node know information of its neighbors. There is a defect in RIP, That is to say when networks have troubles, it will take long time for other nodes to know it. An improved method of Routing Information Protocol was proposed in this thesis, by this method some nodes of network exchange routing information through several other nodes, and then every node can know the information of network quickly. It needs to find out the best value for some arithmetic. In this thesis, I got the whole best value by Genetic Algorithms (GA) because of its ability of finding the whole best value. Sometimes when an experiment was carried out we find Genetic Algorithms get the part better value any better. In this thesis the question has been analyzed and the reason has been researched, then a new way of finding the whole best value was posed out in this thesis. Experiment can prove its efficiency. In this thesis, GA was used in optimized RIP , and expresses of individual and function were designed, some experiment were done afterwards.