Adaptive multicast routing in single rate loss networks

Propose a new approach, based on the maximum free circuit routing (MFCR) concept, toward multicast routing in single rate loss networks. Two versions of the multicast routing problems are studied: static and dynamic. In the static version of the multicast routing problem, the identities of all destination nodes are available to the multicast routing algorithm at once. Conversely, in the dynamic version of the multicast problem, the identities of the destination nodes are revealed to the routing algorithm one by one. The authors studied three MFCR-based multicast routing algorithms: one for the static multicast problem and two for the dynamic multicast problem. They also propose a new performance metric, referred to as fractional reward loss, for evaluating these three multicast routing algorithms. The performance of there three multicast routing algorithms are evaluated through simulations