Research on the routing algorithm based greedy multicast algorithm

Author

Qingmei, Lu ; Lilin, He

Author_Institution

Dept. of Electron. Sci. & Technol., North Univ. of China, Taiyuan, China

Volume

12

fYear

2010

fDate

22-24 Oct. 2010

Abstract

Because all the nodes are multi-cast, the minimum spanning tree is the best, therefore, it is expected by the niche tree dynamic greed multicast routing algorithms produce more of the performance with a reasonable level. As for the greedy algorithm and the text of the characters tree dynamic greedy algorithm are made detailed emulation, Simulations result indicates that the results of the algorithm in multicast node are with greater density of the advantages and it shows that the invalid in other cases were acceptable, and has complicated the low quality.

Keywords

greedy algorithms; multicast communication; telecommunication network routing; trees (mathematics); greedy multicast algorithm; minimum spanning tree; multicast node; niche tree dynamic greed multicast routing algorithms; Clustering algorithms; Delay; Greedy algorithms; Heuristic algorithms; Quality of service; Routing; Wireless sensor networks; Computer networks; Multicast routing algorithm; dynamic multi astrouting algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Application and System Modeling (ICCASM), 2010 International Conference on

Conference_Location

Taiyuan

Print_ISBN

978-1-4244-7235-2

Electronic_ISBN

978-1-4244-7237-6

Type

conf

DOI

10.1109/ICCASM.2010.5622345

Filename

5622345