Dynamic Routing Algorithm Research And Apply

With the extending of computer network and Internet,router is the most important device in network. Router is work at third layer in OSI model.Routing include two basel action: look for route and transmit.Look for route is in order to find out the shortest path.Routing Algorithm can realize this function.It is complex than transmission because it comes down to different routing protocol and routing algorithm.Every routing protocol must startup and protect routing table in order to find out the shortest path.Routing table cantain routing information, it's content depends on routing algorithm which we use.Routing algorithm collect routing information and infill in routing table.Router transpire the relationship between next-hop and destination network by routing table.With communication, every router fresh and protect routing table, that can reflect the change of network and find out the new shortest path.This is routing protocol, such as RIP (Routing Information Protocol), OSPF (Open Shortest Path First), BGP ( Border Gateway protocol) .Transmission is sending data by the shortest path.First, router lookup in routing table know how to transmit packet to next-hop or host.If it can't know how to transmit this packet, it drop this packet. This is routed protocol.Routing algorithm is a member of network layer software.It confirm the packet out line which it received.Routing algorithm can disport two kinds: nonadaptive algorithm and adaptive routing.Nonadaptive algorithm is named static routing, its routing table is not change with the change of network, unless network administrator modify routing table.For, static routing can not reflect the change of network, it be use in small and structure steady network.Static routing is simpleness, highness andtrustiness.Opposition, adaptive routing change routing table based on the change of network structure and traffic.Adaptive routing be use in big size and complex network.In this paper, we classfy adaptive routing, expatiate distance vector routing algorithm and link state routing algorithm work principle. Every routing algorithm has advantage and disadvantage, we resolve these shortcoming by some optimize way. Local optimization principle lead to routing surge. We design multi-route weight routing algorithm which use hypo-routing partake traffic to resovle this problem.Broadcast and multi-cast are hotspot at the present time.We simply introduce routing algorithm in Broadcast and multi-cast.Finally, we analyze RIP and OSPF to show how they realize D-V and L-S.