Multiple Source Multicast Routing Algorithm Design

With continuous and quick development of the Internet, people's need of the network has grown from simple data transmission to multi- media business. The multicast, however, as a kind of resources saving technology, has got an extensive application in multi-media business. A lot of solid hour's application in multi-media puts forward the request of QOS, such as interactive solid application (meeting on internet). The members on the multicast are not only a dispatcher but probably a receiver, so the problem of multicast-routing rises. It becomes a hot point how to deal with the multicast on internet. At the same time, The rationality and effectiveness of the resources on multicast routing play an important role on the network optimization and function. It is a pity that research of this aspect has been very slight. Therefore, it is necessary to further studies in these domains.It is benefit to optimize the internet, to improve the quality of service and to widen the use of network business, and to spur the internet development in the future.Aimed at the growing multicast applications, this paper proceeds with such a creative work:Put forward a model on a small scale "unicast plus multicast" to deal with the overweight problem on Router.Point out the problem between data-stream and the route cost. It is obvious that the data-stream increment results in that of cost, but the increment is disproportionate. For example, the data-stream in the network doubles, the cost of the network will increase by less than a time.Design a polynomial algorithm to resolve the problem based on current and mature algorithm, only in this way, can the router not be overloaded.According to the CBT core tree thought, make use of the layering strategy. We set up the minimum Steiner tree by CBT in domain. When many sources send out the data at the same time, we just consider the circumstance that arrive the core router only. And use CBT algorithm to guarantee the arrival at each customer.Viewed from the simulation result, it is obvious that the total cost of Steiner tree is decreased because of the path shares. And it is certain that the algorithm complexity...