R. Beghdad
Multicast routing, minimum cost protocol, maximum flows protocol,Quality of Service (QoS), IP protocol, simulation tool
The author introduces a minimum cost maximum flows (MCMF) routing algorithm that allows the construction of a multicast tree that incorporates both static and dynamic nodes. The key idea of the algorithm is, first, finding the least delay path of the partial static tree (PST) from a source node to a set of static receivers, by using the ratio of “delay/number of flows as cost function; and second, adding the dynamic nodes to the constructed PST, one by one, according to their arrival order, by minimizing the ratio “delay/number of flows. According to the presented simulation, this algorithm is superior to shortest path tree (SPT) technique and minimum delay maximum degree algorithm (MDMDA). This result is obtained according to certain simulation parameters and to the tool used to construct the graphs, regarding the total tree cost and the total tree flows criteria, when there is no delay constraint.
Important Links:
Go Back
