Title :
An Algorithm to Search Minimal Subtree Graphs
Author :
Wang, Jing ; Li, Ying ; Wang, Xinmei
Author_Institution :
Xidian Univ., Xi´´an
Abstract :
In this paper, we first propose an algorithm to obtain multicast routing graph. The multicast routing algorithm with network coding will consume lesser resource, and is much closer to minimum-cost multicast. A scheme to search minimal subtree graph is presented based on the chosen routing graph. Moreover, upon the minimal subtree graph obtained, we can effectively construct network coding. Then all the network coding problems can be reduced to search the minimal subtree graphs.
Keywords :
multicast communication; telecommunication network routing; trees (mathematics); minimum-cost multicast; multicast routing graph; network coding; search minimal subtree graphs; Communication networks; Multicast algorithms; Network coding; Parallel processing; Resource management; Routing; information flow; minimal subtree graph; multicast routing graph; network coding;
Conference_Titel :
Parallel Processing Workshops, 2007. ICPPW 2007. International Conference on
Conference_Location :
Xian
Print_ISBN :
0-7695-2934-8
Electronic_ISBN :
1530-2016
DOI :
10.1109/ICPPW.2007.20
