Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Multiwavelength Optical Networks: A Layered Approach
Multiwavelength Optical Networks: A Layered Approach
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Wavelength Routing and Assignment in a Survivable WDM Mesh Network
Operations Research
Hi-index | 0.98 |
We investigate the problem of optimal usage of tributary cards in wavelength assignment for DWDM ring networks. Previous work in the literature has mostly concentrated on the minimal wavelength assignment or the minimal add/drop wavelength assignment problem at the optical layer. When this problem is viewed at the service layer, a completely different picture emerges. Ring networks consist of physical nodes and fibers. In each node, physical or structural limitations may exist; for example, each node could only have a limited number of service cards, and each card could only have a limited number of ports. This imposes important practical constraints on the wavelength assignment problem. Without considering such constraints, the network designed may not be feasible to implement. In this paper, we propose a different approach to DWDM network design. In the new approach, the goal of the network design is to minimize the total number of tributary cards and the total number of ADMs, or to minimize the total number of tributary cards and the total number of wavelengths used in the system. A mathematical model is then developed for each case, followed by a heuristic algorithm for solving the problem as well as an illustrative example.