A distributed memetic algorithm for the routing and wavelength assignment problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5199 LNCS, Issue , 2008, Pages 879-888

  Fischer, Thomas ^a   Bauer, Kerstin ^a   Merz, Peter ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DENSE WAVELENGTH DIVISION MULTIPLEXING; FIBER OPTIC NETWORKS; OPTICAL DATA PROCESSING; ROUTING ALGORITHMS; SOLUTIONS; TELECOMMUNICATION TRAFFIC; TRAVELING SALESMAN PROBLEM; ALGORITHMS; COMBINATORIAL OPTIMIZATION;

ALL-OPTICAL NETWORKS; EPIDEMIC ALGORITHMS; MEMETIC ALGORITHMS; OPTIMAL RESULTS; RECOMBINATION OPERATORS; ROUTING AND WAVELENGTH ASSIGNMENT PROBLEMS; SOLUTION QUALITIES; STATIC RWA; UNSOLVED PROBLEMS;

PROBLEM SOLVING;

ALL- OPTICAL NETWORKS; EPIDEMIC ALGORITHM; MEMETIC ALGORITHMS; OPTIMAL RESULTS; RECOMBINATION OPERATORS; ROUTING AND WAVELENGTH ASSIGNMENT PROBLEMS; SOLUTION QUALITY; UNSOLVED PROBLEMS;

EID: 56449086558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87700-4_87     Document Type: Conference Paper

References (15)

1. Chlamtac, I., Ganz, A., Karmi, G.: Lightnet: Lightpath Based Solutions for Wide Bandwidth WANs. In: INFOCOM 1990, vol. 3, pp. 1014-1021 (1990)
2. Bala, K., Stern, T.E., Bala, K.: Algorithms for Routing in a Linear Lightwave Network. In: IEEE INFOCOM, vol. 1, pp. 1-9 (1991)
3. Chlamtac, I., Ganz, A., Karmi, G.: Lightpath Communications: An Approach to High Bandwidth Optical WANs. IEEE Trans. Comm. 40(7), 1171-1182 (1992)
4. Banerjee, D., Mukherjee, B.: A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE J. Sel. Areas Comm. 14(5), 903-908 (1996)
5. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks From Edge Disjoint Path Algorithms. IEEE Communications Letters 6(5), 211-213 (2002)
6. Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks. Optical Networks Magazine 1, 47-60 (2000)
7. Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A Functional Classification of Routing and Wavelength Assignment Schemes in DWDM networks: Static Case. In: OPNET 2000, pp. 1109-1115 (2000)
8. Sinclair, M.C.: Minimum cost routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach. In: Proc. 6th IEE Conf. Telecom. (1998)
9. Skorin-Kapov, N.: Routing and Wavelength Assignment in Optical Networks using Bin Packing Based Algorithms. EJOR 177(2), 1167-1179 (2007)
10. Bauer, K., Fischer, T., Krumke, S.O., Gerhardt, K., Westphal, S., Merz, P.: Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 158-169. Springer, Heidelberg (2008)
11. Fischer, T., Bauer, K., Merz, P.: A Multilevel Approach for the Routing and Wavelength Assignment Problem. In: Köppen, M., Raidl, G. (eds.) HEUNET 2008. IEEE Comp. Soc. Press, Los Alamitos (2008)
12. Deniers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Maintenance. In: Schneider, F.B. (ed.) ACM PODC., pp. 1-12. ACM Press, New York (1987)
13. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Transactions on Computer Systems 25(3) (2007)
14. Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0-Survivable Network Design Library. In: Proc. INOC 2007 (2007)
15. Atamtürk, A., Rajan, D.: Partition inequalities for capacitated survivable network design based on directed p-cycles. Discrete Optimization 5(2), 415-433 (2008)