Optimal attack-aware RWA for scheduled lightpath demands

Autor: Saja Al Mamoori, Meenakshi Nizampatnam, Arunita Jaekel
Rok vydání: 2019
Předmět:
Zdroj: SN Applied Sciences. 1
ISSN: 2523-3971
2523-3963
DOI: 10.1007/s42452-019-1418-z
Popis: In Transparent optical networks (TONs), the data signals remain in the optical domain for the entire transmission path, creating a virtual topology over the physical connections of optical fibers. Due to the increasingly high data rates and the vulnerabilities related to the transparency of optical networks, TONs are susceptible to different physical layer attacks, including high-power jamming attacks. Developing strategies to handle such attacks and mitigating their impact on network performance is becoming an important design problem for TONs. Some approaches for handling physical layer attacks for static and dynamic traffic in TONs have been presented in recent years. In this work, we propose an integer linear program (ILP) formulation to control the propagation of such attacks in TONs for scheduled lightpath demands, which need periodic bandwidth usage at certain predefined times. We consider both the fixed window model, where the start and end timings of the demand are known in advance, and the sliding window model, where exact start and end times are unknown but fall within a larger window. We consider a number of potential objectives for attack-aware RWA and show how the flexibility to schedule demands in time can impact these objectives, compared to both attack-unaware and fixed window models.
Databáze: OpenAIRE
Externí odkaz: