Algorithms for the global design of WDM networks including the traffic grooming |
| |
| Affiliation: | 1. University of São Paulo, Polytechnic School, Department of Production Engineering, São Paulo, Brazil;2. Av. Prof. Almeida Prado, 128, Cidade Universitária, 05508-070 São Paulo SP, Brazil;3. Mathematical Optimization and Planning, Amazon.com, 333 Boren Avenue North, Seattle, WA 98109, USA;1. Civil Engineering Department, Universidad de Chile, Blanco Encalada 2002, 5th Floor, Santiago, Chile;2. CIRRELT and MAGI, Ecole Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montreal, Quebec H3C 3A7, Canada;3. McCombs School of Business, University of Texas at Austin, 2110 Speedway Stop B6500, Austin, TX 78712, USA;4. Industrial Engineering Department, Universidad de Chile, Republica 701, Santiago, Chile;1. Department of Information Management, Chang Gung University, Taoyuan, Taiwan;2. Department of Medical Research and Development Linkou Branch, Chang Gung Memory Hospital, Linkou, Taiwan;3. Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan;1. School of Management and Engineering, Nanjing University, Nanjing 210093, China;2. School of Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China;3. Department of Industrial Systems Engineering & Management, National University of Singapore, Singapore |
| |
| Abstract: | In this paper, we propose a model and algorithms for the global design problem of wavelength division multiplexing (WDM) networks including the traffic grooming. This problem consists in finding the number of fibres between each pair of nodes (i.e. the physical topology), finding the number of transponders at each node, choosing the set of lightpaths (i.e. the virtual topology), routing these lightpaths over the physical topology and, finally, grooming and routing the traffic over the lightpaths. Since this problem is NP-hard, we propose two heuristic algorithms and a tabu search metaheuristic algorithm to find solutions for real-size instances within a reasonable amount of computational time. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
