Efficient coloring of a large spectrum of graphs
DAC '98 Proceedings of the 35th annual Design Automation Conference
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Tabu Search
IEEE/ACM Transactions on Networking (TON)
Cross-talk attack monitoring and localization in all-optical networks
IEEE/ACM Transactions on Networking (TON)
New upper bounds for the chromatic number of a graph
Journal of Graph Theory
IEEE Journal on Selected Areas in Communications
Failure Location Algorithm for Transparent Optical Networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications - Part Supplement
Security issues in all-optical networks
IEEE Network: The Magazine of Global Internetworking
A novel method to evaluate clustering algorithms for hierarchical optical networks
Photonic Network Communications
Network topology planning using MOEA/D with objective-guided operators
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Hi-index | 0.00 |
Security issues and attack management in transparent wavelength division multiplexing (WDM) optical networks have become of prime importance to network operators due to the high data rates involved and the vulnerabilities associated with transparency. Deliberate physical-layer attacks, such as high-powered jamming, can seriously degrade network performance and must be dealt with efficiently. While most approaches are focused on the developing fast detection and reaction mechanisms triggered in case of an attack, we propose a novel approach to help deal with these issues in the network planning and provisioning process as a prevention mechanism. Namely, we propose to route lightpaths in such a way as to minimize the potential damage caused by various physical-layer attacks. We present a new objective criterion for the routing and wavelength assignment (RWA) problem, which we call the maximum Lightpath Attack Radius (maxLAR), and formulate the routing subproblem as an integer linear program (ILP). We test it on small networks to get an insight into its complexity and compare it to a formulation that minimizes congestion. Results indicate that our formulation achieves significantly better results for the maxLAR while obtaining near-optimal or optimal congestion in all cases. For larger networks, we propose a tabu search algorithm for attack-aware lightpath routing, in combination with an existing graph-coloring algorithm for wavelength assignment. Testing and comparing with existing approaches from literature indicate its superiority with respect to the maxLAR and average lightpath load, albeit at the expense of somewhat higher congestion. However, this is justified with the obtained improvement in network security.