Dynamic provisioning of fault tolerant optical networks for data centers

Das, Ruchisree; Bandyopadhyay, Subir; Mamoori, Saja Al; Jaekel, Arunita

doi:10.1109/ccece.2017.7946714

Cited by 3 publications

(2 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All simulations are carried out using IBM ILOG CPLEX 12.6.2 optimization studio [32]. We consider three well-known network topologies namely, DT10 (10 nodes) [33], NSFNET (14 nodes) [34], and ARPANET (20 nodes) [35]. Each value reported here is calculated as the average of five simulation runs.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…The constraints (35)- (37) are the demand scheduling constraints. The constraint (35) is used to determine the actual start time for the lightpath p and ensure that each demand has only one possible start time. Clearly, in order to be accommodated within the specified time window (from p , p ), a demand of duration p must start during the intervals from p to p − p .…”

Section: Sliding Window Scheduling Constraintsmentioning

confidence: 99%

See 1 more Smart Citation

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: Simulation Resultsmentioning

confidence: 99%

Section: Sliding Window Scheduling Constraintsmentioning

confidence: 99%

Optimal attack-aware RWA for scheduled lightpath demands

2019

Self Cite

View full text Add to dashboard Cite

show abstract

Robust Data Center Network Design Based on Space Division Multiplexing

Mamoori

Jaekel

Bandyopadhyay

2018

2018 International Conference on Computing, Networking and Communications (ICNC)

View full text Add to dashboard Cite

Link Fault Tolerant Algorithms to Optimize the Blocking in Optical Burst Switching Networks

Saini

Wason²

2018

Journal of Optical Communications

View full text Add to dashboard Cite

In this paper, link fault tolerant algorithms (LFTAs) are employed for optimization of blocking performance in optical burst switching (OBS) networks for dynamic establishment of wavelength-routed lightpaths. This paper presents two algorithms: link fault tolerance algorithm for least congestion (LFTALC) and link fault tolerance algorithm for optimized blocking (LFTAOB). In former algorithm, the path with least congestion is selected and in the latter algorithm the path with least blocking probability is selected and then both the algorithms check for the availability of fault on the links present in the selected path. The findings indicate that methods of developing link based fault tolerant algorithms keep good performance and fairness among all the connections. The key advantage of these proposed algorithms as compared to routing and wavelength assignment algorithm is that these are very simple in nature and require less service disruption time.

show abstract

Dynamic provisioning of fault tolerant optical networks for data centers

Cited by 3 publications

References 40 publications

Optimal attack-aware RWA for scheduled lightpath demands

Optimal attack-aware RWA for scheduled lightpath demands

Robust Data Center Network Design Based on Space Division Multiplexing

Link Fault Tolerant Algorithms to Optimize the Blocking in Optical Burst Switching Networks

Contact Info

Product

Resources

About