Survivable Cloud Network Mapping for Disaster Recovery Support

Network virtualization is a key provision for improving the scalability and reliability of cloud computing services. In recent years, various mapping schemes have been developed to reserve VN resources over substrate networks. However, many cloud providers are very concerned about improving service reliability under catastrophic disaster conditions yielding multiple system failures. To address this challenge, this work presents a novel failure region-disjoint VN mapping scheme to improve VN mapping survivability. The problem is first formulated as a mixed integer linear programming problem and then two heuristic solutions are proposed to compute a pair of failure region-disjoint VN mappings. The solution also takes into account mapping costs and load balancing concerns to help improve resource efficiencies. The schemes are then analyzed in detail for a variety of networks and their overall performances compared to some existing survivable VN mapping scheme

Design and operation of mesh-restorable WDM networks

The explosive growth of Web-related services over the Internet is bringing millions of new users online, thus creating a growing demand for bandwidth. Wavelength Division Multiplexed (WDM) networks, employing wavelength routing has emerged as the dominant technology to satisfy this growing demand for bandwidth. As the amount of traffic carried is larger, any single failure can be catastrophic. Survivability becomes indispensable in such networks. Therefore, it is imperative to design networks that can quickly and efficiently recover from failures.;In this dissertation, we explore the design and operation of survivable optical networks. We study several survivability paradigms for surviving single link failures. A restoration model is developed based on a combination of these paradigms. We propose an optimal design and upgrade scheme for WDM backbone networks. We formulate an integer programming-based design problem to minimize the total facility cost. This framework provides a cost effective way of upgrading the network by identifying how much resources to budget at each stage of network evolution. This results in significant cost reductions for the network service provider.;As part of network operation, we capture multiple operational phases in survivable network operation as a single integer programming formulation. This common framework incorporates service disruption and includes a service differentiation model based on lightpath protection. However, the complexity of the optimization problem makes the formulation applicable only for network provisioning and o2ine reconfiguration. The direct use of such methods for online reconfiguration remains limited to small networks with few tens of wavelengths. We develop a heuristic algorithm based on LP relaxation technique for fast, near optimal, online reconfiguration. Since the ILP variables are relaxed, we provide a way to derive a feasible solution from the relaxed problem. Most of the current approaches assume centralized information. They do not scale well as they rely on per-flow information. This motivates the need for developing dynamic algorithms based on partial information. The partial information we use can be easily obtained from traffic engineering extensions to routing protocols. Finally, the performance of partial information routing algorithms is compared through simulation studies

Scatter search based met heuristic for robust optimization of the deploying of "DWDM" technology on optical networks with survivability

In this paper we discuss the application of a met heuristic approach based on the Scatter Search to deal with robust optimization of the planning problem in the deploying of the Dense Wavelength Division Multiplexing (DWDM) technology on an existing optical fiber network taking into account, in addition to the forecasted demands, the uncertainty in the survivability requirements

Managerial decisions to recover from Covid-19 disruption: A multi-objective optimization approach applied to public transport operators

The resilience of transport systems, facing natural or man-made disruptions, has been widely discussed in literature in terms of recovery capabilities concerning infrastructures, suggesting solutions to provide users an acceptable level of service along the interrupted network. However, in the context of the Covid-19 outbreak, the disruption has stressed the resilience of transport systems not on the supply side but rather at organizational level for transport service providers. Indeed, the sudden and drastic decrease in users due to the restrictions imposed by governments to limit the pandemic spread has implicated severe economic consequences in the running of transport companies. In this paper, attention has been focused on the public transport sector to analyse the effects of different initiatives, which companies could undertake in response to the demand shock caused by the Covid-19 emergency. Notably, an optimization procedure has been developed with the aim of determining feasible Pareto-front solutions, which correspond to trade-off conditions for the concurrent maximization of the company profit and the minimization of outsourcing services. The time span necessary to implement the examined recovery measures has been considered together with the limitation to appropriate threshold values for the main cost and income items influencing the company operations management. The proposed approach has been applied to the case study of an Italian public transport company to appraise different post-Covid-19 resilience strategies

Fundamental schemes to determine disjoint paths for multiple failure scenarios

Disjoint path routing approaches can be used to cope with multiple failure cenarios. This can be achieved using a set of k (k>2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links in any single SRLG. Paths traversing disaster-prone regions should be disjoint, but in safe regions it may be acceptable for the paths to share links or even nodes for a quicker recovery. Auxiliary algorithms for obtaining the shortest path from a source to a destination are also presented in detail, followed by the illustrated description of Bhandari’s and Suurballe’s algorithms for obtaining a pair of paths of minimal total additive cost. These algorithms are instrumental for some of the presented schemes to determine disjoint paths for multiple failure scenarios.info:eu-repo/semantics/publishedVersio