On multicasting steiner trees for delay and delay variation constraints

Authors:
Moonseong Kim;Young-Cheol Bang;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Department of Computer Engineering, Korea Polytechnic University, Gyeonggi-Do, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 14
Cited 0

Steiner problem in networks: a survey

Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Source-Based minimum cost multicasting: intermediate-node selection with potentially low cost

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
On multicast communications with minimum resources

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
On estimation for reducing multicast delay variation

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
An efficient multicast tree with delay and delay variation constraints

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
On algorithm for efficiently combining two independent measures in routing paths

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Computer Communications
Modeling Internet topology

IEEE Communications Magazine
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of multicasting is to find a tree that has a minimum total cost, which called the Steiner tree. Multicast routing algorithms should support the required QoS. There are two important Quality of Service (QoS) parameters that need to be guaranteed in order to support the real time and multimedia applications. Firstly, we consider the delay parameter where, the data sent from source need to reach destinations within a certain time limit (delay bound). Secondly, in addition to the delay constraint, we add the delay variation constraint. The delay variation constraint is a bound on the delay difference between any two destinations. Our research subject is Delay and delay Variation Bounded Steiner Tree (DVBST) problem. The problem has been proved to NP-complete. In this paper, we propose efficient algorithm for DVBST. Simulations demonstrate that our algorithm is better in terms of tree cost as compared to the existing algorithms.