A Scalable Path Control Method Based on Graph Coloring in Software Defined Networks

Abstract

The present invention proposes a scalable path control method based on graph coloring in a software-defined network. The method is based on source routing, inspired by the XPath method, and adopts a path ID-based path control strategy. However, in the aggregation flow table When using wildcards to aggregate path IDs sharing the same link, the problem of path ID allocation is decomposed into link ID allocation, and based on the graph vertex coloring model, under the premise of using fewer flow entries to ensure the scalability of SDN, Solving the problem of efficient assignment of path IDs in software-defined networks.

Description

technical field [0001] The invention relates to the technical field of network communication, in particular to the problem of limited flow table space and dynamic path setting time delay in a software-defined network. Background technique [0002] In a traditional TCP / IP-based network, switching devices integrate the logic control and data forwarding functions of the network. Switching devices learn network information and maintain forwarding logic strategies through distributed routing protocols (such as RIP, BGP, and OSPF, etc.). Traditional network management and upgrades require software configuration or firmware upgrades for all devices in the network. Network management is extremely complex, and it is extremely difficult to implement network upgrades or network innovations. With the development of the mobile Internet and the enrichment of various network services, the traditional network has become an obstacle to the further development and upgrade of the network, and ...

AI Technical Summary

Problems solved by technology

[0004] In OpenFlow-based SDN, data flows are identified by source and destination addresses, and the controller needs to install forwarding rules for all switches in the transmission path of each flow. This fine-grained forwarding strategy can realize active path control. It is beneficial to load balancing, bandwidth guarantee and fast fault recovery, etc., but there are still two problems of scalability and stability:

[0015] However, in the above-mentioned solutions, there are some problems: the flow entry caching method will introduce additional processing delay when the flow entry is cached in the SDN controller or software, and the impact on delay-sensitive traffic is particularly serious

The CONGA scheme depends on the specific topology and is difficult to apply to multi-layer and complex networks

XPath only reduces the number of flow entries through prefix aggregation, and for networks with asymmetric topologies, the computational complexity of XPath is particularly high

Images