An architecture for wide-area multicast routing
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
QoS Routing Protocol for the Generalized Multicast Routing Problem (GMRP)
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
SoMR: A scalable distributed QoS multicast routing protocol
Journal of Parallel and Distributed Computing
A tree-based particle swarm optimization for multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.