2019 Scientific Conference on Network, Power Systems and Computing
RSA algorithm of EON based on coloring theory
Bingsen Xia, Duanyun Chen, and Yuanchun Tang
Traditional wavelength division multiplexing networks use fixed grids to meet the needs of today's rapidly evolving networks. The elastic optical network with OFDM as the core can divide the spectrum resources into finer granularity, thereby improving the utilization of network resources and reducing the bandwidth blocking rate in the network. this paper considers risk avoidance to improve the elastic optical network routing and wavelength assignment algorithm based on spectrum coloring theory: First, define the network The routing risk coefficient, starting from the power communication service flow, analyzes the resource status of nodes and links, and establishes a route optimization model. Secondly, based on the characteristics of power communication network, based on the graph coloring theory and considering the spectrum fragmentation problem, the risk equilibrium model is designed. Finally, the joint transfer hops and the network risk value are jointly balanced, and a mixed integer linear programming model of the RSA problem with the minimum transfer hop and the lowest risk balance is jointly established. The spectrum is based on the coloring number. Equally divided blocks, the spectrum is allocated by block. The simulation results show that compared with the typical algorithm, the proposed algorithm alleviates the problem of uneven distribution of risk and spectrum fragmentation in the power communication network in the prior art, and comprehensively considers routing and spectrum, and balances the number of hops. Balance the risk with the effect of improving resource utilization.
Elastic optical network, coloring theory, risk balance
Cite this paper:
Bingsen Xia, Duanyun Chen, and Yuanchun Tang, RSA algorithm of EON based on coloring theory. 2019 Scientific Conference on Network, Power Systems and Computing (NPSC 2019), 2019: 55-59. DOI: https://doi.org/10.33969/EECS.V3.013.