TY - JOUR
T1 - QoS-aware and group density-aware multicast routing protocol
AU - Lee, Hak Hu
AU - Baek, Seong Chung
AU - Chae, Dong Hyun
AU - Han, Kyu Ho
AU - An, Sun Shin
PY - 2005
Y1 - 2005
N2 - Traditionally, there is an assumption that the QoS-aware multicast routing protocol acquires QoS information via the QoS-aware unicast routing protocol. Mostly, the research focuses on about managing group dynamics and failure recovery on multicast and there is no interest in the QoS-aware unicast routing protocol for multicast. In fact, researches of the QoS-aware multicast based on QoS-aware unicast are uncommon. Hence, we focus on the QoS-aware unicast routing algorithm and apply it to multicast. In this paper, we use a novel algorithm, called QoS Restricted and Distributed Generic Shortest Path Algorithm (QRDGSPA). As it is a very simple and measured method without complex computation Hence, it can make a shortest path or QoS-aware multiple paths. For this purpose, we use a specific routing algorithm, Multicast Candidate Selection Method (MCSM), which can choose the optimal candidate path from a receive node to a candidate node. Based on integration of QRDGSPA and MCSM, we propose QoS-aware and group Density-aware Multicast Routing Protocol (QDMRP).
AB - Traditionally, there is an assumption that the QoS-aware multicast routing protocol acquires QoS information via the QoS-aware unicast routing protocol. Mostly, the research focuses on about managing group dynamics and failure recovery on multicast and there is no interest in the QoS-aware unicast routing protocol for multicast. In fact, researches of the QoS-aware multicast based on QoS-aware unicast are uncommon. Hence, we focus on the QoS-aware unicast routing algorithm and apply it to multicast. In this paper, we use a novel algorithm, called QoS Restricted and Distributed Generic Shortest Path Algorithm (QRDGSPA). As it is a very simple and measured method without complex computation Hence, it can make a shortest path or QoS-aware multiple paths. For this purpose, we use a specific routing algorithm, Multicast Candidate Selection Method (MCSM), which can choose the optimal candidate path from a receive node to a candidate node. Based on integration of QRDGSPA and MCSM, we propose QoS-aware and group Density-aware Multicast Routing Protocol (QDMRP).
UR - http://www.scopus.com/inward/record.url?scp=24144496059&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=24144496059&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30582-8_26
DO - 10.1007/978-3-540-30582-8_26
M3 - Conference article
AN - SCOPUS:24144496059
VL - 3391
SP - 244
EP - 253
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SN - 0302-9743
T2 - International Conference on Information Networking, ICOIN 2005
Y2 - 31 January 2005 through 2 February 2005
ER -