Minimizing attack radius of scheduled connections in WDM networks

Transparent optical networks (TONs) has the advantage of handling high data rates through effective utilization of the fiber bandwidth. However, features like transparency in TONs makes such networks susceptible to several physical layer attacks. Hence, designing TONs with a capability of handling such high power jamming attacks is an important network security problem. In this work, we propose an integer linear program (ILP) formulation to control the propagation of these physical layer attacks in TONs, for the demands which need periodic bandwidth usage at certain predefined timings. There are two different approaches for handling these scheduled traffic demands, fixed window and sliding window. Our research deals with the sliding window scheduled traffic model, which is more flexible when compared with fixed window, as the start and end timings of the demand are unknown and they slide within a larger window setting. Hence, we present an ILP to handle the routing and wavelength assignment (RWA) problem for sliding window scheduled traffic model, with an objective to minimize the attack radius for all the commodities.