Multicast routing algorithm based on extended simulated annealing algorithm

Authors:
Jin-Ku Jeong;Sung-Ok Kim;Chi-Hwa Song
Affiliations:
Dept. of Computer Eng., Hannam University, Daedeok-gu, Daejeon, Korea;Dept. of Computer Eng., Hannam University, Daedeok-gu, Daejeon, Korea;Dept. of Computer Science, Chungnam National University, Yuseong-gu, Daejeon, Korea
Venue:
MMACTE'05 Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering
Year:
2005

Citing 3
Cited 1

Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
Neural network based optimal routing algorithm for communication networks

Neural Networks
A neural network approach to multicast routing in real-time communication networks

ICNP '95 Proceedings of the 1995 International Conference on Network Protocols

The novel application of artificial neural networks for a reliable secure wireless multicast routing in mobile ad-hock networks

ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a method that is able to find a good multicast routing tree in a wide area network. The problem domain that we should solve is modeled as a weighted, undirected graph. The graph that represents a wide area network has three node type, a server that sends the same data to the recipients, some nodes that do not request data to the server and the rest that don't need data. Our method uses the extended simulated annealing algorithm [ESA].