Evolutionary algorithms refining a heuristic: A hybrid method for shared-path protections in WDM networks under SRLG constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 37, Issue 1, 2007, Pages 51-61

  Zhang, Qingfu ^a   Sun, Jiangyong ^b   Xiao, Gaoxi ^c   Tsang, Edward ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Estimation of distribution algorithms (EDAs); Evolutionary algorithm (EA); Guided mutation; Hyperheuristics; Memetic algorithm (MA); Network protection; Shared risk link group (SRLG)

Indexed keywords

CONSTRAINT THEORY; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

ESTIMATION OF DISTRIBUTION ALGORITHMS (EDAS); GUIDED MUTATION; HYPERHEURISTICS; MEMETIC ALGORITHM (MA); NETWORK PROTECTION; SHARED-RISK LINK GROUP (SRLG);

WAVELENGTH DIVISION MULTIPLEXING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; BIOLOGICAL MODEL; BIOMIMETICS; COMPUTER NETWORK; COMPUTER PROGRAM; COMPUTER SIMULATION; EVOLUTION; METHODOLOGY; SIGNAL PROCESSING; SYSTEMS THEORY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOMIMETICS; COMPUTER COMMUNICATION NETWORKS; COMPUTER SIMULATION; EVOLUTION; MODELS, GENETIC; SIGNAL PROCESSING, COMPUTER-ASSISTED; SOFTWARE; SYSTEMS THEORY;

EID: 33847649620     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2006.883269     Document Type: Article

References (47)

