Name
Abstract | ||
|---|---|---|
With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3837/tiis.2012.09.015 | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS |
Keywords | Field | DocType |
Multicast,service-oriented application,distributed,neighbor gradient | Protocol Independent Multicast,Source-specific multicast,Inter-domain,Multicast address,Computer science,Xcast,Computer network,Pragmatic General Multicast,Multicast,Distance Vector Multicast Routing Protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
6 | 9 | 1976-7277 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Wang | 1 | 291 | 85.17 |
| Jianbiao Mao | 2 | 3 | 1.78 |
| Tao Li | 3 | 38 | 7.33 |
| Zhi-gang Sun | 4 | 41 | 14.15 |
| Gong Zheng-Hu | 5 | 73 | 16.39 |
| Gaofeng Lv | 6 | 5 | 4.81 |