Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Bandwidth packing: a tabu search approach
Management Science
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Path assignment for call routing: an application of tabu search
Annals of Operations Research - Special issue on Tabu search
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
Applying tabu search to spare capacity planning for network restoration
Computers and Operations Research
A note on distributed multicast routing in point-to-point networks
Computers and Operations Research
Delay-constrained, low-cost multicast routing in multimedia networks
Journal of Parallel and Distributed Computing
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
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem
Computers and Operations Research
Backup VP planning for multicast connections in ATM networks
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
A new approach for delay-constrained routing
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Multicast routing with end-to-end delay and delay variation constraints
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
Hi-index | 0.01 |
More and more multimedia applications rely on the ability of networks to provide multicast communications. Network survivability becomes a critical issue in network planning, design, and operation to reduce the impacts of failures in high-speed networks. A rapid and cost-effective restorable network must be planned to maintain network survivability and use network bandwidth effectively. This paper considers the problem of preplanning delay-constrained backup path for multicast networks to minimize the total cost of all the backup paths. Based on the path restoration scheme, a tabu search (TS) algorithm is proposed to find a near optimal solution for the problem under investigation. Diversification and intensification strategies are suggested. The computational experiments are conducted to demonstrate the performance of the proposed TS algorithm. The results show that it offers high-quality solutions within a short amount of time.