NEW ALGORITHMS FOR DELAY-CONSTRAINED MULTICAST ROUTING
Hatem Bettahar, Abdelmadjid Bouabdallah · Networks · 2002
The role of a delay-constrained... In this paper we propose a new approach for delay-constrained routing which tries to find the best compromise between cost minimization and the risk level regarding the delay constraint. We first present PDCR, a Parameterised Delay-Constrained Routing protocol that implements our approach using a simple and ecient parameterised selection function. Then we propose three new delay-constrained multicast routing protocols based on source (Naive), destination (Greedy) and mixed multicast routing techniques. These protocols use PDCR as the underline unicast routing algorithm. Simulation results show that our protocols produce paths and trees which are stable, less risky and suitable for different network conditions