Routing algorithm of guaranteeing QoS in data center network based on SDN

Abstract

The invention discloses a routing algorithm of guaranteeing QoS (quality of service) in a data center network based on SDN. Aiming at problems that user terminal transmission time delay is high and a link congestion is generated in the data center network, the routing algorithm of guaranteeing QoS in the data center network is provided. In the algorithm, priority classification is performed on a data flow arriving at a switch so that a high priority data flow which is sensitive to the time delay adopts a time delay guarantee algorithm; a path with minimum data plane time delay is found to carry out flow table issuing; for a low priority data flow which has a high requirement to a bandwidth, a bandwidth guarantee algorithm is adopted; and according to a demand of the data flow for the bandwidth, dynamic bandwidth adjusting is performed. The QoS of a user is effectively guaranteed and a resource utilization rate in the data center network is increased.

Description

technical field [0001] The invention relates to the technical field of communication networks, and relates to a routing algorithm for guaranteeing QOS in an SDN-based data center network. Background technique [0002] With the increasing demands of various services on the Internet, the Internet has obvious defects in the ability to guarantee user QoS (Quality of Service, service quality). In the traditional data center network, due to the complex overall structure and saturated equipment performance, it is difficult to meet the current QoS requirements of different new services, and the network traffic under emerging services is more complex than the traditional data center network traffic. At the same time, there are many Frequent communication between nodes may lead to network congestion, underutilization of network bandwidth, longer delays between end users, etc., resulting in overall performance degradation. Therefore, how to use the current network resources to guarant...

AI Technical Summary

Problems solved by technology

[0005] Literature [Ishimori A, Farias F, Cerqueira E, et al.Control of multiple packets schedulers for improving QoS on OpenFlow / SDN networking[C] / / Proc of the 2nd European workshop on Software Defined Networks.Berlin:IEEE Press,2013:81- 86.] proposed a queue-based QoS scheduling strategy on the SDN architecture, but did not perform QoS routing for data flows of different priorities; literature [Bueno I, Aznar J I, Escalona E, et al.An opennaas based SDN framework for dynamic QoS control[C] / / Proc of IEEE SDN for Future Networks and Services.[S.l.]:IEEE Press,2013:1-7.] proposes a QoS policy automatic configuration framework on the SDN architecture, but this framework is only for different data flows Tomovic S and others in the literature [SDN control framework for QoS provisioning[C] / / Proc of the 22nd Telecommunications Forum[S.l.]:IEEE Press,2014 :111-114.] The algorithm proposed in the lack of fine division of flow, can not achieve fine-grained data flow guarantee; while the literature [Egilmez H E, Dane S T, Gorkemli B, et al. OpenQoS: an OpenFlow controller design for multimedia delivery with end -to-end quality of service over software-defined networks[C] / / Proc of Asia-Pacific Signal&Information Processing Association AnnualSummit and Conference.[S.l.]:IEEE Press,2012:22-27.] Design guarantees for specific flows QoS routing algorithm and other GFF (matching priority) algorithms that guarantee QoS policies method, but the scalability of the algorithm is too poor

Song Jianwei proposed a queue-based algorithm to guarantee QoS in the literature [Research on QoS Queue Algorithm Based on DiffServ Network [D]. Chengdu: University of Electronic Science and Technology of China, 2014.], but it was only verified on the theoretical model and not in practice. Test its performance in the network

Images