Routing and wavelength assignment in optical networks using bin packing based algorithms

DOI10.1016/J.EJOR.2006.01.003MaRDI QIDQ856305zbMATH OpenOpenAlexFDO

Authors Nina Skorin-Kapov

Publication date 7 December 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.01.003

zbMATH Keywords

bin packingoptical networksOR in telecommunicationsrouting and wavelength assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Recommendations

• Algorithms for multicast routing and wavelength assignment in all-optical networks under some special topologies
• scientific article; zbMATH DE number 1717194
• Near optimal design of wavelength routed optical networks

Cites work

• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1845872 (Why is no real title available?)
• A classification scheme for bin packing theory
• Routing and wavelength assignment by partition colouring

Cited in

(20)

• Neuron-based wavelength assignment for optical wavelength division multiplexing service systems
• Biased random-key genetic algorithms with applications in telecommunications
• Dual-neighborhood iterated local search for routing and wavelength assignment
• Routing and wavelength assignment in all-optical networks based on the bee colony optimization
• Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
• Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• Optimization algorithms for packing of small-lot correspondence in communication networks
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Shortest node-disjoint paths on random graphs
• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
• Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
• Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
• Performance evaluation of heuristic algorithms for routing and wavelength assignment in WDM optical networks
• Weighted quantum genetic algorithm for one-dimensional bin packing problem
• Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks
• A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands
• Solving the routing and wavelength assignment problem with conflict-driven ASP solvers

This page was built for publication: Routing and wavelength assignment in optical networks using bin packing based algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856305)