Title :
A new distributed routing algorithm for supporting delay-sensitive applications
Author_Institution :
Inst. of Oper. Syst. & Comput. Networks, Tech. Univ. Braunschweig, Germany
Abstract :
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
Keywords :
communication complexity; delays; distributed algorithms; telecommunication network routing; cost performance; delay-constrained path; delay-constrained unicast routing algorithm; delay-sensitive applications; distributed routing algorithm; least delay path algorithm; network node; network state; simulation results; small message complexity; Algorithm design and analysis; Application software; Computational modeling; Computer network management; Computer networks; Costs; Delay; Multicast algorithms; Routing protocols; Unicast;
Conference_Titel :
Communication Technology Proceedings, 1998. ICCT '98. 1998 International Conference on
Conference_Location :
Beijing
Print_ISBN :
7-80090-827-5
DOI :
10.1109/ICCT.1998.741046
