Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

Authors:
Zhang Kun;Wang Heng;Liu Feng-Yu
Affiliations:
Department of Computer Science and Technology, Nanjing University of Science and Technology, 623 Staff room, Nanjing, Jiangsu 210094, People's Republic of China;Department of Computer Science and Technology, Nanjing University of Science and Technology, 623 Staff room, Nanjing, Jiangsu 210094, People's Republic of China;Department of Computer Science and Technology, Nanjing University of Science and Technology, 623 Staff room, Nanjing, Jiangsu 210094, People's Republic of China
Venue:
Computer Communications
Year:
2005

Citing 14
Cited 9

Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

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
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
Dynamic Programming

Dynamic Programming
Multicast routing for real-time communication of high-speed networks

Multicast routing for real-time communication of high-speed networks
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Computer Communications
QoS routing based on genetic algorithm

Computer Communications
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

Computer Communications
QoS-driven multicast tree generation using Tabu search

Computer Communications
Distributed multicast routing, with end-to-end delay and delay variation constraints

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Landscape analysis for multicast routing

Computer Communications
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing

Computers and Operations Research
On the Hardness of Approximating the Multicast Delay Variation Problem

IEEE Transactions on Computers
A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm

Computer Communications
An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem

Computer Communications
A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Applied Intelligence
An efficient distributed dynamic multicast routing with delay and delay variation constraints

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
On solving the rooted delay- and delay-variation-constrained steiner tree problem

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures

Discrete Applied Mathematics

Quantified Score

Hi-index	0.25

Visualization

Abstract

The delay and delay variation-bounded Steiner tree problem is an important multicast routing issue in real-time multimedia networks. Such a constrained Steiner tree problem is known to be NP-complete. In this paper, we propose a distributed multicast routing algorithm based on simulated annealing to produce routing trees having a minimal network cost under delay and delay variation constraints. The proposed algorithm is fully distributed, and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree cost as compared with other existing algorithms, and it performs excellently in delay and delay variation. Furthermore, it has high success ratio, rapid convergence and better real-time property.