Network Routing Algorithm Based On Graph Theory

In the world, the relation of many things can be showed with graph. In this case, people are usually to mean the thing with nodes and mean relation of these things with edges. This kind of graph formed with nodes and edges is the object that is studied by graph theory. Computer network is a system that a large quantity of computers which are scatter and communicate each other. The research case of computer network and graph theory is natural similitude. The research achievement of graph theory has got the application and development in the computer network's research.To support multicast communication, the routing is one of the key problems. Routing means to find a best route from many routes of the source node and the aim node for some special purpose. For example, the minist consumption of network's resources is often an important purpose of routing. To solve to the multicast routing problem, the popular method is to construct a multicast tree. If the reasonable multicast tree can be constructed, we can consume least network resources and achieve our task.This paper stepwisily gives a comprehensive study to multicast tree problem on the base of graph theory. Combining the international newest research result of multicast tree , this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. In many research fields of multicast tree, many high-efficiency solutions were obtained in this paper.This paper has broadly discussed about multicast tree problem and obtained DMDT(Dynamic Minimum Distance Tree), FMPH(Fast Minimum Path Cost Heuristic), DMPH(Dynamic Minimum Path Cost Heuristic) and FGMRA(Fast Group Multicast Routing Arithmetic). These arithmetics all obtain better effects and come to the anticipant purpose.