Multicast ω-trees based on statistical analysis

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:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Year:
2006

Citing 9
Cited 0

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Multicast tree generation in networks with asymmetric links

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
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
Modeling Internet topology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the efficient multicast routing tree problem with QoS requirements. The new multicast weight parameter is proposed by efficiently combining two independent measures, the link cost and delay. The weight ω ∈[0,1] plays an important role in combining the two measures. If the ω approaches to 0, then the tree delay is decreasing. On the contrary if it closes to 1, the tree cost is decreasing. Therefore, if the ω is decided, then the efficient multicast tree can be found. A case study shows various multicast trees for each ω. When network users have various QoS requirements, the proposed multicast weight parameter is very informative for them.