CN105915467A - Data center network flow balancing method and device oriented to software definition - Google Patents
Data center network flow balancing method and device oriented to software definition Download PDFInfo
- Publication number
- CN105915467A CN105915467A CN201610326176.5A CN201610326176A CN105915467A CN 105915467 A CN105915467 A CN 105915467A CN 201610326176 A CN201610326176 A CN 201610326176A CN 105915467 A CN105915467 A CN 105915467A
- Authority
- CN
- China
- Prior art keywords
- stream
- packet
- big
- switch
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a data center network flow balancing method and a data center network flow balancing device oriented to software definition. The data center network flow balancing method comprises the steps that: a controller receives a data packet transmitted by a switch, matches feature fields of the data packet with fields in a flow table, and records actions of the data packet in an action set of the flow table according to a preset action priority; a corresponding operation is carried out on the data packet according to the action sequence in the action set if the feature fields of the data packet are successfully matched with the fields in the flow table; and whether a time slot field of the data packet is matched with a transmission time slot value in the flow table is judged if the corresponding operation is pretreatment forwarding, if so, then the data packet is forwarded, and if not, the data packet is cached to a next time slot for forwarding. The data center network flow balancing method and the data center network flow balancing device simplify deployment, enhance network expandability, and solve the problems of data flow packet loss during the strategy implementation process and disorder of data packets which may occur at a receiving end.
Description
Technical field
The present invention relates to data center network flow techniques field, be specifically related to a kind of software-oriented
The data center network flow equalization method of definition and device.
Background technology
The traffic engineering of data center network is an important directions of current network research, due to
Data center network belongs to single operator to be owned, it is simple to the unified plan of traffic engineering, natural
Meet the concentration required for software defined network (Software Defined Network, SDN)
Control requirement.Meanwhile, data center network is generally of symmetrical topological structure and makes node pair
Between there is substantial amounts of redundant link, use multi-path transmission can improve single path route due to
The congestion problems that " routing " is concentrated and caused, can accomplish being switched fast of faulty link simultaneously,
Strengthen reliability, and can aggregated link bandwidth, making full use of these redundant links, to carry out flow equal
Weighing apparatus is the main method of current data center network traffic engineering.
In current research work, a kind of is flow equalization strategy based on data stream granularity, adopts
By static equal-cost route (Equal-Cost Multipath Routing, ECMP) mechanism upper
Line link increases the step randomly choosing core node, but when link occurs big stream
Wait, link circuit resource unfair distribution can be caused to put down.By using a kind of heuristic routing algorithm
(Global First Fit, GFF) introduces link state monitoring mechanism and can overcome ECMP
Deficiency, but in the transition process of big stream, the most inevitably produce packet loss and may
Cause receiving terminal data packet disorder；Another kind is flow equalization strategy based on packet granularity,
The transmission control protocol of data source, in addition to the communication protocol that design is new, is also entered by Fastpass
Go amendment, also needed to increase the caching of receiving terminal to process the data that receiving terminal is out of order simultaneously
Bag, it is achieved get up complex, changes more to host-host protocol or architecture, and these are all
Adding the complexity of deployment, extensibility is the highest.
Therefore, the significant challenge faced in current research work is how to design a kind of data center
Network traffics equalization methods, can simplify deployment, strengthen extensibility, can solve at strategy again
The data stream packet loss caused in method implementation process and the issuable packet of receiving terminal are disorderly
Sequence problem.
Summary of the invention
Owing to current data center network flow equalization method disposes loaded down with trivial details, poor expandability,
And the data stream packet loss that causes in strategy process implementation process cannot be solved and receiving terminal can
The problem of the data packet disorder that can produce, the present invention proposes in the data of a kind of software-oriented definition
Heart network traffics equalization methods and device.
First aspect, the data center network flow that the present invention proposes the definition of a kind of software-oriented is equal
Weighing apparatus method, including:
The packet that controller desampler sends, by feature field and the stream of described packet
Field in table is mated, and according to default action priority moving described packet
Note down in the behavior aggregate of stream table；
If the feature field of described packet and the fields match success in described stream table, then basis
Sequence of movement in behavior aggregate, performs respective operations to described packet；
Forward if described respective action is pretreatment, then judge the slot fields of described packet with
Whether the transmission time slot value in described stream table mates, if coupling, is then forwarded by described packet,
If not mating, then described data pack buffer is forwarded to next time slot, with equilibrium towards
The flow of the data center network of software definition；
Wherein, the action of described packet includes that process, pretreatment forward, forward and abandon.
Preferably, if the fields match flowing table in the feature field of described packet and switch is lost
Lose, then according to the behavior aggregate in the passive flow table preset, described packet is performed respective operations.
Preferably, the packet that described controller desampler sends, by described packet
Feature field is mated with the field in stream table, and according to default action priority by institute
State the action record of packet in the behavior aggregate of stream table before, also include:
If wall scroll stream link bandwidth occupancy exceedes bandwidth threshold in the currently transmitted cycle, it is determined that
Current stream is big stream, and is added to the conjunction of big adfluxion by described big stream；
If the link load of described big stream process exceedes load threshold, then from the source with described big stream
Hold two paths selecting time delay minimum in the path that direct-connected marginal layer switch presets, for
Switch in described two paths when packet forwards.
Preferably, if wall scroll stream link bandwidth occupancy exceedes bandwidth in the described currently transmitted cycle
Threshold value, then current stream is big stream, and described big stream is added close to big adfluxion in after, also wrap
Include:
If current big stream exceedes described load threshold at the link load of a upper transmission cycle process
Value, then when selecting from the path that the marginal layer switch direct-connected with the source of current big stream is preset
Prolong two paths of minimum, switch in described two paths when forwarding for packet.
Preferably, described exceed load threshold when the link load of described big stream process, then from
The path that the direct-connected marginal layer switch of the source of described big stream is preset select time delay minimum
Two paths, when forwarding for packet in described two paths after switching, also include:
Propagation delay time calculating transmission time slot value according to path, and according to described transmission time slot value more
New described stream table.
Second aspect, the present invention also proposes the data center network flow of a kind of software-oriented definition
Balancer, including:
Fields match module, the packet sent for desampler, by described packet
Feature field is mated with the field in stream table, and according to default action priority by institute
State the action record of packet in the behavior aggregate of stream table；
First action executing module, in the feature field and described stream table of described packet
Fields match success time, according to the sequence of movement in behavior aggregate, it is right to perform described packet
Should operate；
Pretreatment forwarding module, for when described respective action is pretreatment forwarding, it is judged that institute
Whether the slot fields stating packet mates with the transmission time slot value in described stream table, if coupling,
Then described packet is forwarded, if not mating, then by described data pack buffer to next time slot
Forward, to equalize the flow of the data center network towards software definition；
Wherein, the action of described packet includes that process, pretreatment forward, forward and abandon.
Preferably, also include:
Second action executing module, for when flowing in the feature field of described packet with switch
During the fields match failure of table, according to the behavior aggregate in default passive flow table to described packet
Perform respective operations.
Preferably, also include:
Flow greatly judge module, be used for when in the currently transmitted cycle, wall scroll stream link bandwidth occupancy surpasses
When crossing bandwidth threshold, determine that current stream is big stream, and described big stream is added to the conjunction of big adfluxion；
First path selects module, for exceeding load threshold when the link load of described big stream process
During value, when selecting from the path that the marginal layer switch direct-connected with the source of described big stream is preset
Prolong two paths of minimum, switch in described two paths when forwarding for packet.
Preferably, also include:
Second path selection module, for flowing the most greatly at a upper chain sending cycle process
When road load exceedes described load threshold, from the marginal layer exchange direct-connected with the source of current big stream
The path that machine is preset selects two paths that time delay is minimum, described when forwarding for packet
Two paths switch.
Preferably, also include:
Slot values more new module, calculates transmission time slot value for the propagation delay time according to path, and
Described stream table is updated according to described transmission time slot value.
As shown from the above technical solution, the action record of packet is existed by the present invention by controller
In behavior aggregate, and perform respective operations according to the sequence of movement in behavior aggregate, simplify deployment,
Enhance the extensibility of network simultaneously；By judging the slot fields of packet and flowing in table
Whether transmission time slot value mates, if coupling, is then forwarded by described packet, if not mating, then
Described data pack buffer is forwarded to next time slot, solves and implemented at strategy process
The data stream packet loss caused in journey and receiving terminal issuable data packet disorder problem.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below
The accompanying drawing used required in embodiment or description of the prior art will be briefly described, aobvious and
Easily insight, the accompanying drawing in describing below is only some embodiments of the present invention, for this area
From the point of view of those of ordinary skill, on the premise of not paying creative work, it is also possible to according to these
Figure obtains other accompanying drawing.
Data center's net of a kind of software-oriented definition that Fig. 1 provides for one embodiment of the invention
The schematic flow sheet of network flow equalization method；
Data center's net of a kind of software-oriented definition that Fig. 2 provides for one embodiment of the invention
The system construction drawing of network；
The data center of a kind of software-oriented definition that Fig. 3 provides for another embodiment of the present invention
The flow chart of network traffics equalization methods；
The data center of a kind of software-oriented definition that Fig. 4 provides for another embodiment of the present invention
The triggering of network traffics equalization methods and cancellation flow chart；
Data center's net of a kind of software-oriented definition that Fig. 5 provides for one embodiment of the invention
The structural representation of network flow equalization device.
Detailed description of the invention
Below in conjunction with the accompanying drawings, the detailed description of the invention of invention is further described.Hereinafter implement
Example is only used for clearly illustrating technical scheme, and can not limit this with this
Bright protection domain.
Use Fat-tree network topology first against embodiment, the switch in topology is needed
Controller to be utilized issues passive flow table and is configured, in order to more clearly describe the work of the present invention
Make flow process, as follows to the concept definition related to:
O-D (Origin-Destination) is right: refer to certain source flowed and destination main frame institute directly
The two edge of table layer switch connected, the O-D in experiment is to being belonging respectively to different POD
(Performance Optimization Datacenter)。
Intermediary switch: refer to convergence-level and core layer switch.
Switch path: refer to when certain packet from one end of switch O-D pair to the other end
During the path that formed of the edge switch of process and intermediary switch.
Static path: refer to for each O-D pair, the fixing biography specified the most in advance
Defeated path.When FLAT is not triggered, the data stream between O-D will along this path transmission,
Wherein, FLAT represents that the data center network flow that the software-oriented that the present invention provides defines is equal
Weighing apparatus method.
FLAT path: refer to for each O-D pair, (k is the k/2 bar specified the most in advance
The parameter of Fat-tree topology) fixing, disjoint switch path.When FLAT is at certain
Individual O-D on be triggered time, from this k/2 bar fixed route, only select the transmission of current time slots
Path.For certain O-D pair, its static path is included in FLAT path.
The stream table in static path and FLAT path is arranged: for intermediary switch, all of
FLAT routing information all will be stored in stream table with the form of passive flow list item.Edge is handed over
Change planes, the most only prestore the stream table that all static paths are corresponding.When FLAT is not triggered,
Packet can complete to forward along default static path, and after FLAT starts, then by controlling
Device processed issues the switching of priority higher FLAT stream table realizing route to edge switch.
Secondly, in the work process of FLAT, the spy to path and link data is also related to
Survey process, relevant concept and main points are explained as follows:
Global path delay detection: in order to assess before first time slot when FLAT triggers
Each bar FLAT transmits the quality in path and calculates transmission time slot value, it would be desirable at each O-D
Send detection bag in 4 (transmission number of paths can be set in advance) preset path between to come
Acquisition approach time delay value.This detection is referred to as global path detection, and these detections are coated the most complete
Office's path detection bag.It should be noted that this process will be continued for, whether have path
Trigger FLAT strategy.The transmission interval of detection bag have to be suitable, if the oversize number obtained
According to ageing the not strongest, the shortest, data link and switch can be increased to controller communication link
Time delay.
FLAT detects the path delay of time: carry out certain the big all FLAT paths flowing correspondence
Latency measurement, purpose is similar with overall situation detection.Owing to this expense is relatively small, and need right
It is ageing higher that big stream detects, so this detection is shorter than the time interval of overall situation detection.
Link load detects: FLAT entry condition is that big stream causes certain link load and exceedes
Threshold value；After FLAT starts, need to select optimal path according to the loading condition in path,
It is thus desirable to measure all link loads on all FLAT paths of big stream, this claims
For single-pathway link detection (abbreviation link detection).It need not issue detection on link
Bag, it is only necessary to timing is to controller upwards transmission port statistical data, but only life on the path specified
Effect.Cycle as generally it has with FLAT delay detection.
FLAT detects the cycle: refer to the cycle of FLAT delay detection and link detection, and it is simultaneously
Also determine FLAT and obtain data, decision-making and cycle shortest time of judgement, the most also
It is called the cycle for short.
Fig. 1 shows in the data that a kind of software-oriented that one embodiment of the invention provides defines
The schematic flow sheet of heart network traffics equalization methods, including:
The packet that S1, controller desampler send, by the feature field of described packet
Mate with the field in stream table, and according to default action priority by described packet
Action record stream table behavior aggregate in；
If the feature field of the described packet of S2 and the fields match success in described stream table, then
According to the sequence of movement in behavior aggregate, described packet is performed respective operations；
Forward if the described respective action of S3 is pretreatment, then judge the time slot word of described packet
Whether section mates with the transmission time slot value in described stream table, if coupling, is then turned by described packet
Sending out, if not mating, then described data pack buffer being forwarded to next time slot, with equilibrium
The flow of the data center network of software-oriented definition；
Wherein, the action of described packet includes that process, pretreatment forward, forward and abandon.
The present embodiment passes through controller by the action record of packet in behavior aggregate, and according to dynamic
Making the sequence of movement concentrated and perform respective operations, simplify deployment, enhance network can simultaneously
Autgmentability；By judging that whether the slot fields of packet and the transmission time slot value in stream table
Joining, if coupling, then described packet being forwarded, if not mating, then by described data pack buffer
Forward to next time slot, solve the data stream caused in strategy process implementation process
Packet loss and receiving terminal issuable data packet disorder problem.
Further, after S3, also include:
If the feature field of the described packet of S4 and switch flow the fields match failure of table,
Then according to the behavior aggregate in the passive flow table preset, described packet is performed respective operations.
By arranging passive flow table, the feature field realizing described packet flows in switch
During the fields match failure of table, each to a route between edge switch.
Specifically, before S1, also include:
If wall scroll stream link bandwidth occupancy exceedes bandwidth threshold in the S01 currently transmitted cycle,
Then determine that current stream is big stream, and described big stream is added to the conjunction of big adfluxion；
If the link load of the described big stream process of S02 exceedes load threshold, then from described greatly
The path that the direct-connected marginal layer switch of source of stream is preset selects the Liang Tiaolu that time delay is minimum
Footpath, switches when forwarding for packet in described two paths.
By judging that the link load of big stream process exceedes load threshold and performs corresponding operating, energy
Enough avoid the occurrence of the traditional method link excessive data stream packet loss caused of load and packet is random
Sequence situation.
Further, after S01, also include:
If the current big stream of S012 exceedes described negative at the link load of a upper transmission cycle process
Carry threshold value, then select from the path that the marginal layer switch direct-connected with the source of current big stream is preset
Select two paths that time delay is minimum, switch in described two paths when forwarding for packet.
In order to avoid current big stream exceedes described at the link load of a upper transmission cycle process
Load threshold, and the link load of current period process is not less than described load threshold, therefore makes
The route oscillation problem become and the problem reducing implementation effect.
Further, after S02, also include:
S03, calculate transmission time slot value according to the propagation delay time in path, and during according to described transmission
Gap value updates described stream table.
By updating the transmission time slot value in stream table so that transmission time slot value more conforms to network and works as
Front ruuning situation, further Balanced network load.
In order to the data center network of software-oriented definition that the present embodiment provide is described in more detail
Flow equalization method, the data center network of the software-oriented definition first the present embodiment provided
It is introduced:
The data center network of one software-oriented definition comprises: server, access-layer switch,
Core layer switch and controller, its middle controller is connected with all switches, and switch props up
Hold OpenFlow (OF) agreement；
As in figure 2 it is shown, controller is as application layer platform, integrated four modular assemblies come real
The functional packet of existing whole controller platform contains: topology information collection module, routing information statistics mould
Block, path calculation module, stream table more new module；
Topology information collection module finds net by collecting more fresh information to neighbouring switch
Network topology.The renewable information of switch includes findings that neighbours' message and the chain of each neighbours interconnection
Line state message, by determining current network topology figure with the mutual of exchanger information, and to road
Footpath computing module provides information.Communication protocol between controller platform and switch all uses
OF agreement, each switch runs OF agency by agreement software, is responsible for receiving packet and turns
Send out the message updated to lay equal stress on and newly write forward table based on exchange hardware；
Routing information statistical module realizes by the way of active inquiry and passive reception combine
Two functions: one is the flow being collected each port by the relevant OF switch of periodically inquiry
Statistical information；Two is the Delay being obtained and updating transmission path by structural exploration bag, with
Upper information all will be saved in data statistic.Wherein, traffic statistics includes that controller is received
After FlowRemoved message, add up each port of switch according to stream table enumerator and send out
The byte quantity sent and receive, the calculating for link residual capacity provides foundation；
Path calculation module runs the core algorithm FLAT of the present invention, first passes through topology information
The network topology that collection module provides calculate any node between available path, it is contemplated that
The restriction of the computing cost of controller and exchange hardware condition (such as, TCAM capacity and
Cost), the quantity selecting multi-path transmission can be limited (such as, less than three)；
Secondly, the link selected can be remained by the data provided according to routing information statistical module
Calculation of capacity and the calculating of transmission time slot, and select the link of most lightly loaded to carry out stream compression
Send out；Finally, the result of path computing is converted to routing forwarding rule and is issued to switch；
The routing forwarding rule that stream table more new module will drive OF switch to issue according to controller
Carry out the installation of stream table, renewal and deletion action.
The data center network that the present embodiment provides does not results in during data stream scheduling
The problem of receiving terminal data packet disorder；Controller platform uses the main passive mode measured that combines to obtain
Take the Delay of flow information and transmission path, it is ensured that the accuracy of algorithm；Thin meeting
The TCP commonly used in current data center network will not be led to while granularity flow equalization
Letter agreement does any change, it is easy to disposes, has extensibility.
Below in conjunction with Fig. 2-4, the method providing the present embodiment is further elaborated.
Fig. 2 is that the present invention implements the prototype system of flow equalization method based on FLAT algorithm.As
Shown in Fig. 2, controller is as application layer platform, and integrated four modular assemblies are respectively as follows: to be opened up
Flutter information collection module, routing information statistical module, path calculation module and stream table more new module,
Jointly realize the function of whole controller platform；Wherein, path calculation module runs the present embodiment
Core methed FLAT.
The workflow controlling platform is as follows: first, and topology information collection module is by neighbouring
Switch collect more fresh information to find network topology, FLAT is then provided by this module
Network topology calculate any node between available path；Next step, FLAT is by basis
Routing information statistical module provide data to select link carry out residual capacity calculating and
The calculating of transmission time slot, and select the link of most lightly loaded to carry out forwarding data flow；Finally,
The result of path computing is converted to routing forwarding rule and is issued to switch and realizes data by FLAT
Bag forwards.
Fig. 3 is FLAT workflow, specifically includes following steps:
S201, packet arrive Openflow switch；
S202, switch according to some feature field of packet (as source IP, purpose IP,
MAC Address etc.) mate with the entry in stream table.If it fails to match, then perform
S203；If the match is successful, then redirect execution S204；
Under S203, default situations, when mating unsuccessful, there will be packet-in event.But
In experimental data central site network, all switches are all prefixed passive flow table with lower priority,
Realize not triggering during FLAT each to a route between edge switch.If therefore
It fails to match, then explanation passive flow table lost efficacy, it should returns mistake, and trial re-issues quiet
State stream table, redirects execution S202 afterwards and reattempts to coupling stream table；
S204, in Openflow1.3 standard, when data wrap in coupling stream table, can be by
According to predetermined priority orders, all entry actions are all recorded in behavior aggregate, mated it
After perform in order.Generally forward, abandon and performed by the action final as packet,
Therefore other actions in addition to forwarding and abandoning all can be come having come of the two.And
FLAT can regard a kind of forwarding behavior being modified as, the most also can come other actions
Afterwards；After having performed other actions, remaining action should be FLAT, forwards or abandons；
If S205 current action is FLAT, then perform S206；If it is not, then redirect
Perform S207；
S206, judging current time slots, this stream is the need of caching.If need not caching, then
Perform S207；If needing caching, then redirect execution S208；
S207, the forwarding behavior (from S206) performed under FLAT strategy, or perform
Forwarding outside S205 non-FLAT action or abandon operation, after above action completes,
Redirect execution S209；
The current bag of S208, caching is to queue, further according to FLAT after terminating until current transmission time slot
Strategy forwards；
S209, this processing data packets are complete, terminate flow process；If there being next packet to arrive,
Redirect execution S202.
Fig. 4 is that FLAT triggers and cancels workflow diagram, specifically includes following steps:
S301, arrange the overall situation detection bag, the transmission cycle of link detection bag；
S302, proceed by the overall situation detection, record measurement result simultaneously；
S303, judge whether network has life of miscarrying greatly；Judge that the big foundation flowed is source end host
Certain stream link bandwidth occupancy exceedes setting threshold value (usually 10%).If there being big miscarriage
Raw, then add big adfluxion to and close in F and perform S304；Otherwise, execution S313 is redirected；
S304, the links that all big streams interior to set are corresponding carry out link load detection, on the one hand
Whether certain link that can find out big stream process exceedes threshold value；On the other hand trigger for FLAT
After path computing provide information；
Whether S305, the current big stream of judgement performed FLAT in a upper detection cycle, if
No, then S306 is performed；Otherwise redirect execution S307, current big stream is judged at upper one week
Whether the phase performed the reason of FLAT is: if this big stream failed to trigger in this cycle
FLAT, then return to original route and again may trigger FLAT thus produce route oscillation, fall
The implementation effect of low FLAT strategy, therefore, the big stream that a upper cycle performed FLAT continues
Continuous execution, until it is no longer big stream or terminates transmitting；
If certain link load of S306 stream process greatly exceedes threshold value, then perform S307；
The most just check next big stream, and redirect execution S312；
S307, FLAT algorithm triggers according to current measurement result, direct-connected from big stream source
Preset 4 transmission paths of marginal layer switch in, 2 paths selecting time delay minimum are made
Transmission path for FLAT.Within the effect duration of FLAT stream table, the packet of current big stream
To switch on this two paths according to forwarding strategy.It should be noted that and run FLAT's
First time slot, switch needs first to cache first flow (mono-time slot of FLAT of this stream
The packet transmitted), prevent packet from arriving receiving terminal and produce out of order；
S308, FLAT calculate transmission time slot value according to the measurement result of current record.Time slot
The calculating of value is briefly described below: the time delay difference between 4 preset transmission paths is less than
During 100 μ s, taking slot values is 100 μ s；When time delay difference is at 100-500 μ s, take slot values
It is 500 μ s；When time delay difference is more than 500 μ s, using actual difference as slot values；
S309, controller issue the priority setting of FLAT stream table and are higher than in switch preset
Passive flow table priority, simultaneously in stream table corresponding to encapsulated delivery slot values, transmission path
Forward port and stream table life span (TTL, Time To Live), ttl value is
Link detection periodic quantity；
FLAT is flowed table and is issued to the marginal layer exchange direct-connected with stream source greatly by S310, controller
Machine.Owing to each OD is to optional 4 transmission paths, and pass through passive flow table
Mode be issued to the switch on all transmission paths, therefore, data stream flows according to FLAT
Table switching between mulitpath necessarily can arrive at location, and FLAT according to bag
Stream table only need to be issued to marginal layer switch, can greatly reduce switch by such design
And the communication overhead between controller；
If the current big stream of S311 yet suffered from the next cycle, then it will need ageing
Higher information in the path delay of time calculates the FLAT time slot size made new advances, it is therefore desirable in this week
Phase measures all FLAT path delay of time again；
S312, start to check next big stream, redirect execution S305；If institute in set F
There is big stream inspected complete, then perform S313；
Detection and the decision-making of big stream have been fully completed by S313, current period, it is also possible to current
Cycle does not detect big stream (from S303), if receiving program determination instruction, then
The most at this moment program is terminated；If continued to run with, then perform S314；
After S314, wait current period terminate, it is again introduced into next cycle and redirects execution
S303；
By substantial amounts of emulation experiment, find method and other several multichannels of the present embodiment offer
Footpath transmission method compares (such as, ECMP, GFF), and handling capacity improves 13%～45%,
Receiving terminal occurs almost without out of order packet simultaneously, with employing single path laser propagation effect etc.
With, but handling capacity the most but maximum can bring up to 83%.Can illustrate from experimental result
The present embodiment has reached expection purpose.
Fig. 5 shows the data center network that a kind of software-oriented that the present embodiment provides defines
The structural representation of flow equalization device, including:
Fields match module 11, the packet sent for desampler, by described data
The feature field of bag is mated with the field in stream table, and according to default action priority
By the action record of described packet in the behavior aggregate of stream table；
First action executing module 12, is used for the feature field when described packet and described stream
During fields match success in table, according to the sequence of movement in behavior aggregate, described packet is held
Row respective operations；
Pretreatment forwarding module 13, for when described respective action is pretreatment forwarding, sentencing
Whether the slot fields of disconnected described packet mates with the transmission time slot value in described stream table, if
Join, then described packet is forwarded, if not mating, then by described data pack buffer to next
Time slot forwards, to equalize the flow of the data center network towards software definition；
Wherein, the action of described packet includes that process, pretreatment forward, forward and abandon.
The present embodiment passes through controller by the action record of packet in behavior aggregate, and according to dynamic
Making the sequence of movement concentrated and perform respective operations, simplify deployment, enhance network can simultaneously
Autgmentability；By judging that whether the slot fields of packet and the transmission time slot value in stream table
Joining, if coupling, then described packet being forwarded, if not mating, then by described data pack buffer
Forward to next time slot, solve the data stream caused in strategy process implementation process
Packet loss and receiving terminal issuable data packet disorder problem.
Alternatively, described device also includes:
Second action executing module, for when flowing in the feature field of described packet with switch
During the fields match failure of table, according to the behavior aggregate in default passive flow table to described packet
Perform respective operations.
Further, described device also includes:
Flow greatly judge module, be used for when in the currently transmitted cycle, wall scroll stream link bandwidth occupancy surpasses
When crossing bandwidth threshold, determine that current stream is big stream, and described big stream is added to the conjunction of big adfluxion；
First path selects module, for exceeding load threshold when the link load of described big stream process
During value, when selecting from the path that the marginal layer switch direct-connected with the source of described big stream is preset
Prolong two paths of minimum, switch in described two paths when forwarding for packet.
Further, described device also includes:
Second path selection module, for flowing the most greatly at a upper chain sending cycle process
When road load exceedes described load threshold, from the marginal layer exchange direct-connected with the source of current big stream
The path that machine is preset selects two paths that time delay is minimum, described when forwarding for packet
Two paths switch.
Further, described device also includes:
Slot values more new module, calculates transmission time slot value for the propagation delay time according to path, and
Described stream table is updated according to described transmission time slot value.
The data center network flow equalization device of the software-oriented definition described in the present embodiment can
For performing said method embodiment, its principle is similar with technique effect, and here is omitted.
In the description of the present invention, illustrate a large amount of detail.It is to be appreciated, however, that this
Inventive embodiment can be put into practice in the case of not having these details.At some examples
In, it is not shown specifically known method, structure and technology, in order to not fuzzy to this specification
Understanding.
Claims (10)
1. a data center network flow equalization method for software-oriented definition, its feature exists
In, including:
The packet that controller desampler sends, by feature field and the stream of described packet
Field in table is mated, and according to default action priority moving described packet
Note down in the behavior aggregate of stream table；
If the feature field of described packet and the fields match success in described stream table, then basis
Sequence of movement in behavior aggregate, performs respective operations to described packet；
Forward if described respective action is pretreatment, then judge the slot fields of described packet with
Whether the transmission time slot value in described stream table mates, if coupling, is then forwarded by described packet,
If not mating, then described data pack buffer is forwarded to next time slot, with equilibrium towards
The flow of the data center network of software definition；
Wherein, the action of described packet includes that process, pretreatment forward, forward and abandon.
Method the most according to claim 1, it is characterised in that if described packet
Feature field and switch flow the fields match failure of table, then according in the passive flow table preset
Behavior aggregate to described packet perform respective operations.
Method the most according to claim 1, it is characterised in that described controller receives
The packet that switch sends, is carried out the feature field of described packet with the field in stream table
Coupling, and according to default action priority, the action record of described packet is being flowed table
Before in behavior aggregate, also include:
If wall scroll stream link bandwidth occupancy exceedes bandwidth threshold in the currently transmitted cycle, it is determined that
Current stream is big stream, and is added to the conjunction of big adfluxion by described big stream；
If the link load of described big stream process exceedes load threshold, then from the source with described big stream
Hold two paths selecting time delay minimum in the path that direct-connected marginal layer switch presets, for
Switch in described two paths when packet forwards.
Method the most according to claim 3, it is characterised in that if described currently transmitted
In cycle, wall scroll stream link bandwidth occupancy exceedes bandwidth threshold, then current stream is big stream, and will
After described big stream adds to the conjunction of big adfluxion, also include:
If current big stream exceedes described load threshold at the link load of a upper transmission cycle process
Value, then when selecting from the path that the marginal layer switch direct-connected with the source of current big stream is preset
Prolong two paths of minimum, switch in described two paths when forwarding for packet.
Method the most according to claim 3, it is characterised in that described when described big stream
The link load of process exceedes load threshold, then from the marginal layer direct-connected with the source of described big stream
The path that switch is preset selects two paths that time delay is minimum, when forwarding for packet
In described two paths after switching, also include:
Propagation delay time calculating transmission time slot value according to path, and according to described transmission time slot value more
New described stream table.
6. a data center network flow equalization device for software-oriented definition, its feature exists
In, including:
Fields match module, the packet sent for desampler, by described packet
Feature field is mated with the field in stream table, and according to default action priority by institute
State the action record of packet in the behavior aggregate of stream table；
First action executing module, in the feature field and described stream table of described packet
Fields match success time, according to the sequence of movement in behavior aggregate, it is right to perform described packet
Should operate；
Pretreatment forwarding module, for when described respective action is pretreatment forwarding, it is judged that institute
Whether the slot fields stating packet mates with the transmission time slot value in described stream table, if coupling,
Then described packet is forwarded, if not mating, then by described data pack buffer to next time slot
Forward, to equalize the flow of the data center network towards software definition；
Wherein, the action of described packet includes that process, pretreatment forward, forward and abandon.
Device the most according to claim 6, it is characterised in that also include:
Second action executing module, for when flowing in the feature field of described packet with switch
During the fields match failure of table, according to the behavior aggregate in default passive flow table to described packet
Perform respective operations.
Device the most according to claim 7, it is characterised in that also include:
Flow greatly judge module, be used for when in the currently transmitted cycle, wall scroll stream link bandwidth occupancy surpasses
When crossing bandwidth threshold, determine that current stream is big stream, and described big stream is added to the conjunction of big adfluxion；
First path selects module, for exceeding load threshold when the link load of described big stream process
During value, when selecting from the path that the marginal layer switch direct-connected with the source of described big stream is preset
Prolong two paths of minimum, switch in described two paths when forwarding for packet.
Device the most according to claim 8, it is characterised in that also include:
Second path selection module, for flowing the most greatly at a upper chain sending cycle process
When road load exceedes described load threshold, from the marginal layer exchange direct-connected with the source of current big stream
The path that machine is preset selects two paths that time delay is minimum, described when forwarding for packet
Two paths switch.
Device the most according to claim 9, it is characterised in that also include:
Slot values more new module, calculates transmission time slot value for the propagation delay time according to path, and
Described stream table is updated according to described transmission time slot value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610326176.5A CN105915467B (en) | 2016-05-17 | 2016-05-17 | A kind of data center network flow equalization method and device that software-oriented defines |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610326176.5A CN105915467B (en) | 2016-05-17 | 2016-05-17 | A kind of data center network flow equalization method and device that software-oriented defines |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105915467A true CN105915467A (en) | 2016-08-31 |
| CN105915467B CN105915467B (en) | 2019-06-18 |
Family
ID=56749133
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610326176.5A Active CN105915467B (en) | 2016-05-17 | 2016-05-17 | A kind of data center network flow equalization method and device that software-oriented defines |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105915467B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109561026A (en) * | 2018-12-10 | 2019-04-02 | 福州大学 | Burst method for stream processing based on software defined network carrier state data plane |
| CN110086870A (en) * | 2019-04-28 | 2019-08-02 | 北京工业大学 | The parallel method for reliable transmission of the multipath of data-oriented central site network |
| CN110351196A (en) * | 2018-04-02 | 2019-10-18 | 华中科技大学 | Load-balancing method and system based on accurate congestion feedback in cloud data center |
| CN111654446A (en) * | 2020-05-26 | 2020-09-11 | 李云祥 | Big data flow control method and device and flow server |
| CN113678409A (en) * | 2019-03-25 | 2021-11-19 | 西门子股份公司 | Method and computer program for data communication |
| CN113794655A (en) * | 2020-07-17 | 2021-12-14 | 北京京东尚科信息技术有限公司 | Flow monitoring method and device, computer storage medium and electronic equipment |
| CN114448899A (en) * | 2022-01-20 | 2022-05-06 | 天津大学 | Method for balancing network load of data center |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112506648B (en) * | 2020-11-20 | 2022-05-03 | 鹏城实验室 | Traffic stateless migration method of virtual network function instance and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103354522A (en) * | 2013-06-28 | 2013-10-16 | 华为技术有限公司 | Method and device for searching multistage flow table |
| US9009349B2 (en) * | 2013-02-08 | 2015-04-14 | Dell Products, Lp | System and method for dataplane extensibility in a flow-based switching device |
| CN105099920A (en) * | 2014-04-30 | 2015-11-25 | 杭州华三通信技术有限公司 | Method and device for setting SDN flow entry |
| CN105227481A (en) * | 2015-09-02 | 2016-01-06 | 重庆邮电大学 | The SDN congestion control method for routing of cost minimization is dispatched based on path cost and stream |
-
2016
- 2016-05-17 CN CN201610326176.5A patent/CN105915467B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9009349B2 (en) * | 2013-02-08 | 2015-04-14 | Dell Products, Lp | System and method for dataplane extensibility in a flow-based switching device |
| CN103354522A (en) * | 2013-06-28 | 2013-10-16 | 华为技术有限公司 | Method and device for searching multistage flow table |
| CN105099920A (en) * | 2014-04-30 | 2015-11-25 | 杭州华三通信技术有限公司 | Method and device for setting SDN flow entry |
| CN105227481A (en) * | 2015-09-02 | 2016-01-06 | 重庆邮电大学 | The SDN congestion control method for routing of cost minimization is dispatched based on path cost and stream |
Non-Patent Citations (2)
| Title |
|---|
| 杨洋 等: "《数据中心网络多路径路由算法》", 《清华大学学报（自然科学版）》 * |
| 杨洋 等: "《软件定义的数据中心网络中一种基于时隙传输的流量均衡方案设计》", 《中国科技论文在线》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110351196A (en) * | 2018-04-02 | 2019-10-18 | 华中科技大学 | Load-balancing method and system based on accurate congestion feedback in cloud data center |
| CN110351196B (en) * | 2018-04-02 | 2020-09-08 | 华中科技大学 | Load balancing method and system based on accurate congestion feedback in cloud data center |
| CN109561026A (en) * | 2018-12-10 | 2019-04-02 | 福州大学 | Burst method for stream processing based on software defined network carrier state data plane |
| CN109561026B (en) * | 2018-12-10 | 2021-09-28 | 福州大学 | Burst flow processing method based on software defined network data plane with state |
| CN113678409A (en) * | 2019-03-25 | 2021-11-19 | 西门子股份公司 | Method and computer program for data communication |
| CN113678409B (en) * | 2019-03-25 | 2022-10-21 | 西门子股份公司 | Method and storage medium for data communication |
| US12047299B2 (en) | 2019-03-25 | 2024-07-23 | Siemens Aktiengesellschaft | Computer program and method for data communication |
| CN110086870A (en) * | 2019-04-28 | 2019-08-02 | 北京工业大学 | The parallel method for reliable transmission of the multipath of data-oriented central site network |
| CN111654446A (en) * | 2020-05-26 | 2020-09-11 | 李云祥 | Big data flow control method and device and flow server |
| CN111654446B (en) * | 2020-05-26 | 2022-11-29 | 北京城建智控科技股份有限公司 | Big data flow control method and device and flow server |
| CN113794655A (en) * | 2020-07-17 | 2021-12-14 | 北京京东尚科信息技术有限公司 | Flow monitoring method and device, computer storage medium and electronic equipment |
| CN114448899A (en) * | 2022-01-20 | 2022-05-06 | 天津大学 | Method for balancing network load of data center |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105915467B (en) | 2019-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105915467A (en) | Data center network flow balancing method and device oriented to software definition | |
| CN107360092B (en) | System and method for balancing load in data network | |
| Wang et al. | Adaptive path isolation for elephant and mice flows by exploiting path diversity in datacenters | |
| KR101700141B1 (en) | Method and apparatus for maintaining port state tables in a forwarding plane of a network element | |
| Liu et al. | Ensuring connectivity via data plane mechanisms | |
| KR101809396B1 (en) | Method to route packets in a distributed direct interconnect network | |
| Li et al. | OpenFlow based load balancing for fat-tree networks with multipath support | |
| US20150180705A1 (en) | Controller placement for fast failover in the split architecture | |
| CN102238072B (en) | Method for dynamically selecting routing and CLOS (Charles Clos) switching network system | |
| CN104025513B (en) | Apparatus and method for the control level in data center network | |
| CN107396396A (en) | Support the data transfer management method of multi-source multipath | |
| CN101888330A (en) | Be used to provide the method and apparatus of the quick rerouting of grouping | |
| CN103795805A (en) | Distributed server load balancing method based on SDN | |
| CN101888332A (en) | Be used to provide the method for quick rerouting and transmit data cell | |
| CN101888307B (en) | The method and apparatus of port selection is realized for this locality | |
| JP5943431B2 (en) | Network, data transfer node, communication method and program | |
| Cui et al. | Difs: Distributed flow scheduling for adaptive routing in hierarchical data center networks | |
| CN112350949B (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| Tadesse et al. | Energy-efficient traffic allocation in SDN-basec backhaul networks: Theory and implementation | |
| Cui et al. | DiFS: Distributed Flow Scheduling for adaptive switching in FatTree data center networks | |
| CN113746751A (en) | Communication method and device | |
| CN109039941B (en) | Adaptive packet scattering method based on path classification in data center network | |
| Bogdanski | Optimized routing for fat-tree topologies | |
| CN101478489B (en) | Method and system for controlling default routing notification by IS-IS protocol | |
| Chang et al. | Using sdn technology to mitigate congestion in the openstack data center network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |