Wavelength retuning without service interruption in an all‐optical survivable network

Hu, Rose Qingyang; Hu, Weiwei; Jin, Mingzhou; Qian, Yi

doi:10.1002/dac.995

Cited by 4 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Continuous service availability is the major concern of disaster-resilient all-optical networks. Hu et al in Reference [121] proposed a new WRT scheme without disrupting the network services to meet the continuity constraints of wavelength and services/data loss. Re-tuning is conducted only on the backup/alternate path in case of failure of the primary path that carries the traffic under normal conditions.…”

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

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

show abstract

“…Hu et al propose a wavelength retuning (WRT) scheme for transparent WDM networks. Their strategy consists of using two routes, one for an active path and another for a backup path, in order to avoid service disruption or data loss.…”

Section: Related Workmentioning

confidence: 99%

Lightpath admission control and rerouting in dynamic flex‐grid optical transport networks

2016

View full text Add to dashboard Cite

In dynamic flex‐grid optical transport networks, Lightpath Admission Control (LAC) is the task of finding a Routing and Spectrum Assignment (RSA) solution for a current lightpath request; otherwise, the request is blocked if there are not enough free available resources. When rerouting is supported, one or more currently established lightpaths can be rerouted and/or assigned with a different spectrum in order to accommodate the current lightpath request. We propose LAC methods based on mixed integer linear programming that provide a RSA solution for the current request aiming to maximize the acceptance probability of future lightpath requests. When rerouting is supported, we consider that only one currently established lightpath can be rerouted. We compare the proposed methods with the traditional shortest path‐based approach through simulation. Without lightpath rerouting, the blocking probability is significantly improved. With lightpath rerouting, the number of rerouting operations is significantly decreased while the blocking probability is marginally improved. Moreover, the blocking fairness between lightpaths with different spectrum widths is improved both with and without lightpath rerouting. In all cases, the CPU times of the mixed integer linear programming approaches are a few seconds, on average. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 151–163 2017

show abstract

“…Motivated by the aforementioned observations, we would like to choose the paths with low overlap possibility. Traditional k ‐edge‐disjoint paths algorithm is widely used in the network failure recovery field . Its basic idea is as follows: find the shortest or widest path, remove the links on the path from the network, and then find the next shortest or widest path in the remaining network.…”

Section: K‐disjoint Path Selection Algorithm For Multiple Bulk Transfersmentioning

confidence: 99%

Efficient algorithms for scheduling multiple bulk data transfers in inter‐datacenter networks

Sen

Wang

Jiang

et al. 2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYBulk data transfers, such as backups and propagation of bulky updates, account for a large portion of the inter-datacenter traffic. These bulk transfers consume massive bandwidth and further increase the operational cost of datacenters. The advent of store-and-forward transfer mode offers the opportunity for cloud provider companies to transfer bulk data by utilizing dynamic leftover bandwidth resources. In this paper, we study the multiple bulk data transfers scheduling problem in inter-datacenter networks with dynamic link capacities. To improve the network utilization while guaranteeing fairness among requests, we employ the max-min fairness and aim at computing the lexicographically maximized solution. Leveraging the timeexpanded technique, the problem in dynamic networks is formulated as a static multi-flow model. Then, we devise an optimal algorithm to solve it simultaneously from routing assignments and bandwidth allocation. To further reduce the computational cost, we propose to select an appropriate number of disjoint paths for each request. Extensive simulations are conducted on a real datacenter topology and prove that (i) benefiting from max-min fairness, the network utilization is significantly improved while honoring each individual performance; (ii) a small number of disjoint paths per request are sufficient to obtain the near optimal allocation within practical execution time.

show abstract

Wavelength retuning without service interruption in an all‐optical survivable network

Cited by 4 publications

References 11 publications

Disaster-Resilient Optical Network Survivability: A Comprehensive Survey

Disaster-Resilient Optical Network Survivability: A Comprehensive Survey

Lightpath admission control and rerouting in dynamic flex‐grid optical transport networks

Efficient algorithms for scheduling multiple bulk data transfers in inter‐datacenter networks

Contact Info

Product

Resources

About