Forward-Looking WDM Network Reconfiguration with Per-Link Congestion Control

Wu, Jing; Zhang, James; Bochmann, Gregor von; Savoie, Michel

doi:10.1007/s10922-011-9212-2

Cited by 7 publications

(3 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first assumption is justified by the common practice of service providers, where the granting decisions are made for a batch of requests in order to maximize GoS and incremental planning has to be performed in given periods to determine the capacity upgrades needed for addressing the growth of the traffic. It is indeed a common practice in the context of the dynamic traffic literature (Wu et al 2012, Chen et al 2015, Jaumard and Daryalal 2017. The second assumption is nonrestrictive, since by leasing one unit of wavelength (Leung and Grover 2005), any provisioning can be migrated to a new one without service disruption.…”

Section: Motivationmentioning

confidence: 99%

Stochastic RWA and Lightpath Rerouting in WDM Networks

Daryalal¹,

Bodur²

2020

Preprint

View full text Add to dashboard Cite

In a telecommunication network, Routing and Wavelength Assignment (RWA) is the problem of finding lightpaths for incoming connection requests. When facing a dynamic traffic, greedy assignment of lightpaths to incoming requests based on predefined deterministic policies leads to a fragmented network that cannot make use of its full capacity due to stranded bandwidth. At this point service providers try to recover the capacity via a defragmentation process. We study this setting from two perspectives: (i) while granting the connection requests via the RWA problem and (ii) during the defragmentation process by lightpath rerouting. For both problems, we present the first two-stage stochastic integer programming model incorporating incoming request uncertainty to maximize the expected grade of service. We develop a decomposition-based solution approach, which uses various relaxations of the problem and a newly developed problem-specific cut family. Simulation of two-stage policies for a variety of instances in a rolling-horizon framework of 52 stages shows that our stochastic models provide high-quality solutions compared to traditionally used deterministic ones. Specifically, the proposed provisioning policies yield improvements of up to 19% in overall grade of service and 20% in spectrum saving, while the stochastic lightpath rerouting policies grant up to 36% more requests using up to just 4% more bandwidth spectrum.

show abstract

Section: Motivationmentioning

confidence: 99%

Stochastic RWA and Lightpath Rerouting in WDM Networks

Daryalal¹,

Bodur²

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…The idea is to discrete the continuous time horizon into intervals/cycles, and solve a static RWA problem for each, using the batch of demand consisting of dynamically arriving requests during that interval as the input. This is indeed a typical setting in studies addressing network reconfiguration problems that establish new connections by allowing the existing ones to be rearranged (Zhang et al 2007, Wu et al 2012, Grover 2013. It can also lead to more efficient use of potentially limited network resources in the long run.…”

Section: Background Informationmentioning

confidence: 99%

Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach

Şeker,

Bodur,

Pouya

2020

Preprint

View full text Add to dashboard Cite

The routing and wavelength assignment with protection (RWA-P) is an important problem in telecommunications. Given an optical network and incoming connection requests, the problem aims to grant maximum number of requests by assigning lightpaths at minimum network resource usage level, while ensuring the provided services remain functional in case of a single-link failure. We consider a practically relevant case of RWA-P where alternative lightpaths for requests are assumed to be given as a precomputed set, and show that it is NP-hard. We formulate RWA-P as an integer programming (IP) model, then use it as a foundation to develop a novel quadratic unconstrained binary optimization (QUBO) model. Moreover, we present conditions on model parameters to achieve a desired objective prioritization, and to ensure the exactness of the QUBO model. We use a new technology, Digital Annealer (DA), to solve the QUBO model, and compare it with three different alternatives that employ GUROBI, namely providing the models directly to the solver, and applying a branch-and-cut method. We conduct computational experiments on a large suite of instances for performance comparison and sensitivity analysis on model parameters. The results show that the emerging solution technology DA outperforms or is comparable to the established techniques coupled with the state-of-the-art solvers in addressing the need of generating high-quality solutions quickly.

show abstract

“…There are several studies on congestion control techniques [102][103][104][105][106][107][108][109][110][111][112] in which network performance is evaluated under various network conditions and a range of parameters for heterogeneous networking environments. In Reference [113] Figure 6a clearly indicates that connection requests between nodes (1 ↔ 4), (1 ↔ 3), and (3 ↔ 5) can be established immediately because of channel availability. If a connection request arrives other than the above-mentioned requests, then it has to wait for a channel to be free which causes a delay or drop in the connection request.…”

Section: Congestion-aware Routing and Wavelength Assignmentmentioning

confidence: 99%

Disaster-Resilient Optical Network Survivability: A Comprehensive Survey

et al. 2018

View full text Add to dashboard Cite

Network survivability endeavors to ensure the uninterrupted provisioning of services by the network operators in case of a disaster event. Studies and news reports show that network failures caused by physical attacks and natural disasters have significant impacts on the optical networks. Such network failures may lead to a section of a network to cease to function, resulting in non-availability of services and may increase the congestion within the rest of the network. Therefore, fault tolerant and disaster-resilient optical networks have grasped the attention of the research community and have been a critical concern in network studies during the last decade. Several studies on protection and restoration techniques have been conducted to address the network component failures. This study reviews related previous research studies to critically discuss the issues regarding protection, restoration, cascading failures, disaster-based failures, and congestion-aware routing. We have also focused on the problem of simultaneous cascading failures (which may disturb the data traffic within a layer or disrupt the services at upper layers) along with their mitigating techniques, and disaster-aware network survivability. Since traffic floods and network congestion are pertinent problems, they have therefore been discussed in a separate section. In the end, we have highlighted some open issues in the disaster-resilient network survivability for research challenges and discussed them along with their possible solutions.

show abstract

Forward-Looking WDM Network Reconfiguration with Per-Link Congestion Control

Cited by 7 publications

References 38 publications

Stochastic RWA and Lightpath Rerouting in WDM Networks

Stochastic RWA and Lightpath Rerouting in WDM Networks

Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach

Disaster-Resilient Optical Network Survivability: A Comprehensive Survey

Contact Info

Product

Resources

About