An efficient multicast tree with delay and delay variation constraints

Authors:
Moonseong Kim;Young-Cheol Bang;Jong S. Yang;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;Department of Computer Engineering, Korea Polytechnic University, Gyeonggi-Do, Korea;Korea Institute of Industrial Technology Evaluation and Planning, Seoul, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Year:
2006

Citing 10
Cited 1

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
On Multicasting with Minimum Costs for the Internet Topology

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
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
On estimation for reducing multicast delay variation

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
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

On multicasting steiner trees for delay and delay variation constraints

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the rapid evolution of real time multimedia applications like audio/video conferencing, interactive distributed games and real time remote control system, a certain Quality of Service (QoS) needs to be guaranteed in underlying networks. Multicast routing algorithms should support the required QoS. There are two important QoS parameters, bounded delay and delay variation, that need to be guaranteed in order to support the real time multimedia applications. Here we solve Delay and delay Variation Bounded Multicast Tree (DVBMT) problem which has been proved to NP-complete. In this paper, we propose an efficient algorithm for DVBMT. The performance enhancement is up to about 21.7% in terms of delay variation as compared to the well-known algorithm, KBC [9].