Routing Simulation - Papers Algorithm Design Part (3)

The flow chart of the evolution routing algorithm frame is shown below:

Figure 8 Framework flow chart of the evolution routing algorithm, the evolution routing algorithm is defined as follows: Algorithm EvoroutCompute.// Evolution Routing calculation begin Evotime = 0; // Evolution Algebra GENESET = NIL; // Mature Gene Collection BestGeneset = nil; // Better gene set, hAlfgeneset = nil; // gene buffer set while (evotime 0) {gene = geneSet GENESET.RemoveFirst (); gene-evolution; Halfgeneset.Addrear (gene);

While (Halfgeneset.Genenumber> 0) {gene = Halfgeneset.getfirst (); geneSet.addrear (gene); Halfgeneset.removefirst ();}; ***************************** ***************************** /}; bestgeneset.Sort (); Best = BESTGENESET.GETBEST (); return Best; End; . From the return Best, you can get a good routing path, which in turn can get the routing table of the router. Evolution Routing Algorithm The EvoroutCompute Algorithm (Second Draft) During the design of the reference information [3], it has been implemented through C programming, and we will subsequently see the efficiency and possible further improvement of the algorithm through experimental data. Place.