Research On Virtual Routing Communication Security Based On Complex Network Theory

With the manifold means of information acquisition and transmission, as well as data storage and sharing, the complex and concomitant heterogeneous communication network with varied types of business coexisting emerges. Software-defined idea separates the control protocol of edge gateway; in addition, the method improves the ability of data cross-domain transmission in heterogeneous network by simplifying protocol stack structure. As physical resources uniformly encapsulate in software-defined network (SDN), the heterogeneity of physical entities is blocked. However, with the proliferation of network elements and the upgrading of topology complexity, the flat network architecture has some potential safety problems. The fault-tolerant malfunction, such as equipment aging, heavy load and channel interference etc, will reduce the robustness of network. In addition, the targeted malfunction of network DoS attacking and wireless spectrum suppressing will increase network vulnerability. The safety problems mentioned above are closely related to network topology characteristics, furthermore, the integration of wireless access network makes it even more contradictory. In this paper, we focus on how to research on the safety problems caused by the topology scale in heterogeneous scenario.In this paper, we take virtual routing communication technology of heterogeneous network as the research object. The robustness and invulnerability of both core network and wireless access network are analyzed respectively through constructing network virtual resource management framework. Moreover, we design an efficient, robust and invulnerable virtual mapping algorithm, which is theoretical exploration and algorithm validation of the communication security problem of virtual routing. The main works of this paper are as follows:1. In view of the influence of mobile terminal addressing and channel quality of wireless access network on virtual bandwidth request, we propose forwarding engine and controller, which guide the user traffic in a logic centralized way, as well as design a scheme that decouple building base band unit (BBU) and radio remote unit (RRU). The wireless access network modeling includes path loss model, channel interference, spectrum allocation and bandwidth calculation. We analyze the constraints of wireless access network after expanding the range of network scenarios. On the basis of the virtual resource structure, we describe the formalization of virtual network mapping. The abstraction of wireless virtual resource and the virtual mapping scheme of core network resource provide the design of fault-tolerant, highly effective and the invulnerable network with logical basis.2. To solve virtual network fault-tolerant problem, which caused by multiple virtual networks sharing infrastructure and random failure of physical nodes and links, we propose a virtual routing communication algorithm with high robustness that improves the security of virtual network. We firstly model the network towards topological difference of random failure and analyze the problem and solution. Secondly, to improve the network robustness, we analyze the issues of connectivity decision and random failure of stochastic network, scale-free network and wireless access network respectively based on percolation theory. At last, we propose a robustness algorithm of virtual network mapping based on minimum cutest. The simulation shows the improved algorithm has higher rate of virtual request and lower occupancy rate, in the condition of high node pressure and high failure rate of fault-tolerant.3. Aiming at solving the problem of traffic redirecting caused by node or link failure of "key" position, we propose a flow equalization scheme to improve the invulnerability of network. In the aspect of theoretical analysis, network heterogeneity index is extracted to extend the influence of matching attributes on invulnerability to directed weighted network. Accordingly, we analyze the relationship between theoretical limit and topological degree of invulnerability. In the aspect of algorithm design, largest connected component can be regarded as a measure of fault tolerance of the network, which can facilitate us to analyze the varied strategies adopted by deliberate attacks. According to the breadth and accuracy of information the attackers own, we construct an attack model of variable information and design a judgement and option scheme of link matching attribute in virtual mapping scenario. The simulation shows the improved algorithm has higher rate of virtual request and lower occupancy rate, in the condition of high node pressure and incremental deliberate attack information.