Security-Aware Dynamic RWA for Reducing In-band and Out-of-band Jamming Attacks in WDM Optical Networks

Al-Mamoori, Saja; Jaekel, Arunita; Bandyopadhyay, Subir; Varanasi, Sriharsha

doi:10.4304/jnw.10.11.587-596

Cited by 3 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of this technique significantly reduces the number of integer variables in this formulation and hence its computational complexity. Constraints (10) and (11) determine if two lightpaths p and q share at least one (possibly more) common link(s), and if so set p,q = 1.…”

Section: Subject Tomentioning

confidence: 99%

“…Constraint (14)-(18) very similar to constraints (7)- (11) and are used to determine if two lightpaths p and q pass…”

Section: Subject Tomentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…A number of different attack-aware RWA algorithms have been proposed in the literature, for static [1,5,8,9] and dynamic [10][11][12] lightpath allocation. Attack-aware RWA approaches typically try to reduce the attack-radius (AR) [11,13,14] for a given set of lightpaths, by suitably choosing the route and/or wavelength for each lightpath. The AR of a compromised lightpath p can be loosely defined as the number of lightpaths (including itself ) that can be adversely affected by an attacking signal on p. This typically occurs when p shares at least one link or at least one node and a common channel [1,15] with the other lightpath.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimal attack-aware RWA for scheduled lightpath demands

2019

Self Cite

View full text Add to dashboard Cite

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 attackunaware and fixed window models. Keywords Transparent optical networks (TONs) • High-power jamming attacks • Scheduled lightpath demands (SLDs) • Integer linear program (ILP) • Routing and wavelength • Assignment (RWA)

show abstract

Section: Subject Tomentioning

confidence: 99%

“…Constraint (14)-(18) very similar to constraints (7)- (11) and are used to determine if two lightpaths p and q pass…”

Section: Subject Tomentioning

confidence: 99%