Title :
New multicast routing algorithm for QoS routing in communication network
Author :
Yao, Ruimin ; Fei, Jun
Author_Institution :
Coll. of Manage., CCNU, Wuhan, China
Abstract :
In the paper, author proposed a new source routing algorithm for the multicast QoS routing problem in communication network with the time complexity only as O (n2). Simulation results show that the proposed algorithm will have better performance because of the minimization of use of min-delay path in constructing the spanning tree.
Keywords :
computational complexity; multicast communication; quality of service; telecommunication computing; telecommunication network routing; QoS routing; min-delay path minimization; multicast routing algorithm; spanning tree; time complexity; Communication networks; Computer networks; Delay; Distributed computing; Electronic mail; Minimization methods; Multicast algorithms; Quality of service; Routing; Unicast; Minimum Steiner Tree; Network Optimization; QoS Multicast Routing;
Conference_Titel :
Future Computer and Communication (ICFCC), 2010 2nd International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5821-9
DOI :
10.1109/ICFCC.2010.5497586
