On minimizing coding operations in network coding based multicast: an evolutionary algorithm

In telecommunications networks, to enable a valid data transmission based on network coding, any intermediate node within a given network is allowed, if necessary, to perform coding operations. The more coding operations needed, the more coding resources consumed and thus the more computational overhead and transmission delay incurred. This paper investigates an efficient evolutionary algorithm to minimize the amount of coding operations required in network coding based multicast. Based on genetic algorithms, we adapt two extensions in the proposed evolutionary algorithm, namely a new crossover operator and a neighbourhood search operator, to effectively solve the highly complex problem being concerned. The new crossover is based on logic OR operations to each pair of selected parent individuals, and the resulting offspring are more likely to become feasible. The aim of this operator is to intensify the search in regions with plenty of feasible individuals. The neighbourhood search consists of two moves which are based on greedy link removal and path reconstruction, respectively. Due to the specific problem feature, it is possible that each feasible individual corresponds to a number of, rather than a single, valid network coding based routing subgraphs. The neighbourhood search is applied to each feasible individual to find a better routing subgraph that consumes less coding resource. This operator not only improves solution quality but also accelerates the convergence. Experiments have been carried out on a number of fixed and randomly generated benchmark networks. The results demonstrate that with the two extensions, our evolutionary algorithm is effective and outperforms a number of state-of-the-art algorithms in terms of the ability of finding optimal solutions

Time-aware deterministic bandwidth allocation scheme for industrial TDM-PO

Abstract For Industrial Internet with TDM-PON, we propose a time-aware deterministic bandwidth allocation (TA-DBA) scheme that allocates proper transmission windows based on flow arrival time and cycle. Simulation results show that TA-DBA can achieve deterministic transmission, and the average bandwidth efficiency is 20.4% higher than FBA

Probabilistic-assured resource provisioning with customizable hybrid isolation for vertical industrial slicing

Abstract With the increasing demand of network slices in vertical industries, slice resource provisioning in transport networks has encountered two challenges, one is efficient slice resource provisioning in the presence of traffic uncertainty of slices, and another is flexible slice resource isolation for customizable isolation needs. In this paper, we propose an innovative flexible hybrid isolation model to support any customized resource isolation from complete isolation to full sharing, and solve the slice resource provisioning problem named Hybrid Slicing Minimum Bandwidth (HSMB) by considering traffic prediction error to mitigate the negative impact of traffic uncertainty in the proposed model. After analyzing the HSMB problem, 1) we first try to solve the problem in steps and decompose the HSMB problem into grouping sub-problem and adjusting sub-problem, 2) we then propose a low-complexity dynamic programming grouping algorithm and a fast iterative adjustment algorithm for the two sub-problems based on probabilistic feature-based analysis, 3) we combine the algorithms of the two sub-problems and further propose a linking algorithm for the potential insufficient resource dilemma and high computational complexity dilemma to improve the efficiency of the solution. The numerical results show that the proposed flexible hybrid isolation model with different factors can facilitate flexible slice isolation with customized isolation demands, while the proposed algorithm can realize efficient slice resource provisioning with a probabilistic guarantee. The comparison result shows the proposed algorithms outperform the other benchmark algorithms

DeepDefrag:spatio-temporal defragmentation of time-varying virtual networks in computing power network based on model-assisted reinforcement learning

Abstract We propose DeepDefrag, a model-assisted reinforcement learning for spatio-temporal defragmentation of time-varying virtual networks in a cross-layer optical network testbed, which realizes the efficient utilization of computing nodes and lightpaths by co-optimizing scheduling and embedding with fragment matching, reduces >13.5% cost of computing power network

Suspect fault screening assisted graph aggregation network for intra-/inter-node failure localization in ROADM-based optical networks

Abstract We propose a suspect fault screening assisted graph aggregation network for intra-/inter-node failure localization in ROADM-based optical networks, which is validated in both simulated topology and testbed. Results show that it achieves satisfactory accuracy under different percentage of OPMs and the number of service requests