Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths

Computers and Operations Research

Volumn 32, Issue 5, 2005, Pages 1073-1087

  Chamberland, Steven ^a   Khyda, Désiré Oulaï ^a   Pierre, Samuel ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Heuristic algorithm; Mathematical model; Optical network planning; Wavelength assignment; Wavelength division multiplexing; Wavelength path routing

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; FAILURE ANALYSIS; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; WAVELENGTH DIVISION MULTIPLEXING;

HEURISTIC ALGORITHMS; OPTICAL NETWORK PLANNING; WAVELENGTH ASSIGNMENT; WAVELENGTH PATH ROUTING;

COMPUTER NETWORKS;

EID: 7544237668     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.09.013     Document Type: Article

References (21)

1. Stern T.E., Bala K. Multiwavelength optical networks. 1999;Prentice-Hall, Englewood Cliffs, NJ.
2. Graver W.D., Doucette J. Topological design of survivable mesh-based transport networks. Annals of Operations Research. 106:2001;79-125.
3. Fabry-Asztalos T, Bhide N, Sivalingam KM. Adaptive weight functions for shortest path routing algorithms for multi wavelength optical WDM network. Proceedings IEEE ICC, New Orleans, USA, 2000. p. 1330-4.
4. Gangxiang S., Bose S.K., Cheng T.H., Lu C., Chai T.Y. Performance analysis under dynamic loading of wavelength continuous and non-continuous WDM networks with shortest-path routing. International Journal of Communication Systems. 14(4):2001;407-418.
5. Gangxiang S, Bose SK, Cheng TH, Lu C. Designing WDM optical network for reliability: routing light paths efficiently for path protection. Proceedings OFC, Baltimore, USA, 2000. p. 50-2.
6. Kennington J., Olnick E., Ortynski A., Spiride G. Wavelength routing and assignment in a survivable WDM mesh network. Operations Research. 51(1):2003;67-79.
7. Knoke M, Hartmann HL. Fast optimum routing and wavelength assignment for WDM ring transport networks. Proceedings IEEE ICC, New-York, USA, 2002. p. 2740-4.
8. Miyao Y., Saito H. Optimal design and evaluation of survivable WDM transport networks. IEEE Journal on Selected Areas in Communications. 16(7):1998;1190-1198.
9. Mohan G., Riva Ram Murthy C., Somani A.K. Efficient algorithms for routing dependable connections in WDM optical networks. IEEE/ACM Transactions on Networking. 9(5):2001;553-566.
10. Rodriguez-Dagnino RM, Lopez-Caudana EO, Martinez-Alfaro H, Gonzalez-Velarde JL. Simulated annealing and stochastic ruler algorithms for wavelength assignment planning in WDM optical networks. Proceeding IEEE SMC, Tokyo, Japan, 1999. p. 1015-120.
11. Fumagalli A, Cerutti I, Tacca M, Montgomery D, Chlamtac I, Pathak K. CATO: trans-layer dense wavelength-division multiplexing (DWDM) network optimization. The clustering approach for large network design. OFC Technical Digest Post Conference Edition, 2000. p. 378-80.
12. Garnot M, Masetti F. Dimensioning and design of the WDM optical layer in transport networks. Proceedings SPIE, Dallas, USA, 1997;3230:244-52.
13. Lee M, Kim J, Park J. Design and evaluation of survivable WDM networks by joint optimization method. Pacific Rim Conference on Lasers and Electro-Optics, Seoul, South Korea, 1999. p. 503-4.
14. Garey M.R., Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. 1979;Freeman, New York.
15. Bampis E., Rouskas G.N. The scheduling and wavelength assignment problem in optical WDM networks. Journal of Lightwave Technology. 20(5):2002;754-761.
16. Murphey R.A., Pardalos P.M., Pasiliao E. Multicriteria optimization for frequency assignment. Proceedings of DIMACS Workshop on Mobile Networks and Computing. 52:2000;203-219.
17. Weinberg B, Bachelet V, Talbi EG. A co-evolutionist metaheuristic for the assignment of the frequencies in cellular networks. Lecture notes in computer science, vol. 2037. Berlin: Springer; 2001. p. 140-9.
18. Brélaz D. New methods to color vertices of a graph. Communications of the ACM. 22(4):1979;251-256.
19. Erben W. A grouping genetic algorithm for graph colouring and exam timetabling. Lecture notes in computer science, vol. 2079. Berlin: Springer; 2001. p. 132-56.
20. Galinier P., Hao J.K. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization. 3(4):1999;379-397.
21. ILOG, Inc. ILOG CPLEX 7.1 - advanced reference manual. ILOG Inc., 2001.