Research On Routing Algorithm Based On IPv6

With the development of Internet,It calls more demands on the quality,speed and security. Because the the Internet protocol version 4 can't apply more IP addresses,and can't support mobility,quality of service and security,and so on.So Internet Protocol version 6 will be the most important stage of development. And the routing algorithms are the most important characteristics for the future network.There are two kinds of routing algorithms in the network of Internet Protocol version 6.One is static routing, the other one is dynamic routing. Because of the simple implementation, the static routing is allocated in the small network. But by considering the large-scale network or the variable topology of network, the dynamic routing will replace the static routing. In this dissertation, we establish IPv6 experimental bed based on the VMware Workstation, on which the simulation of static routing and the simulation of dynamic routing are completed. First, we design several functions of static routing, such as priority,load banlancing and summary route.Second, the Open Shortest Path First protocol version 3,which is one kind of Interior Gateway Protocol, is researched and designed. The thought of design and the functions of OSPFv3 are introduced in the fourth chapter. At last, gives an improved ant colony algorithm with two kinds of pheromone, it can overcome the deficiencies of the primal ant colony algorithm. To solve routing problem, it can find the desired routing path fleetly and accurately by simulation in MATLAB.