Notice of Violation of IEEE Publication PrinciplesMinimal cost attack aware routing and wavelength assignment in optical network security

Notice of Violation of IEEE Publication Principles

"Minimal Cost Attack Aware Routing And Wavelength Assignment In Optical Network Security"
by V.Johncy Vijayakumari
in the 2011 International Conference on Emerging Trends in Electrical and Computer Technology (ICETECT), 2011, pp. 953 – 958.

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.

This paper contains significant portions of original text from the paper cited below. The original text was copied with insufficient attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"A New Approach to Optical Networks Security: Attack-Aware Routing and Wavelength Assignment"
by Nina Skorin-Kapov, Jiajia Chen, Lena Wosinska
in the IEEE/ACM Transactions On Networking, Vol. 18, No. 3, 2010, pp. 750 – 760.

Transparent optical networks based on wavelength division multiplexing (WDM) can exploit the huge capacity of optical fibers by dividing it among different wavelengths. Physical-layer attacks, such as high-powered jamming, can seriously degrade network performance and must be dealt with efficiently. Hence route lightpaths in such a way as to minimize the potential damage caused by various physical-layer attacks. A new objective criterion for the routing and wavelength assignment (RWA) problem, which we call the maximum Lightpath Attack Radius (maxLAR) is used to formulate the routing subproblem as an integer linear program (ILP). Lightpaths, are established between pairs of nodes. Given a physical topology and a set of lightpath demands, the RWA problem consists of finding a - hysical route for each lightpath demand and assigning to each route a wavelength, subject to the constraints. The maxLAR is the maximum number of lightpaths any one lightpath is link-sharing with, where link-sharing is defined as a property indicating whether two lightpaths traverse at least one common physical link. Results indicate that the formulation achieves significantly better results for the maxLAR. For larger networks, a tabu search algorithm for attack-aware lightpath routing, in combination with an existing graph-coloring algorithm for wavelength assignment is used. Testing and comparing with existing approaches from literature indicate its superiority with respect to the maxLAR and thus the congestion is reduced effectively.