Routing In Multi-domain Networks Research Articles

Node-depth based Genetic Algorithm to solve Inter-Domain path computation problem

Inter-Domain Path Computation problem under Node-defined Domain Uniqueness Constraint (IDPC-NDU) is an NP-Hard problem that applies to packet routing in multi-domain networks, particularly Hierarchical Path Computation Element (h-PCE) architecture. Its objective is to determine the shortest route between two specified nodes that visit each domain no more than once. In recent years, many proposals have been made to tackle this problem and improve existing algorithms. However, most of these strategies retain a potential weakness that lies in the complex encoding and decoding methods, which consume a lot of computer resources and computation time, especially for large-scale problems. For this reason, this paper introduces an effective Node-depth based Genetic Algorithm (NDEGA) for IDPC-NDU. We propose a novel solution encoding for the problem by using tree representation that helps to satisfy the domain constraint and makes the corresponding solution construction more practical. Instead of conventional encoding techniques, NDEGA is equipped with an improved Node-depth encoding, which is famous for its low time complexity and efficiency for tree problems. Besides, a corresponding decoding method, as well as node-depth search operators, are also well-developed for the problem. To examine the efficiency of NDEGA, we carefully conduct extensive experiments and compare our approach to many competitive baselines on a wide range of synthetic datasets. The empirical results demonstrate that our proposed algorithm significantly outperforms all compared algorithms regarding solution quality, convergence trend, and computation time and obtains the state-of-the-art performance for IDPC-NDU. Notably, our NDEGA achieves 65.17−85.66% solution quality improvement on average compared to the previous approaches while running faster, approximately 50−70 times.

A novel Topology Aggregation approach for shared protection in multi-domain networks

Routing for shared protection in multi-domain networks is more difficult than that in single-domain networks because of the scalability requirements. We propose a novel approach for shared protection routing in multi-domain networks where the key feature is a special Topology Aggregation. In this Topology Aggregation, only some potential intra-domain paths (intra-paths for short) are selected for carrying working and backup traffic between domain border nodes. The abstraction of each intra-path to a virtual edge makes the original multi-domain network to become an aggregated network. On the aggregated network, a single-domain routing algorithm for shared protection can be applied for obtaining the complete routing solutions. The experiments show that the proposed approach is scalable. Moreover it is close to the optimal solution in single-domain networks and outperforms the previously proposed scalable solutions in multi-domain networks.

A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks

In this paper, we propose a novel differentiated domain protection (DDP) scheme to address survivability in multi-domain optical networks. Survivable routing in multi-domain networks is a challenging algorithmic problem because it requires choosing links that provide adequate protection both between domains and within domains that may offer different protection services. To satisfy the survivability requirements of different domains, DDP considers differentiated protection schemes, i.e., dedicated protection, shared protection, or no protection in different domains. In order to respect the principle of transparent management in multiple domains, DDP abstracts a multi-domain optical network to a virtual topology graph (VTG) for solving routing between domains. Simulation results show that DDP, unlike traditional schemes, can provide trade-off between protection methods and also allows better resource utilization.

Routing in multidomain networks

Investigates the problem of management and control in a large and, for simplicity, homogeneous packet-switched network. Specifically the authors focus on routing, an important function of network management. The network consists of several individually controlled domains. Domains are interconnected via gateway links. Each domain is controlled by its own network control center, while the overall network performance is managed by an integrated network control center. Each center has only a portion of the information required for global routing. The authors investigate the impact of the reduced information available at each center on network performance (average delay in the present case). They present a general approach to designing a hierarchical algorithm for routing in multidomain networks. They propose a heuristic procedure suitable for packet-switched networks. Several numerical examples illustrate the impact of incomplete information on the network. Performance is compared with a lower bound obtained, which is not differentiating destinations in other domains. Therefore, for this bound, each domain is perceived as a single node in a simplified model of the network.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>