SDN-oriented data center network maximum probability path flow scheduling method and device
A technology of data center network and maximum probability, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve the problem of insufficient consideration of the remaining bandwidth of the link of the flow bandwidth requirement, can not well achieve global dynamic load balancing, no Fully consider bandwidth usage and other issues to achieve the effect of reducing network congestion, alleviating network congestion, and easy implementation
Active Publication Date: 2019-06-07
NAT UNIV OF DEFENSE TECH
View PDF5 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
This algorithm does not fully consider the bandwidth usage of all paths that meet the flow bandwidth requirements, and may lead to fragmentation of the remaining bandwidth of the link, so it cannot achieve global dynamic load balancing well
[0011] The problems existing in the above-mentioned existing flow scheduling algorithms are: 1) the demand for flow bandwidth and the remaining bandwidth of the link are not fully considered; 2) the problem of flow scheduling is not considered in the long-term overall, and the flow scheduling cannot be reasonably used for multi-path; 3) flow scheduling exists Link Bandwidth Fragmentation Problem
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0039] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.
[0040] In the technical field of the present invention, a network link refers to a connection path between any connected nodes in the network, which is called a network link or link, such as a link between two switches or a link between a switch and an end host. Link, the letter L can be used to represent a network link. A network path refers to the path from the source node to the destination node in the network, which is called a network path or path. A network path may contain one or more links, and the letter P can be used to represent a network path. The bandwidth ratio refers to the ratio of the link remaining bandwidth to the flow bandwidth, which is called the bandwidth ratio, and the bandwidth ratio can be represented by the letter p. The path probability refers to the probability that a path that satisfies the flow bandwidt...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses a method and device for scheduling a maximum probability path flow in an SDN data center network. The steps of the method are: S1: obtain flow related information through a switch; S2: judge the flow to determine whether it is an elephant flow, if It is not an elephant flow. According to the flow information and the global topology information maintained by the controller, the optional path of the flow is obtained, and then a path is arbitrarily selected for it; if the flow F is judged to be an elephant flow, the probability path algorithm is selected to calculate a path for it A path that satisfies the flow bandwidth requirements; S3: After selecting a path for flow F, send the flow entry to the switch, and after flow F matches the flow entry, perform data forwarding according to the action or match the remaining data of flow F to the new flow entry to retweet. The device is used to implement the above method. The invention has the advantages of simple principle, wide application range, easy realization, ability to reduce network congestion and achieve balanced network effect, and the like.
Description
technical field [0001] The present invention mainly relates to the technical field of data center network, in particular to a maximum probability path flow scheduling method and device for SDN data center network. Background technique [0002] The ever-increasing data center network scale and business requirements pose severe challenges to data center network load balancing, and the emergence of a new network architecture based on SDN brings new ideas and opportunities to load balancing research. The controller in the SDN network can obtain the topology, nodes, links, and flow information of the global network, and then can perform centralized control and scheduling on the network flow. The decoupling and separation of the SDN network control plane and forwarding plane realizes the abstraction and high-speed forwarding of the underlying switch resources, and the northbound interface provided by the controller can facilitate developers to develop new functions and research in...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/803H04L29/08
CPCH04L47/125H04L67/1001
Inventor 陈琳张富强黄杰邓文平郦苏丹
Owner NAT UNIV OF DEFENSE TECH