Name
Abstract | ||
|---|---|---|
With the growth of interest in multicast communication networks, the importance of routing techniques for multicast connections is being emphasized. In this paper, we propose a new multicast algorithm for a k-ary n-cube network, the randomized local balance multicast (RLBM) that outperforms unicast-based multicast routing scheme. Simulation results show that if choosing the proper threshold, the RLBM performs very well under different conditions with lower average delay and higher saturation throughput. |
Year | Venue | Keywords |
|---|---|---|
2009 | ICOIN | randomized local balance multicast,rlbm,randomized multicast routing,lower average delay,multicast routing scheme,different condition,new multicast algorithm,proper threshold,k-ary n-cube network,randomized local balance multicast routing,multicast communication network,higher saturation throughput,telecommunication network routing,multicast connection,multicast communication |
Field | DocType | ISBN |
Protocol Independent Multicast,Source-specific multicast,Multicast address,Computer science,Xcast,Computer network,Pragmatic General Multicast,Multicast,Distance Vector Multicast Routing Protocol,IP multicast,Distributed computing | Conference | 978-89-960761-3-1 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ting Zhou | 1 | 0 | 1.01 |
| Youjian Zhao | 2 | 273 | 32.53 |
| Zhenhua Liu | 3 | 498 | 45.19 |
| Xiaoping Zhang | 4 | 27 | 6.83 |