A new distributed routing algorithm for supporting delay-sensitive applications

We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the least delay path algorithm.