QoS-aware and group density-aware multicast routing protocol

Hak H. Lee, Seong Chung Baek, Dong Hyun Chae, Kyu H. Han, Sun-Shin An

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsC. Kim
Pages244-253
Number of pages10
Volume3391
Publication statusPublished - 2005
EventInternational Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of
Duration: 2005 Jan 312005 Feb 2

Other

OtherInternational Conference on Information Networking, ICOIN 2005
CountryKorea, Republic of
CityJeju Island
Period05/1/3105/2/2

Fingerprint

Routing protocols
Quality of service
Routing algorithms
Recovery

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Lee, H. H., Baek, S. C., Chae, D. H., Han, K. H., & An, S-S. (2005). QoS-aware and group density-aware multicast routing protocol. In C. Kim (Ed.), Lecture Notes in Computer Science (Vol. 3391, pp. 244-253)

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 proceedingConference contribution

Lee, HH, Baek, SC, Chae, DH, Han, KH & An, S-S 2005, QoS-aware and group density-aware multicast routing protocol. in C Kim (ed.), Lecture Notes in Computer Science. vol. 3391, pp. 244-253, International Conference on Information Networking, ICOIN 2005, Jeju Island, Korea, Republic of, 05/1/31.
Lee HH, Baek SC, Chae DH, Han KH, An S-S. QoS-aware and group density-aware multicast routing protocol. In Kim C, editor, Lecture Notes in Computer Science. Vol. 3391. 2005. p. 244-253
Lee, Hak H. ; Baek, Seong Chung ; Chae, Dong Hyun ; Han, Kyu H. ; An, Sun-Shin. / QoS-aware and group density-aware multicast routing protocol. Lecture Notes in Computer Science. editor / C. Kim. Vol. 3391 2005. pp. 244-253
@inproceedings{31afbda114f246cc9226d3e7ed8aea5c,
title = "QoS-aware and group density-aware multicast routing protocol",
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).",
author = "Lee, {Hak H.} and Baek, {Seong Chung} and Chae, {Dong Hyun} and Han, {Kyu H.} and Sun-Shin An",
year = "2005",
language = "English",
volume = "3391",
pages = "244--253",
editor = "C. Kim",
booktitle = "Lecture Notes in Computer Science",

}

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 -