A distributed delay-constrained routing algorithm

We proposed a distributed unicast delay constrained routing algorithm(UDCR),which can always find a delay constrained path if such a path exists At each network node,limited information about network state is needed and only a small amount of computation is required We proved its correctness,the worst case message complexity of it is O(｜V ｜ 2),where ｜ V ｜is the number of nodes Comparing with other delay constrained heuristics,UDCR achieves the best average cost performance with moderate message complexity