Applying tabu search to backup path planning for multicast networks |
| |
| Affiliation: | 1. Department of Statistics–Forecasts–Mathematics, Faculty of Economics and Business Administration, Babeş-Bolyai University, 400084 Cluj-Napoca, Romania;2. Department of Mathematics, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, 400084 Cluj-Napoca, Romania;1. Indian Statistical Institute (ISI), Chennai Centre, SETS (Society for Electronic Transactions and Security), MGR Knowledge City, CIT Campus, Taramani, Chennai 600 113, India;2. Aalto University, Department of Mathematics and Systems Analysis, P.O. Box 11100, FI-00076 Aalto, Finland;1. Institute of Research and Development of Processes, University of Basque Country, Campus of Leioa (Bizkaia), PO Box 644, Bilbao 48940, Spain;2. Department of Mathematics, ATILIM University, 06836 Incek, Ankara, Turkey |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
