Openflow-based network highly-fault-tolerant virtual network mapping algorithm

Abstract

The invention relates to an Openflow-based network highly-fault-tolerant virtual network mapping algorithm comprising: a SDN control layer acquires low-layer network equipment load information supporting an Openflow protocol in real time and dynamically updating the network equipment load information; acquiring the data of a request for establishing a virtual network by analysis of the demands of different application services in an application layer, and computing a virtual network satisfying a mapping requirement according to an ant colony algorithm; and deploying the virtual network in low-layer network equipment by using the control layer in order to satisfy an individual requirement. The mapping algorithm improves the fault-tolerant capability and the failure recovery capability of the virtual network, guarantees QoS, and improves network robustness.

Description

technical field [0001] The invention relates to a network mapping algorithm, in particular to a high fault-tolerant virtual network mapping algorithm based on Openflow network. Background technique [0002] Network virtualization is a core component of the next-generation Internet architecture. It abstracts the underlying infrastructure and provides a unified programmable interface to simultaneously map multiple virtual networks that are isolated from each other and have different topologies to a common infrastructure. , to provide users with differentiated services. Network virtualization makes it possible to deploy new network architectures, protocols, and applications without affecting existing networks, thereby effectively supporting network technology innovation. SDN (Software Defined Networks) based on the Openflow protocol is an application of network virtualization technology. In the SDN network, the control plane and the data plane are separated from each other, a...

AI Technical Summary

Problems solved by technology

[0005] The existing virtual network mapping algorithm has a greedy mapping algorithm, which preempts the underlying resources, which will cause excessive local link load, and many idle links will not be fully utilized, resulting in a waste of resources, and at the same time make the virtual network requests arriving later cannot be satisfied

There are also some improved algorithms, such as virtual network mapping algorithms for load balancing, virtual network mapping algorithms based on traffic constraints, etc. These mapping algorithms have improved a certain aspect of the network, but they all have the problem of low resource utilization

[0006] 2. Poor network fault tolerance performance

However, the price paid at the same time is low resource utilization, especially the bandwidth resource of each link is limited, a link may be used as a backup link for multiple services at the same time, but these services do not fail at the same time, that is, when the After the resources reserved by these services reach the maximum value of the link, the link will no longer be used as a backup link for other services, which leads to low utilization of the link as a backup link

Images