QoS-Aware and group density-aware multicast routing protocol

  • Authors:
  • Hak-Hu Lee;Seong-Chung Baek;Dong-Hyun Chae;Kyu-Ho Han;Sun-Shin An

  • Affiliations:
  • Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea

  • Venue:
  • ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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).