On QoS multicast routing algorithms using k-minimum Steiner trees

Authors:
Moonseong Kim;Hyunseung Choo;Matt W. Mutka;Hyung-Jin Lim;Kwangjin Park
Affiliations:
-;-;-;-;-
Venue:
Information Sciences: an International Journal
Year:
2013

Citing 7
Cited 1

Multicast tree generation in networks with asymmetric links

IEEE/ACM Transactions on Networking (TON)
A QoS multicast routing protocol for dynamic group topology

Information Sciences: an International Journal
A degree-constrained QoS-aware routing algorithm for application layer multicast

Information Sciences: an International Journal
Multicast routing in mobile ad hoc networks by using a multiagent system

Information Sciences: an International Journal
Advanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

Colbar: A collaborative location-based regularization framework for QoS prediction

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper, we study how to obtain Steiner trees appropriately for efficient multicast routing. We first introduce a scheme for generating a new weighted multicast parameter by efficiently combining two independent measures: cost and delay. We call our proposal the Weighted Parameter for Multicast Trees (WPMT) algorithm. The WPMT can be adjusted by the weight @w@?[0,1]. For instance, if @w approaches 0, then the delay of the multicast tree may be relatively lower than the delay of other trees that are obtained as @w approaches 1. Otherwise, as the weight approaches 1 then the cost of the obtained tree may be relatively lower compared with other trees. A case study shows how to find an appropriate Steiner tree for each @w. The simulation results show that the use of the proposed WPMT produces results similar to the k-minimum Steiner tree algorithm. The WPMT can be applied to several existing multicast problems as we describe. We also propose several multicast algorithms using the WPMT in order to solve well-known multicast problems, and compare the proposed algorithms-based the WPMT with representative algorithms for the well-known problems.