Abstract
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).
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science |
| Editors | C. Kim |
| Pages | 244-253 |
| Number of pages | 10 |
| Volume | 3391 |
| Publication status | Published - 2005 |
| Event | International Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of Duration: 2005 Jan 31 → 2005 Feb 2 |
Other
| Other | International Conference on Information Networking, ICOIN 2005 |
|---|---|
| Country | Korea, Republic of |
| City | Jeju Island |
| Period | 05/1/31 → 05/2/2 |
Fingerprint
ASJC Scopus subject areas
- Computer Science (miscellaneous)
Cite this
QoS-aware and group density-aware multicast routing protocol. / Lee, Hak H.; Baek, Seong Chung; Chae, Dong Hyun; Han, Kyu H.; An, Sun-Shin.
Lecture Notes in Computer Science. ed. / C. Kim. Vol. 3391 2005. p. 244-253.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - QoS-aware and group density-aware multicast routing protocol
AU - Lee, Hak H.
AU - Baek, Seong Chung
AU - Chae, Dong Hyun
AU - Han, Kyu H.
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
M3 - Conference contribution
AN - SCOPUS:24144496059
VL - 3391
SP - 244
EP - 253
BT - Lecture Notes in Computer Science
A2 - Kim, C.
ER -