1. D. Corne, M. Dorigo, and F. Glover, Eds., New Ideas in Optimisation, New York: McGraw-Hill, 1999.
2. H. E. William, E. N. Krasnogor, and J. E. Smith, Eds., Recent Advances in Memetic Algorithms, New York: Springer-Verlag, 2005.
3. P. Moscato and C. Cotta, "A gentle introduction to memetic algorithms," in Handbook of Meta-Heuristics, F. Glover and G. Kochenberger, Eds. Norwell, MA: Kluwer, 2003, pp. 105-144.
4. N. Krasnogor, "Studies on the theory and design space of memetic algorithms," Ph.D. dissertation, Univ. West England, Bristol, U.K., 2002.
5. Y. S. Ong and A. J. Keane, "Meta-Lamarckian in memetic algorithm," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.
6. H. Ishibuchi and T. Murata, "A multi-objective genetic local search algorithm and its application to flowshop scheduling," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 28, no. 3, pp. 392-403, Aug. 1998.
7. Q. Zhang and Y.-W. Leung, "Orthogonal genetic algorithm for multimedia multicast routing," IEEE Trans. Evol. Comput., vol. 3, no. 1, pp. 53-62, Apr. 1999.
8. P. Merz and B. Freisleben, "Fitness landscape analysis and memetic algorithms for the quadratic assignment problem," IEEE Trans. Evol. Comput., vol. 4, no. 4, pp. 337-352, Nov. 2000.
9. Y. S. Ong, M. H. Lim, N. Zhu, and K. W. Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 1, pp. 141-152, Feb. 2006.
10. H.-L. Fang, P. M. Ross, and D. Corne, "A promising hybrid GA/heuristic approach for open-shop scheduling problems," in Proc. 11th ECAI, A. Cohn, Ed., 1994, pp. 590-594.
11. E. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, "Hyper-heuristics: An emerging direction in modern search technology," in Handbook of Meta-Heuristics, F. Glover and G. Kochenberger, Eds. Norwell, MA: Kluwer, 2003, pp. 457-474.
12. N. Krasnogor and J. E. Smith, "A tutorial for competent memetic algorithms: Model, taxonomy and design issues," IEEE Trans. Evol. Comput., vol. 9, no. 5, pp. 474-488, Oct. 2005.
13. B. A. Huberman, R. M. Lukose, and T. Hogg, "An economics approach to hard computational problems," Science, vol. 275, no. 5296, pp. 51-54, Jan. 3, 1997.
14. A. Kapsalis, V. J. Rayward-Smith, and G. D. Smith, "Solving the graphical Steiner tree problem using genetic algorithms," J. Oper. Res. Soc., vol. 44, no. 4, pp. 397-406, 1993.
15. Y. Xiong, B. Golden, and E. Wasil, "A one-parameter genetic algorithm for the minimum labeling spanning tree problem," IEEE Trans. Evol. Comput., vol. 9, no. 1, pp. 55-60, Feb. 2005.
16. D. A. Pelta and N. Krasnogor, "Multimeme algorithms using fuzzy logic based memes for protein structure prediction," in Recent Advances in Memetic Algorithms. New York: Springer-Verlag, 2005, pp. 49-64.
17. P. E. Hotz, "Comparing direct and developmental encoding schemes in artificial evolution: A case study in evolving lens shapes," in Proc. IEEE Congr. Evol., 2004, pp. 752-757.
18. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
19. J. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor: Univ. of Michigan Press, 1975.
20. Z. Michalewicz, Genetic Algorithm + Data Structures = Evolution Programs. New York: Springer-Verlag, 1996.
21. P. Larrañaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Norwell, MA: Kluwer, 2002.
22. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning," Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-94-163, 1994.
23. Q. Zhang and H. Muehlenbein, "On the convergence of a class of estimation of distribution algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 127-136, Apr. 2004.
24. Q. Zhang, "On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm," IEEE Trans. Evol. Comput., vol. 8, no. 1, pp. 80-93, Feb. 2004.
25. Q. Zhang, J. Sun, and E. P. K. Tsang, "Evolutionary algorithm with the guided mutation for the maximum clique problem," IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 192-200, Apr. 2005.
26. Q. Zhang, J. Sun, E. P. K. Tsang, and J. A. Ford, "Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem," in Proc. Bird Feather Workshops, Genetic and Evol. Comput. Conf., 2004, pp. 42-48.
27. H. Zang, C. Ou, and B. Mukherjee, "Path-backup routing and wavelength-assignment (RWA) in WDM mesh networks under duct-layer constraints," IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 248-258, Apr. 2003.
28. B. Mukherjee, Optical Communication Networks. New York: McGraw-Hill, 1997.
29. S. Ramamurthy and B. Mukherjee, "Survivable WDM mesh network, Part I - Protection," in Proc. IEEE Infocom, 1999, pp. 744-751.
30. C. Ou, J. Zhang, H. Zang, L. H. Sahasrabuddhe, and B. Mukherjee, "New and improved approaches for shared-path protection in WDM mesh networks," J. Lightw. Technol., vol. 22, no. 5, pp. 1223-1232, May 2004.
31. Y. Xiong, D. Xu, and C. Qiao, "Achieving fast and bandwidth efficient shared-path protection," J. Lightw. Technol., vol. 21, no. 2, pp. 365-371, Feb. 2003.
32. J. Strand, A. Chiu, and R. Tkach, "Issues for routing in the optical layer," IEEE Commun. Mag., vol. 39, no. 2, pp. 81-87, Feb. 2001.
33. P. Sebos, J. Yates, A. Greenberg, and D. Rubenstein, "Effectiveness of shared risk link group auto-discovery in optical networks," in Proc. Opt. Fiber Commun. Conf., Mar. 2002, pp. 493-495.
34. J. Q. Hu, "Diverse routing in optical mesh networks," IEEE Trans. Commun., vol. 51, no. 3, pp. 489-494, Mar. 2003.
35. H. Zang, J. P. Jue, and B. Mukherjeee, "A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks," Opt. Netw. Mag., vol. 1, no. 1, pp. 47-60, Jan. 2000.
36. S. Sengupta and R. Ramamurthy, "From network design to dynamic provisioning and restoration in optical cross-connect mesh networks: An architectural and algorithmic overview," IEEE Netw., vol. 15, no. 4, pp. 46-54, Jul./Aug. 2001.
37. G. Ellinas, E. Bouillet, R. Ramamurthy, J. Labourdette, S. Chauduri, and K. Bala, "Routing an restoration architectures in mesh optical networks," SPIE Opt. Netw. Mag., vol. 4, no. 1, pp. 91-106, Jan./Feb. 2003.
38. M. Sridharan, A. Somani, and M. Salapaka, "Approaches for capacity and revenue optimization in survivable WDM networks," J. High Speed Netw., vol. 10, no. 2, pp. 109-124, 2001.
39. D. Doshi et al., "Optical network design and restoration," Bell Labs Tech. J., vol. 4, no. 1, pp. 58-84, 1999.
40. P. Ho and H. Mouftah, "Reconfigurations of spare capacity for MPLS-based recovery for the Internet backbone networks," IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 73-84, Feb. 2004.
41. L. Shen, X. Yang, and B. Ramamurthy, "Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreement in wavelength-routed optical mesh networks," IEEE/ACM Trans. Netw., vol. 13, no. 4, pp. 918-931, Aug. 2005.
42. P. Datta, M. T. Frederick, and A. K. Somani, "Sub-graph routing: A novel fault-tolerant architecture for shared-risk link group failures in WDM optical networks," in Proc. DRCN, 2003, pp. 296-303.
43. A. Todimala and B. Ramamurthy, "Survivable virtual topology routing under shared risk link groups in WDM networks," in Proc. BoardNets, 2004, pp. 130-139.
44. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijiver, Combinatorial Optimization. Hoboken, NJ: Wiley, 1998.
45. T. R. Jensen and B. Ton, Graph Coloring Problems. New York: Wiley Interscience, 1995.
46. F. Glover and M. Laguna, Tabu Search. Norwell, MA: Kluwer, 1998.
47. R. Fletcher, Practical Methods of Optimization, 2nd ed. Hoboken, NJ: Wiley, 1987.