Rendezvous point based approach to the multi-constrained multicast routing problem
The Quality of Service (QoS) routing requires a special approach to graph algorithms modeling. One of the mathematical concepts that reflects this class of problems is the multi-constrained minimum Steiner tree problem (MCMST). In this article, the RDP (named after the concept of the RenDezvouz Point), a novel algorithm for solving the MCMST problem is presented.
quality of service multi-constrained routing