Source-Based minimum cost multicasting: intermediate-node selection with potentially low cost

Authors:
Gunu Jho;Moonseong Kim;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Year:
2005

Citing 9
Cited 1

On finding Steiner vertices

Networks
Steiner problem in networks: a survey

Networks
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicast path setup in data networks

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 generating random network structures: trees

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm

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

IEEE Network: The Magazine of Global Internetworking

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

In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an improvement in terms of network cost for general random topologies close to real networks. It is compared to the most effective scheme proposed earlier by Takahashi and Matsuyama (TM) [18]. We have experimented comprehensive computer simulations and the performance enhancement is up to about 4.7% over TM. The time complexity of ours is O(kn2) for an n-node network with k members in the multicast group which is comparable to those of previous works [12,18].