An overview of algorithms for network survivability

FA Kuipers - International Scholarly Research Notices, 2012 - Wiley Online Library
Network survivability—the ability to maintain operation when one or a few network
components fail—is indispensable for present‐day networks. In this paper, we characterize …

Reliable virtual machine placement and routing in clouds

S Yang, P Wieder, R Yahyapour… - … on Parallel and …, 2017 - ieeexplore.ieee.org
In current cloud computing systems, when leveraging virtualization technology, the
customer's requested data computing or storing service is accommodated by a set of …

Geodiverse routing with path delay and skew requirement under area‐based challenges

Y Cheng, D Medhi, JPG Sterbenz - Networks, 2015 - Wiley Online Library
With the increasing frequency of natural disasters and intentional attacks that challenge
communication networks, vulnerability to cascading, and regional‐correlated challenges is …

Traffic-aware and reliability-guaranteed virtual machine placement optimization in cloud datacenters

X Liu, B Cheng, Y Yue, M Wang, B Li… - 2019 IEEE 12th …, 2019 - ieeexplore.ieee.org
With the increasing scale of cloud datacenters and rapid development of virtualization
technologies, many cloud-based services have been deployed to meet requirements. Virtual …

[PDF][PDF] Combinatorial optimization in networks with shared risk link groups

D Coudert, S Pérennes, H Rivano… - Discrete Mathematics …, 2016 - dmtcs.episciences.org
The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of
links of a network may fail simultaneously. The theory of survivable network design relies on …

[HTML][HTML] Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience

DYC Chan, D Kirkpatrick - Theoretical Computer Science, 2014 - Elsevier
Let G be a graph with zero or more colours assigned to its vertices, and let vs and vt be two
vertices of G. The minimum-colour path problem is to determine the minimum over all vs–vt …

Detection of spatially-close fiber segments in optical networks

F Iqbal, S Trajanovski, F Kuipers - 2016 12th International …, 2016 - ieeexplore.ieee.org
Spatially-close network fibers have a significant chance of failing simultaneously in the event
of man-made or natural disasters within their geographic area. Network operators are …

MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization

MJ Rostami, AAE Zarandi, SM Hoseininasab - Journal of Network and …, 2012 - Elsevier
Failure resilience is a desired feature in communication networks, and different methods can
be considered in order to achieve this feature. One of these methods is diverse Routing. In …

Divide and conquer for fast SRLG disjoint routing

K Xie, H Tao, X Wang, G Xie, J Wen… - 2018 48th Annual …, 2018 - ieeexplore.ieee.org
Ensuring transmission survivability is a crucial problem for high-speed networks. Path
protection is a fast and capacity-efficient approach for increasing the availability of end to …

SRLG-diverse routing with the star property

JC Bermond, D Coudert, G d'Angelo… - 2013 9th International …, 2013 - ieeexplore.ieee.org
The notion of Shared Risk Link Groups (SRLG) has been introduced to capture survivability
issues where some links of a network fail simultaneously. In this context, the diverse routing …