Survivability issues in single- and multi-domain optical networks.
详细信息
文摘
Optical networks have been widely deployed due to their high speed in transmitting enormous amount of data. Survivability has been a major issue in optical networks due to the huge loss of data and revenue when failures occur. In addition to traditional single-domain networks, where a single administrator manages the entire network with full knowledge of network resources, multi-domain networks appear to become more scalable and manageable. In this work, we focus on the survivability issues in both single- and multi-domain optical networks. Several problems have been investigated with the objective of either minimizing total network cost while guaranteeing survivability, or minimizing the failure probability of connections when both working and backup paths disconnect at the same time. First, we study the problem of survivable impairment-aware routing in traditional single-domain optical networks, where each connection is protected end to end by provisioning bandwidth along a sequence of lightpaths through either dedicated or shared connection-level protection. The objective is to minimize the total network cost in terms of network equipment used for establishing lightpaths. Next, we study the problem of maximizing survivability in multi-domain optical networks, where each domain advertises an aggregated topology that abstracts the detailed information. The objective is to design a way to construct the aggregated topology by taking into account the distribution of Shared Risk Link Group SRLG) that includes a set of links affected by a single failure, in order to maximize the SRLG-disjointness between two paths of a connection for maximal survivability. We then study the problem of domain-disjoint routing in multi-domain networks, where a connection has to find two domain-disjoint paths in order to survive the failure when intra-domain disjointness is unknown, or the entire domain is affected by some natural disasters. The problem is to find such pair of domain-disjoint paths for each connection while minimizing the total incurred link cost. Finally, we investigate the problem of survivable multi-domain routing when certain amount of intra-domain disjointness information is provided. With the assistance of the disjointness information, a pair of link-disjoint inter-domain paths with minimum total cost can then be obtained for each connection.