Multicast Routing Algorithm Based On Multicast Trees

With the development of Internet, a lot of new operations have emerged, such as video-on-demand, videoconferencing, long-distance learning, computer coordinated work, and so on. The traditional communication mode, point-to-point, not only wastes a great deal of network bandwidth, but is of very low efficiency. A new technique, which takes efficient advantage of existing bandwidth, is called multicast. multicast is a point-to-multipoint (as well as multipoint-to-multipoint) communication mode, i.e. many receptors receiving simultaneously the same information from one resource. The new type of network application, typically real-time multimedia (e.g. net conferencing, living broadcast on line, classroom on line, etc.), requires high-quality network services, thus demands urgently the widely-used multicast communication technique, resulting in various multicast route protocols and algorithms in different application areas.Most route algorithms take use of multi-tree optimizing project, which is based on a single targeting for service quality, and achieve the one-tree route. This article puts forward the way in which the selection-process model is converted into a multi-targeting optimization problem, which seeks solution by the multi-targeting heredity algorithm. Dependent on optimizing multi-targeting, the heredity algorithm is a new method solving the problem of optimizing multi-targeting. This algorithm, taking advantage of Pareto superior relation, disposes of a number of conflicting indices to be optimized.On the basis of analyzing the multi-tree route problem, this article presents another route algorithm depending on different-tree strategy in order to optimize many types of service quality indices simultaneously. And this algorithm adopts the multi-tree route as a strategy for multicast communication, so that a relatively synthetic cost can be...