CN108337168A - It flows cluster and exchanges routing mechanism OpenFlow group table selection methods - Google Patents
It flows cluster and exchanges routing mechanism OpenFlow group table selection methods Download PDFInfo
- Publication number
- CN108337168A CN108337168A CN201810143048.6A CN201810143048A CN108337168A CN 108337168 A CN108337168 A CN 108337168A CN 201810143048 A CN201810143048 A CN 201810143048A CN 108337168 A CN108337168 A CN 108337168A
- Authority
- CN
- China
- Prior art keywords
- time
- port
- last
- hash
- packet
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/15—Interconnection of switching modules
- H04L49/1507—Distribute and route fabrics, e.g. sorting-routing or Batcher-Banyan
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to route switching fields to support the route switching mechanism exchanged based on stream cluster to propose to realize under conditions of not changing original software defined network data plane forwarding mechanism.For this purpose, of the invention, stream cluster exchanges routing mechanism OpenFlow group table selection methods, and steps are as follows：1) perception bottom-layer network topology；2) reachable path is issued on each interchanger by controller；3) arrival time last time Hash table is initialized；4) last time time departure Hash table is initialized；5) timeout value is initialized；6) time for cryptographic Hash being calculated according to five-tuple, reaching interchanger；7) it executes following step 11 or executes following step 8；8) it executes following step 9 or executes following step 10；9) following step 11 is executed；10) following step 11 is executed；11) packet is sent to next-hop, executes step 6.Present invention is mainly applied to route switching occasions.
Description
Technical field
Realize that stream cluster (flowlet) is handed over the present invention relates to route switching field, in specifically a kind of software defined network
Change the OpenFlow group table selection algorithms of (switching) routing mechanism.
Background technology
Term is explained：
Software defined network is a kind of novel network architecture, it carries out the data plane of traditional network and control plane
Separation, to be controlled by the programmable of the software desk Implementation bottom forwarding hardware of Centralized Controller.
OpenFlow agreements are the communication protocol between data plane and control plane, control plane in software defined network
Controller by OpenFlow protocol definitions rule and action designation date plane interchanger how to forward network data
Packet.
Flow table is the table structure similar to traditional network routing table defined in OpenFlow agreements, it is by several flow table items
It constitutes.Flow table item is made of rule and behavior aggregate, if network packet meets the rule that flow table item defines, which will be by
Corresponding action is executed, such as：Forward from some port or change source mesh IP address etc..
Group table is a kind of special flow table of OpenFlow protocol definitions, it is made of several groups list item.Each group list item
Including：Group list item identifier, group entry type, group list item counter and action bucket collection are constituted.Group entry type determines the group
The semanteme of list item, such as：The group list item of all types indicates that the action that this group of list item action bucket is concentrated can be all performed, and select
The group list item of type indicates that only there are one can be performed for action that this group of list item action bucket is concentrated.It includes multiple actions to act bucket collection
Bucket, each bucket that acts represent a kind of processing that can be carried out to network packet, such as：Data are forwarded or changed from some port
A little fields of Mr. Bao etc..
Stream cluster (Flowlet) refers to the set that some in the same TCP flow are made of the packet of correlation, correlation here
Refer to：If two packets of arbitrary neighborhood, which reach the time interval between same switching equipment, is less than pre-defined timeout value,
The packet for meeting this condition is so regarded as a set, referred to as one stream cluster.
It is the route switching technology to flow cluster as granularity that stream cluster, which exchanges (Flowlet switching), is subordinated to same
The Bao Douhui of stream cluster is forwarded from the same port, and different stream clusters can randomly choose forwarding port.It under normal conditions will be overtime
Value is defined as the maximum value of delay inequality between mulitpath in multipath retransmission technique, and TCP will not be caused to reorder phenomenon in this way.
It is an important route switching technology to flow cluster exchange, is applied to load balancing field.Due to distinguishing not cocurrent flow
The timeout value of cluster is set to larger than the difference of the delay of any two load balancing parallel routes, so the load based on stream cluster is equal
Weighing apparatus will not cause the out-of-sequence of packet, can improve the performance of TCP, improve the handling capacity of network.Simultaneously with this route switching mechanism
It realizes that load balancing is fairly simple, does not need additional congestion control information, such as：The congestion situation of current certain link.It is based on
Flowing the load balancing that cluster exchanges has adaptive load balance ability, can be approximate by network flow according to the bandwidth of link
It is prorated in each of the links.
Realize that the route switching mechanism exchanged based on stream cluster is generally required dedicated exchange chip and supported in hardware view,
Such as：Cisco (Cisco) realizes this exchanging mechanism in the hardware switch ground certainly.The realization of software view is generally basede on
The software switch OpenvSwitch or programmable software interchanger P4 to increase income, but this realization method generally can all cause
The missing of other functions of exchange of interchanger becomes only to support the software switch that stream cluster exchanges routing mechanism.There is presently no can
With the implementation of perfect docking software defined network.
The group table of OpenFlow protocol definitions is to we provide additional transfer capability in software defined network, such as：I
The group table of all types can be utilized to realize support to QoS routing.This transfer capability that group table provides will not be destroyed
Other forwarding mechanisms that OpenFlow agreements are supported, such as：Pass-through mode based on flow table item rule match.It is expanded by group table
Routing forwarding mechanism does not interfere with the original forwarding mechanism of OpenFlow agreements, belongs to routing forwarding in OpenFlow agreements
A kind of supplement of mechanism.The present invention realizes that stream cluster exchanges by group table selection algorithm and this advantage exactly is utilized, it is software
Define the perfect solution for realizing that stream cluster exchanges routing mechanism in network.
Invention content
In order to overcome the deficiencies of the prior art, the present invention is directed to propose a kind of OpenFlow groups table selection algorithm, which can
To realize under conditions of not changing original software defined network data plane forwarding mechanism, the routing exchanged based on stream cluster is supported
Exchanging mechanism.For this purpose, the technical solution adopted by the present invention is, stream cluster exchanges routing mechanism OpenFlow group table selection methods, step
It is rapid as follows：
1) the controller perception bottom-layer network topology of software defined network control plane, calculates source network device to purpose net
A plurality of reachable path between network equipment；
2) controller using each of interchanger on reachable path up to exit port as the action bucket for organizing list item, and with group
The form of list item is issued on each interchanger；
3) arrival time last time Hash table is initialized：The last one current packet of each stream of Hash table record reaches interchanger
Time；
4) last time time departure Hash table is initialized：The exit port of the last one current packet of each stream of Hash table record；
5) initialization timeout value timeout：It is a plurality of simultaneously to be greater than load balancing for distinguishing different stream clusters for the timeout value
The maximum delay of walking along the street diameter is poor；
6) when the port of interchanger receives data packet, according to including inbound port, source IP address, purpose IP address, source
Port, destination interface five-tuple calculate the cryptographic Hash hash_key of the packet, and record the packet reach interchanger time
arrive_time。
7) if there is no the records that keyword is hash_key in arrival time last time Hash table, by keyword
The corresponding record arrival of hash_key is added in arrival time last time Hash table；From the action bucket collection of corresponding group of list item of the packet
The port of middle random selection one action bucket instruction is as exit port output_port, by the corresponding notes of keyword hash_key
Record output_port is added in last time time departure Hash table, and executes following step 11, otherwise, executes following step
Rapid 8；
8) the upper packet flowed belonging to the corresponding packets of keyword hash_key is obtained from arrival time last time Hash table
The time for reaching interchanger records last_time, updates the corresponding notes of keyword hash_key in last time time departure Hash table
Record is arrival time, if the time last_time of the upper packet arrival interchangers of arrival time arrive_time->=
Timeout is set up, then executes following step 9；Otherwise, following step 10 is executed；
9) the port work for randomly choosing an action bucket bucket and indicating is concentrated from the action bucket of corresponding group of list item of the packet
For exit port output_port, the corresponding record output_port of keyword hash_key are added to upper packet exit port
In last_output_port Hash tables, and execute following step 11；
10) upper one flowed belonging to the corresponding packets of keyword hash_key is obtained from last_output_port Hash tables
The exit port record of packet is used as output_port, executes following step 11；
11) packet is sent to next-hop from the port that the port numbers of interchanger are output_port, executes step 6.
Comprising the concrete steps that in one example：
1) in bottom-layer network topology, TCP transmitting terminals are IP:10.0.0.1Port:3301, TCP receiving terminals are IP:
10.0.0.2Port:3302, the reachable path between sending and receiving end has two, respectively：With
2) a group list item is issued on each interchanger by software defined network controller, is issued to interchanger S1 groups list item such as
Shown in lower：
Group_id=1, type=select, selection_method=flowlet_switching, bucket=
output:2, bucket=output:3
3) last_arrive_time Hash tables are initialized：The last one current packet of each stream of Hash table record, which reaches, to be handed over
The time changed planes；
4) last_outout_port Hash tables are initialized：The outlet of the last one current packet of each stream of Hash table record
Mouthful；
5) initialization timeout value timeout：It is a plurality of simultaneously to be greater than load balancing for distinguishing different stream clusters for the timeout value
The maximum delay of walking along the street diameter is poor；
6) transmitting terminal is sent to the data packet of receiving terminal and carries out following processing according to group table selection algorithm on interchanger S1
6.1.1) interchanger S1 receives first data packet of transmitting terminal, and the hash values that the packet is calculated according to five-tuple are
Hash_key, five-tuple are：Inbound port=1, source IP address=10.0.0.1, purpose IP address=10.0.0.2, source port=
3301, destination interface=3302；
6.1.2) there is no the record that keyword is 100 in last_arrive_time Hash tables, then keyword 100 is right
The record arrive_time=867674us answered is added in last_arrive_time Hash tables.Execute following step
6.1.3；
6.1.3) port for randomly choosing an action bucket instruction is concentrated to be used as from matched group of list item action bucket of the packet
100 corresponding record output_port=2 of keyword is added to last_output_port by port output_port=2
In Hash table, which is sent out from No. 2 ports of interchanger；
6.2.1) interchanger S1 receives second data packet of transmitting terminal, and the hash values of the packet are calculated according to five-tuple,
Record the time arrive_time that the packet reaches interchanger；
6.2.2 first packet of the correspondence of keyword 100) is obtained from last_arrive_time Hash tables reaches interchanger
Time records last_time=867674us, updates in last_arrive_time Hash tables that keyword 100 is corresponding is recorded as
Arrive_time=868125us；Because of arrive_time-last_time=451<500 set up, so executing following step
Rapid 6.2.3；
6.2.3 the exit port note of 100 corresponding first packets of keyword) is obtained from last_output_port Hash tables
Record output_port=2.The packet is sent out from No. 2 ports of interchanger.；
6.3.1) interchanger S1 receives the third data packet of transmitting terminal, and the hash values of the packet are calculated according to five-tuple
To record the time arrive_time that the packet reaches interchanger；
6.3.2 second packet of the correspondence of keyword 100) is obtained from last_arrive_time Hash tables reaches interchanger
Time records.Keyword 100 is corresponding in update last_arrive_time Hash tables is recorded as arrive_time；Because
Arrive_time-last_time=512>500 set up, so executing following step 6.3.3；
6.3.3) port for randomly choosing an action bucket instruction is concentrated to be used as from matched group of list item action bucket of the packet
100 corresponding record output_port=3 of keyword is added to last_output_port by port output_port=3
In Hash table；The packet is sent out from No. 3 ports of interchanger.
The features of the present invention and advantageous effect are：
No matter realized based on stream using dedicated hardware-switch chip or based on existing software switch solution
The routing mechanism that cluster exchanges all so that the pass-through mode of interchanger becomes single, therefore can not be applied in software defined network,
OpenFlow agreements cannot be supported well.
In view of the above problems, the present invention is not changing OpenFlow by expanding OpenFlow protocol groups table selection algorithms
In the premise of the normal forwarding mechanism of agreement, the support that convection current cluster exchanges routing mechanism is provided, is a kind of incremental implementation method, makes
Software defined network uses the multi-layer switches exchanged based on stream cluster to be made in order to possible.
Description of the drawings：
A kind of OpenFlow group table selection algorithm flow diagrams for supporting stream cluster to exchange route switching mechanism of Fig. 1.
Fig. 2 software defined network topological diagrams.
Specific implementation mode
The purpose of the present invention is to provide a kind of OpenFlow groups table selection algorithm, which may be implemented in software definition
The route switching mechanism exchanged based on stream cluster is supported in network data plane.
The technical solution adopted by the present invention to solve the technical problems is：
1) the controller perception bottom-layer network topology of software defined network control plane, calculates source network device to purpose net
A plurality of reachable path between network equipment.
2) controller using each of interchanger on reachable path up to exit port as the action bucket for organizing list item, and with group
The form of list item is issued on each interchanger.
3) last_arrive_time Hash tables are initialized：The last one current packet of each stream of Hash table record, which reaches, to be handed over
The time changed planes.
4) last_outout_port Hash tables are initialized：The outlet of the last one current packet of each stream of Hash table record
Mouthful.
5) initialization timeout value timeout：It is equal to be generally greater than load for distinguishing different flowlet for the timeout value
Weigh a plurality of parallel route maximum delay it is poor.
6) when the port of interchanger receives data packet, according to five-tuple (inbound port, source IP address, purpose IP address,
Source port, destination interface) the hash values of the packet are calculated as hash_key, and record the time arrive_ that the packet reaches interchanger
time。
7) if there is no the records that keyword is hash_key in last_arrive_time Hash tables, by keyword
The corresponding record arrive_time of hash_key are added in last_arrive_time Hash tables.From corresponding group of table of the packet
The action bucket of item concentrates the port of random selection one action bucket instruction as exit port output_port, by keyword hash_
The corresponding record output_port of key are added in last_output_port Hash tables, and execute following step 11.It is no
Then, following step 8 is executed.
8) upper one flowed belonging to the corresponding packets of keyword hash_key is obtained from last_arrive_time Hash tables
The time that a packet reaches interchanger records last_time.Update keyword hash_key in last_arrive_time Hash tables
It is corresponding to be recorded as arrive_time.If arrive_time-last_time >=timeout is set up, following step is executed
Rapid 9；Otherwise, following step 10 is executed.
9) concentrate the port that one action bucket of random selection indicates as outlet from the action bucket of corresponding group of list item of the packet
Mouth output_port, is added to last_output_port Hash by the corresponding record output_port of keyword hash_key
In table, and execute following step 11.
10) upper one flowed belonging to the corresponding packets of keyword hash_key is obtained from last_output_port Hash tables
The exit port record of packet is used as output_port.Execute following step 11.
11) packet is sent to next-hop from the port that the port numbers of interchanger are output_port, executes step 6.
Technical solution of the present invention is described in detail With reference to embodiment.The OpenFlow group tables selection of the present invention
Algorithm flow schematic diagram is as shown in Figure 1, concrete operation step is as follows：
1) assume bottom-layer network topology as shown in Fig. 2, TCP transmitting terminals (IP:10.0.0.1Port:3301) it is received with TCP
Hold (IP:10.0.0.2Port:3302) reachable path between has two, respectively：With
2) a group list item is issued on each interchanger by software defined network controller, is issued to interchanger S1 groups list item such as
Shown in lower：
Group_id=1, type=select, selection_method=flowlet_switching, bucket=
output:2, bucket=output:3
3) last_arrive_time Hash tables are initialized：The last one current packet of each stream of Hash table record, which reaches, to be handed over
The time changed planes
4) last_outout_port Hash tables are initialized：The outlet of the last one current packet of each stream of Hash table record
Mouthful.
5) initialization timeout value timeout：It is more to be generally greater than load balancing for distinguishing different stream clusters for the timeout value
The maximum delay of parallel route is poor.Assume in this example that timeout values are 500us.
6) transmitting terminal is sent to the data packet (by taking first three data packet as an example) of receiving terminal and is selected according to group table on interchanger S1
It selects algorithm and carries out following processing (process flow on other interchangers is similar).
6.1.1) interchanger S1 receives first data packet of transmitting terminal, according to five-tuple (inbound port=1, source IP
Location=10.0.0.1, purpose IP address=10.0.0.2, source port=3301, destination interface=3302) calculate the hash of the packet
Value is hash_key, it is assumed that hash_key=100.It is 867674us to record the packet and reach the time arrive_time of interchanger.
6.1.2) there is no the record that keyword is 100 in last_arrive_time Hash tables, then keyword 100 is right
The record arrive_time=867674us answered is added in last_arrive_time Hash tables.Execute following step
6.1.3。
6.1.3) from matched group of list item action bucket collection (bucket=output of the packet:2, bucket=output:3) in
Randomly choose an action bucket (bucket=output:2) port indicated, will be crucial as exit port output_port=2
100 corresponding record output_port=2 of word is added in last_output_port Hash tables.By the packet from the 2 of interchanger
Number port is sent out.
6.2.1) interchanger S1 receives second data packet of transmitting terminal, according to five-tuple (inbound port=1, source IP
Location=10.0.0.1, purpose IP address=10.0.0.2, source port=3301, destination interface=3302) calculate the hash of the packet
Value is 100.It is 868125us to record the packet and reach the time arrive_time of interchanger.
6.2.2 first packet of the correspondence of keyword 100) is obtained from last_arrive_time Hash tables reaches interchanger
Time records last_time=867674us.Keyword 100 is corresponding in update last_arrive_time Hash tables is recorded as
Arrive_time=868125us.Because of arrive_time-last_time=451<500 set up, so executing following step
Rapid 6.2.3.
6.2.3 the exit port note of 100 corresponding first packets of keyword) is obtained from last_output_port Hash tables
Record output_port=2.The packet is sent out from No. 2 ports of interchanger.
6.3.1) interchanger S1 receives the third data packet of transmitting terminal, according to five-tuple (inbound port=1, source IP
Location=10.0.0.1, purpose IP address=10.0.0.2, source port=3301, destination interface=3302) calculate the hash of the packet
Value is 100.It is 868637us to record the packet and reach the time arrive_time of interchanger.
6.3.2 second packet of the correspondence of keyword 100) is obtained from last_arrive_time Hash tables reaches interchanger
Time records last_time=868125us.Keyword 100 is corresponding in update last_arrive_time Hash tables is recorded as
Arrive_time=868637us.Because of arrive_time-last_time=512>500 set up, so executing following step
Rapid 6.3.3.
6.3.3) from matched group of list item action bucket collection (bucket=output of the packet:2, bucket=output:3) in
Randomly choose an action bucket (bucket=output:3) port indicated, will be crucial as exit port output_port=3
100 corresponding record output_port=3 of word is added in last_output_port Hash tables.By the packet from the 3 of interchanger
Number port is sent out.
Claims (2)
1. a kind of stream cluster exchanges routing mechanism OpenFlow group table selection methods, characterized in that steps are as follows：
1) the controller perception bottom-layer network topology of software defined network control plane, calculates source network device and is set to purpose network
A plurality of reachable path between standby；
2) controller using each of interchanger on reachable path up to exit port as the action bucket for organizing list item, and with a group list item
Form be issued on each interchanger；
3) arrival time last time Hash table is initialized：The last one current packet of each stream of Hash table record reach interchanger when
Between；
4) last time time departure Hash table is initialized：The exit port of the last one current packet of each stream of Hash table record；
5) initialization timeout value timeout：The timeout value is greater than that load balancing is a plurality of and walking along the street for distinguishing different stream clusters
The maximum delay of diameter is poor；
6) when the port of interchanger receives data packet, according to including inbound port, source IP address, purpose IP address, source port,
The five-tuple of destination interface calculates the cryptographic Hash hash_key of the packet, and records the time arrive_ that the packet reaches interchanger
time；
7) if there is no the records that keyword is hash_key in arrival time last time Hash table, by keyword hash_key
Corresponding record arrival is added in arrival time last time Hash table；Random choosing is concentrated from the action bucket of corresponding group of list item of the packet
The port of action bucket instruction is selected as exit port output_port, by the corresponding record output_ of keyword hash_key
Port is added in last time time departure Hash table, and executes following step 11, otherwise, executes following step 8；
8) the upper packet flowed belonging to the corresponding packets of keyword hash_key is obtained from arrival time last time Hash table to reach
Time of interchanger records last_time, updates in last time time departure Hash table that keyword hash_key is corresponding to be recorded as
Arrival time, if arrival time arrive_time-it is upper one packet reach interchanger time last_time >=timeout at
It is vertical, then execute following step 9；Otherwise, following step 10 is executed；
9) concentrate the port that one action bucket of random selection indicates as exit port from the action bucket of corresponding group of list item of the packet
The corresponding record output_port of keyword hash_key are added to upper packet exit port last_ by output_port
In output_port Hash tables, and execute following step 11；
10) the upper packet flowed belonging to the corresponding packets of keyword hash_key is obtained from last_output_port Hash tables
Exit port record is used as output_port, executes following step 11；
11) packet is sent to next-hop from the port that the port numbers of interchanger are output_port, executes step 6.
2. stream cluster exchanges routing mechanism OpenFlow group table selection methods as described in claim 1, characterized in that an example
In comprise the concrete steps that：
1) in bottom-layer network topology, TCP transmitting terminals are IP:10.0.0.1Port:3301, TCP receiving terminals are IP:
10.0.0.2Port:3302, the reachable path between sending and receiving end has two, respectively：With
2) a group list item is issued on each interchanger by software defined network controller, is issued to the following institute of interchanger S1 group list items
Show：
Group_id=1, type=select, selection_method=flowlet_switching, bucket=
output:2, bucket=output:3
3) last_arrive_time Hash tables are initialized：The last one current packet of each stream of Hash table record reaches interchanger
Time；
4) last_outout_port Hash tables are initialized：The exit port of the last one current packet of each stream of Hash table record；
5) initialization timeout value timeout：The timeout value is greater than that load balancing is a plurality of and walking along the street for distinguishing different stream clusters
The maximum delay of diameter is poor；
6) transmitting terminal is sent to the data packet of receiving terminal and carries out following processing according to group table selection algorithm on interchanger S1
6.1.1) interchanger S1 receives first data packet of transmitting terminal, and the hash values that the packet is calculated according to five-tuple are
Hash_key, five-tuple are：Inbound port=1, source IP address=10.0.0.1, purpose IP address=10.0.0.2, source port=
3301, destination interface=3302；
6.1.2) there is no the record that keyword is 100 in last_arrive_time Hash tables, then keyword 100 is corresponding
Record arrive_time=867674us is added in last_arrive_time Hash tables, executes following step 6.1.3；
6.1.3) concentrate the port that one action bucket of random selection indicates as exit port from matched group of list item action bucket of the packet
100 corresponding record output_port=2 of keyword is added to last_output_port Hash by output_port=2
In table, which is sent out from No. 2 ports of interchanger；
6.2.1) interchanger S1 receives second data packet of transmitting terminal, and the hash values of the packet are calculated according to five-tuple, record
The packet reaches the time arrive_time of interchanger；
6.2.2 keyword 100) is obtained from last_arrive_time Hash tables corresponds to the time that first packet reaches interchanger
Last_time=867674us is recorded, updates in last_arrive_time Hash tables that keyword 100 is corresponding is recorded as
Arrive_time=868125us；Because of arrive_time-last_time=451<500 set up, so executing following step
Rapid 6.2.3；
6.2.3 the exit port record of 100 corresponding first packets of keyword) is obtained from last_output_port Hash tables
Output_port=2 sends out the packet from No. 2 ports of interchanger；
6.3.1) interchanger S1 receives the third data packet of transmitting terminal, and the hash values that the packet is calculated according to five-tuple are to remember
Record the time arrive_time that the packet reaches interchanger；
6.3.2 keyword 100) is obtained from last_arrive_time Hash tables corresponds to the time that second packet reaches interchanger
It records, keyword 100 is corresponding in update last_arrive_time Hash tables is recorded as arrive_time；Because of arrive_
Time-last_time=512>500 set up, so executing following step 6.3.3；
6.3.3) concentrate the port that one action bucket of random selection indicates as exit port from matched group of list item action bucket of the packet
100 corresponding record output_port=3 of keyword is added to last_output_port Hash by output_port=3
In table；The packet is sent out from No. 3 ports of interchanger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810143048.6A CN108337168B (en) | 2018-02-11 | 2018-02-11 | OpenFlow group table selection method of flow cluster exchange routing mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810143048.6A CN108337168B (en) | 2018-02-11 | 2018-02-11 | OpenFlow group table selection method of flow cluster exchange routing mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108337168A true CN108337168A (en) | 2018-07-27 |
| CN108337168B CN108337168B (en) | 2021-01-05 |
Family
ID=62929409
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810143048.6A Active CN108337168B (en) | 2018-02-11 | 2018-02-11 | OpenFlow group table selection method of flow cluster exchange routing mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108337168B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110061929A (en) * | 2019-03-10 | 2019-07-26 | 天津大学 | For data center's load-balancing method of asymmetrical network |
| CN110460537A (en) * | 2019-06-28 | 2019-11-15 | 天津大学 | Data center's asymmetric topology down-off dispatching method based on packet set |
| CN114793215A (en) * | 2021-12-14 | 2022-07-26 | 合肥哈工轩辕智能科技有限公司 | Distributed system based on load balancing mode asynchronous agent |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140241361A1 (en) * | 2013-02-28 | 2014-08-28 | Texas Instruments Incorporated | Packet processing match and action unit with configurable memory allocation |
| CN104579941A (en) * | 2015-01-05 | 2015-04-29 | 北京邮电大学 | Message classification method in OpenFlow switch |
| CN104702536A (en) * | 2015-03-26 | 2015-06-10 | 清华大学 | Message processing method of OpenFlow switch for wireless communication |
| CN105245363A (en) * | 2015-09-23 | 2016-01-13 | 盛科网络（苏州）有限公司 | Open Flow based linear protection method |
| CN105262692A (en) * | 2015-09-23 | 2016-01-20 | 盛科网络（苏州）有限公司 | Method and device for realizing flow meter information real-time synchronization of openflow switches |
| CN105391636A (en) * | 2015-10-16 | 2016-03-09 | 东南大学 | Interconnection mechanism between software defined network (SDN) subnet and IP subnet in autonomous system |
| WO2016039758A1 (en) * | 2014-09-11 | 2016-03-17 | Hewlett Packard Enterprise Development Lp | Non-minimum cost forwarding for packet-switched networks |
| US9596172B2 (en) * | 2014-06-27 | 2017-03-14 | International Business Machines Corporation | Mechanism for exchange of routing data between controllers |
| CN107222353A (en) * | 2017-07-11 | 2017-09-29 | 中国科学技术大学 | The unrelated software defined network virtual management platform of supported protocol |
| CN107370676A (en) * | 2017-08-03 | 2017-11-21 | 中山大学 | Fusion QoS and load balancing demand a kind of route selection method |
-
2018
- 2018-02-11 CN CN201810143048.6A patent/CN108337168B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140241361A1 (en) * | 2013-02-28 | 2014-08-28 | Texas Instruments Incorporated | Packet processing match and action unit with configurable memory allocation |
| US9596172B2 (en) * | 2014-06-27 | 2017-03-14 | International Business Machines Corporation | Mechanism for exchange of routing data between controllers |
| WO2016039758A1 (en) * | 2014-09-11 | 2016-03-17 | Hewlett Packard Enterprise Development Lp | Non-minimum cost forwarding for packet-switched networks |
| CN104579941A (en) * | 2015-01-05 | 2015-04-29 | 北京邮电大学 | Message classification method in OpenFlow switch |
| CN104702536A (en) * | 2015-03-26 | 2015-06-10 | 清华大学 | Message processing method of OpenFlow switch for wireless communication |
| CN105245363A (en) * | 2015-09-23 | 2016-01-13 | 盛科网络（苏州）有限公司 | Open Flow based linear protection method |
| CN105262692A (en) * | 2015-09-23 | 2016-01-20 | 盛科网络（苏州）有限公司 | Method and device for realizing flow meter information real-time synchronization of openflow switches |
| CN105391636A (en) * | 2015-10-16 | 2016-03-09 | 东南大学 | Interconnection mechanism between software defined network (SDN) subnet and IP subnet in autonomous system |
| CN107222353A (en) * | 2017-07-11 | 2017-09-29 | 中国科学技术大学 | The unrelated software defined network virtual management platform of supported protocol |
| CN107370676A (en) * | 2017-08-03 | 2017-11-21 | 中山大学 | Fusion QoS and load balancing demand a kind of route selection method |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110061929A (en) * | 2019-03-10 | 2019-07-26 | 天津大学 | For data center's load-balancing method of asymmetrical network |
| CN110061929B (en) * | 2019-03-10 | 2021-12-28 | 天津大学 | Data center load balancing method for asymmetric network |
| CN110460537A (en) * | 2019-06-28 | 2019-11-15 | 天津大学 | Data center's asymmetric topology down-off dispatching method based on packet set |
| CN110460537B (en) * | 2019-06-28 | 2023-01-24 | 天津大学 | Packet set-based data center asymmetric topology flow scheduling method |
| CN114793215A (en) * | 2021-12-14 | 2022-07-26 | 合肥哈工轩辕智能科技有限公司 | Distributed system based on load balancing mode asynchronous agent |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108337168B (en) | 2021-01-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2911348B1 (en) | Control device discovery in networks having separate control and forwarding devices | |
| CN106533960B (en) | A kind of data center network method for routing based on Fat-Tree structure | |
| CN102594664B (en) | Flow forwarding method and device | |
| CN104335537B (en) | For the system and method for the multicast multipath of layer 2 transmission | |
| US7586909B1 (en) | Striping algorithm for switching fabric | |
| KR20170060102A (en) | Data forwarding method, device and system in software-defined networking | |
| CN107135158A (en) | Optimal route selection method in a kind of multi-path transmission | |
| JP2015029346A (en) | Communication system, control device, packet transfer route control method, and program | |
| TWI599203B (en) | Network communication system, software-defined network controller and routing method thereof | |
| CN108337168A (en) | It flows cluster and exchanges routing mechanism OpenFlow group table selection methods | |
| CN112350949B (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| CN111711565B (en) | Multi-path routing method oriented to high-speed interconnected dragonfly + network | |
| CN108353026A (en) | Method, system and computer-readable medium for the advanced distribution in link aggregation group | |
| CN105490962A (en) | QoS management method based on OpenFlow network | |
| RU2007111857A (en) | RING NETWORK, COMMUNICATION DEVICE AND OPERATIONAL MANAGEMENT METHOD USED FOR THE RING NETWORK AND COMMUNICATION DEVICE | |
| CN105992297A (en) | SDN-based connection management and forwarding control method and related equipment | |
| CN108123878A (en) | A kind of method for routing, device and data transfer equipment | |
| CN103067294B (en) | Based on the method for the data flow equilibrium treatment of stream order-preserving in multi-next-hop forwarding router | |
| CN110460537A (en) | Data center's asymmetric topology down-off dispatching method based on packet set | |
| CN108600097B (en) | Communication equipment capable of transmitting data in multiple paths, data communication network system and data communication method | |
| JPWO2015151442A1 (en) | COMMUNICATION SYSTEM, COMMUNICATION METHOD, AND CONTROL DEVICE | |
| Cui et al. | A load balancing mechanism for 5G data centers | |
| Alanazi et al. | CAFT: Congestion-aware fault-tolerant load balancing for three-tier clos data centers | |
| Wu | Packet forwarding technologies | |
| CN104580000A (en) | Flow table technology-based RapidIO switching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |