Inter-domain Path Research Articles

A multi-population multi-tasking variable neighborhood search algorithm with diversity enhancements for inter-domain path computation problem

In recent years, as networks have become increasingly complex and expansive, network navigation faces new challenges in routing and resource utilization, particularly in the case of multi-domain networks. The Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU) problem is one of many such scenarios. The problem requires finding the shortest path in a multi-domain network, but it cannot visit any domain twice. Since this is a proven NP-Hard problem, it is reasonable to approach IDPC-NDU from a meta-heuristics perspective. By integrating the search prowess of Variable Neighborhood Search (VNS) with the meta-learning capabilities of Multi-population-based Multitasking (MM), this paper proposes a Multi-population multi-tasking VNS (MM-VNS) algorithm to solve the Inter-Domain Path Computation under Domain Uniqueness constraint (IDPC-DU). In this combination, VNS is used to exploit solution space while meta-learning maintains diversity by transferring knowledge. Numerous experiments performed indicate the proposed approach finds better solutions in comparison with the state-of-the-art metaheuristics in many cases.

Internet Inter-Domain Path Inferring: Methods, Applications, and Future Directions

Internet Inter-Domain Path Inferring: Methods, Applications, and Future Directions

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 Particle Swarm Optimization and Variable Neighborhood Search based multipopulation algorithm for Inter-Domain Path Computation problem

It is a common occurrence nowadays for a network to be gigantic in size and complex in architecture. Network navigation thus faces many new problems in terms of routing and resource utilization, one of which arises in multi-domain networks. This paper focuses on the Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU) problem, whose purpose is to find the shortest path between two nodes in a network under a constraint that such a path is only allowed to traverse each domain at most once. Considering that this is an NP-Hard problem, an approximate approach is more practical than an exact one. Meanwhile, Particles Swarm Optimization Algorithm (PSO) has been long known for its powerful ability to discover near-optimal solutions in a reasonable time; however, its application in discrete search space is limited. Therefore, we decide to use the multi-population framework, a sub-branch of multitasking optimization which allows information exchange not only between problems but also between different optimization heuristics, to improve upon the basic PSO method. Specifically, this paper introduces a hybridization between PSO and Variable Neighborhood Search (VNS). The encoding and decoding method are created specifically for the IDPC-NDU problem and for the PSO algorithm, and VNS serves to enhance further the algorithm’s ability to escape local optima. Experiments are carried out to prove the new algorithm’s efficacy, especially in the context of similar multitasking methods.

Adaptive Evolutionary Multitasking to Solve Inter-Domain Path Computation Under Node-Defined Domain Uniqueness Constraint: New Solution Encoding Scheme

In multi-domain networks, the efficiency of path computation becomes more and more important. The Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU) is a recently investigated problem where its objective is to determine the effective routing path between two nodes that traverses every domain at most once. IDPC-NDU is NP-Hard, so the approximation approaches are suitable to deal with this problem for large instances. Multifactorial Evolutionary Algorithm (MFEA) is an emerging research topic in the field of evolutionary computation that can efficiently tackle multiple optimization problems at the same time. This study proposed an approach based on the combination of the Adaptive Multifactorial Evolutionary Algorithm (dMFEA-II) and Dijkstra algorithm for solving IDPC-NDU. The encoding and evaluating methods based on the permutation representation are also introduced, and the new individual representation is always to produce valid solutions. The proposed algorithm is evaluated on two types of instances. Simulation results demonstrate the superior performance of the proposed algorithm in comparison with the existing algorithms in terms of the quality of the solution.

A Particle Swarm Optimization and Variable Neighborhood Search Based Multipopulation Algorithm for Inter-Domain Path Computation Problem

A Particle Swarm Optimization and Variable Neighborhood Search Based Multipopulation Algorithm for Inter-Domain Path Computation Problem

A research on hierarchical trackback technique for individual big data

In order to solve the privacy protection problem of individual big data, this paper proposes a hierarchical data trackback technique (HDTT). This technique can realise the data trackback through inter-domain and intra-domain path reconstruction without increasing the core network storage load. The main method is as follows: record the AS domain involved by data packets and IP address information with GBF data structure by use of idle part of packet header, determine the AS domain first with GBFAS data during the path reconstruction, and then determine the intra-domain router with GBFIP data to complete the data trackback. Finally, through the verification of Data Collect Treasure platform by project group, the contact ratio between inter-domain and intra-domain paths is up to over 98% and 92%, respectively, so HDTT technique can accurately reconstruct the data flow path, realise the data trackback and achieve the privacy protection of individual big data.

Horizontal-based orchestration for multi-domain SFC in SDN/NFV-enabled satellite/terrestrial networks

It's promising to use Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) to integrate satellite and terrestrial networks. To construct network service function chains in such a multi-domain environment, we propose a horizontal-based Multi-domain Service Function Chaining (Md-SFC) orchestration framework. In this framework, multi-domain orchestrators can coordinate with each other to guarantee the end-to-end service quality. Intra-domain orchestrators also coordinate SDN controllers and NFV management components to implement intra-domain service function chains. Based on this, we further propose a heuristic SFC mapping algorithm with a cooperative inter-domain path calculation method to map service function chains to infrastructures. In this method, master multi-domain orchestrator and intra-domain orchestrators coordinate to select proper inter-domain links. We compare the cooperative method with a naive uncooperative way that domains' topology information is provided to the master multi-domain orchestrator and it calculates the shortest inter-domain path between intra-domain service function chains directly. Simulation results demonstrate that our solution is feasible. It is able to construct end-to-end performance guaranteed service function chain by horizontal-based cooperation. The cooperative inter-domain path calculation method decreases the mapping load for the master orchestrator and gets the same end-to-end performance.

On-demand Interdomain Path Building Protocol

Ill structured interdomain routing protocol makes interdomain route selection uncontrollable. To solve this problem, an on-demand interdomain path building protocol(OIPBP) is proposed in this paper. The main characteristic of OIPBP is that routers can lay control over the path selection process of their downstream nodes and customize the routes according to their own requirements. In order to achieve this goal, we extend BGP by adding more policies options into routing advertisements, and the inserted policies can be referred by the intermediate nodes when selecting paths. We verify OIPBP has good performance by experiments.

Preventing Distributed Denial-of-Service Flooding Attacks With Dynamic Path Identifiers

In recent years, there are increasing interests in using path identifiers ( $\it PIDs$ ) as inter-domain routing objects. However, the $\it PIDs$ used in existing approaches are static, which makes it easy for attackers to launch the distributed denial-of-service (DDoS) flooding attacks. To address this issue, in this paper, we present the design, implementation, and evaluation of dynamic PID (D-PID), a framework that uses $\it PIDs$ negotiated between the neighboring domains as inter-domain routing objects. In D-PID, the $\it PID$ of an inter-domain path connecting the two domains is kept secret and changes dynamically. We describe in detail how neighboring domains negotiate $\it PIDs$ and how to maintain ongoing communications when $\it PIDs$ change. We build a 42-node prototype comprised of six domains to verify D-PID’s feasibility and conduct extensive simulations to evaluate its effectiveness and cost. The results from both simulations and experiments show that D-PID can effectively prevent DDoS attacks.

Inter-domain optical path provisioning with blocking avoidance by intra-domain immediate reroute-based semi-proactive hierarchical PCE

Optical fiber networks have become the foundations of communication system to provide enormous transmission capacity with less cost. Connection blocking is an inherent attribute and influences optical networks' performance, especially in multi-domain network scenarios. We analyze the reason and effect of blockings including routing blockings and signaling blockings. We regard the cause of signaling blockings as the information asynchronization in resource reservation process. We define the concept of Information Asynchronization Period to describe the effect of signaling blockings. To reduce signaling blockings in end-to-end optical path provisioning for multi-domain scenarios, we propose a novel network routing and control scheme, named Intra-Domain Immediate Reroute based Semi-Proactive Hierarchical Path Computation Element (IDIRSP H-PCE). The proposed routing and control scheme mainly consists of two parts, Semi-Proactive routing and Intra-Domain Immediate Reroute mechanism. Dynamic network simulations verify our proposed scheme. We compare the network performance with Reactive Backward Recursive PCE-based Computation (BRPC) based PCE, Reactive H-PCE and Proactive H-PCE. Simulation results indicate that IDIRSP H-PCE can provide connection with a very low blocking probability in light load case, which is close to Proactive H-PCE, and obviously better than BRPC based Reactive PCE and Reactive H-PCE. For heavy load case, IDIRSP H-PCE has a remarkably lower blocking probability than other three methods. Moreover, we test our proposed routing and control scheme when facing link faults. Simulation results indicate that IDIRSP H-PCE can greatly improve the traffic access rate and optimize the network performance.

Proactive H-PCE Architecture With BGP-LS Update for Multidomain Elastic Optical Networks [Invited

The hierarchical path computation element (H-PCE) architecture has been proposed to perform effective end-to-end path computation in multidomain elastic optical networks (EONs). In the H-PCE architecture a single parent PCE is responsible for inter-domain path computations, while a dedicated child PCE performs intra-domain path computations within each domain. In this scenario, effective inter-domain path computation is achieved only if detailed and updated intra-domain resource availability information is locally stored or retrievable by the parent PCE. Border Gateway Protocol has been recently extended to transport link state information (BGP-LS) that can be used to update the resource availability information at the parent PCE, thus improving scalability and effectiveness of the H-PCE architecture. Specifically, BGP-LS speakers located at each child PCE have been demonstrated to update the parent PCE with per-link spectrum slices availability information triggered by the reception of local Interior Gateway Protocol (IGP) advertisements. This paper proposes a proactive scheme to update the parent PCE, in which the generation of BGP-LS updating messages is not dependant on the IGP advertisements but automatically triggered by path computation requests at the child PCEs. The proposed scheme is applied during provisioning and restoration phases in a multidomain EON scenario and compared against two reference schemes. Simulation results show a significant reduction in terms of blocking probability and amount of exchanged control plane messages.

Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services

In this work, we propose utilizing the rich connectivity between IXPs and ISPs for inter-domain path stitching, supervised by centralized QoS brokers. In this context, we highlight a novel abstraction of the Internet topology, i.e., the inter-IXP multigraph composed of IXPs and paths crossing the domains of their shared member ISPs. This can potentially serve as a dense Internet-wide substrate for provisioning guaranteed end-to-end (e2e) services with high path diversity and global IPv4 address space reach. We thus map the IXP multigraph, evaluate its potential, and introduce a rich algorithmic framework for path stitching on such graph structures.

Multi-constrained path computation for inter-domain QoS-capable services

Computing inter-domain multiprotocol label switching traffic engineering label switched path MPLS-TE LSP through a pre-determined sequence of domains is quite straight as each path computation element PCE, using the backward recursive PCE-based computation BRPC, knows who is the next to be contacted in order to continue the computation. The optimality of the inter-domain MPLS-TE LSP path depends strongly on the choice of the pre-determined sequence of domains on which the calculation works. In this paper, we propose a novel procedure allowing a forward discovery of multiple inter-domain sequences and the computation of constrained inter-domain paths for MPLS-TE LSPs over these domains sequences. Other issues around the inter-domain path computation, such as route discovery and inter-domain loop avoidance, are investigated. Experimental evaluation shows that our solution is effective in terms of protocol and algorithmic efficiency and provides satisfiable performance with high success rate, reasonable message overhead and runtime.

PoiRoot

Interdomain path changes occur frequently. Because routing protocols expose insufficient information to reason about all changes, the general problem of identifying the root cause remains unsolved. In this work, we design and evaluate PoiRoot , a real-time system that allows a provider to accurately isolate the root cause (the network responsible) of path changes affecting its prefixes. First, we develop a new model describing path changes and use it to provably identify the set of all potentially responsible networks. Next, we develop a recursive algorithm that accurately isolates the root cause of any path change. We observe that the algorithm requires monitoring paths that are generally not visible using standard measurement tools. To address this limitation, we combine existing measurement tools in new ways to acquire path information required for isolating the root cause of a path change. We evaluate PoiRoot on path changes obtained through controlled Internet experiments, simulations, and "in-the-wild" measurements. We demonstrate that PoiRoot is highly accurate, works well even with partial information, and generally narrows down the root cause to a single network or two neighboring ones. On controlled experiments PoiRoot is 100% accurate, as opposed to prior work which is accurate only 61.7% of the time.

Interdomain wavelength path control for translucent wavelength switched optical networks: from rationales to experiments

A translucent wavelength switched optical network (WSON), with sparse 3R regenerators to guarantee the signal quality of an optical connection, is a promising paradigm for a metro/ core network. This is because a translucent WSON can achieve performance comparable to that of an all-electronic switching (i.e., opaque) network with far lower network cost and a great reduction in power consumption. Because of its advantages, many recent research and standardization efforts have focused on translucent WSONs. However, most of them study the intradomain case, and issues related to multidomain translucent WSONs are largely open at present. In light of this, in this article, we present two possible strategies to improve interdomain path computation and lightpath establishment in a multidomain translucent WSON. Both approaches are experimentally demonstrated and quantitatively evaluated. Our aim is to provide feasible and efficient solutions for supporting a multidomain translucent WSON, as well as to obtain valuable insight into the proposed strategies through experiments, which will be beneficial for the potential industrial deployment of translucent optical networks.

Parallel lightpath provisioning under wavelength continuity constraint in multi-domain optical networks based on hierarchical path computation element

Inter-domain path provision under a wavelength continuity constraint (WCC), including path computation and resource reservation procedures, is a major challenge in multi-domain wavelength division multiplexing (WDM) optical networks, because of the requirement for confidentiality between the domains. Based on the hierarchical path computation element (PCE) architecture, this work proposed a path establishment scheme under a WCC to provide a fast inter-domain path establishment solution and decrease the influence of the WCC. The hierarchical PCE architecture consists of a single parent PCE serving as the arbitrator and multiple child PCEs responsible for the child domains. By cooperation between the parent PCE and the child PCEs, both inter-domain path computation and inter-domain wavelength reservation can be processed in parallel to accelerate and optimize WCC lightpath provisioning and thus to reduce the blocking probability. The effectiveness of this solution has been evaluated through simulations. The simulation results show that the proposed solution can achieve lower computation and reservation delays and thus lead to lower blocking probabilities on the multi-domain WCC paths.

Efficient DoS-limiting Support by Indirect Mapping in Networks with Locator/Identifier Separation

Recent research in the designing of an elegant mapping service to map identifiers onto locators in networks with locator/identifier separation, focuses on solving practical issues related to mapping system. However, how to provide entire secure support in separation networks is still an open issue. In this paper, we present the design and evaluation of a hierarchical indirect mapping system (HIMS). It provides indirect mapping from connection identifier (CID), a novel flat identifier space introduced to stamp packets, to endpoint identifier (EID), can limit the impact of full range of destination attacks such as Denial of Service (DoS) floods from the outset by EID hidden, and fulfills the requirements such as low latency, efficient network utilization and scalability. Based on an efficient merging rule, HIMS build a hierarchical Chord architecture which can scale to Internet level by preserving the locality and convergence of the inter-domain path. We present scalability assessment and numerical results to demonstrate the performance gains of the proposed approach.

Path computation in multi-layer multi-domain networks: A language theoretic approach

Multi-layer networks are networks in which several protocols may coexist at different layers. The Pseudo-Wire architecture provides encapsulation and decapsulation functions of protocols over Packet-Switched Networks. In a multi-domain context, computing a path to support end-to-end services requires the consideration of encapsulation and decapsulation capabilities. It appears that graph models are not expressive enough to tackle this problem. In this paper, we propose a new model of heterogeneous networks using Automata Theory. A network is modeled as a Push-Down Automaton (PDA) which is able to capture the encapsulation and decapsulation capabilities, the PDA stack corresponding to the stack of encapsulated protocols. We provide polynomial algorithms that compute the shortest path either in hops or in the number of encapsulations and decapsulations along the inter-domain path, the later reducing manual configurations and possible loops in the path.

PCE-based fast path control in multi-domain photonic networks

We discuss issues for controlling an optical path in large-scale photonic networks, and introduce an inter-domain path control system based on Path Computation Elements (PCEs). In the system, maximum flow information enables the load balancing of traffic, and Path Key scheme preserve the confidentiality of internal topology information among carrier networks. Based on the experimental results, we show the path setup in the introduced system is significantly faster than the manual path setup among domains in current carriers' networks. For the additional reduction of the path setup time, we propose the domain-wise paralleled signaling method. We also show that decreasing the number of nodes per domain makes path setup faster in the introduced system with deployment of the proposed signaling method.