CN106453130A - Flow scheduling system and method based on accurate elephant flow identification - Google Patents
Flow scheduling system and method based on accurate elephant flow identification Download PDFInfo
- Publication number
- CN106453130A CN106453130A CN201610870963.6A CN201610870963A CN106453130A CN 106453130 A CN106453130 A CN 106453130A CN 201610870963 A CN201610870963 A CN 201610870963A CN 106453130 A CN106453130 A CN 106453130A
- Authority
- CN
- China
- Prior art keywords
- elephant
- stream
- flow
- path
- scheduling
- 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.)
- Pending
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/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2483—Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
-
- 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/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a flow scheduling system and method based on accurate elephant flow identification. The system comprises an accurate elephant flow identification module, an elephant flow forwarding path calculation module, and an elephant flow scheduling module, wherein the elephant flow accurate identification module identifies an elephant flow by monitoring a data volume of a TCP queue during a data sending process of a terminal, sets a DSCP field of an IP packet header as an elephant flow identifier, identifies the elephant flow in a network according to the DSCP field of a data packet, calculates the average number of bytes of the flow packet, and deletes the packet from an elephant flow list if the average number of the bytes of the packet is smaller than an elephant flow screening threshold; the elephant flow forwarding path calculation module carries out calculation based on a current routing protocol so as to obtain a path with the maximum available bandwidth, and uses the path with the maximum available bandwidth as the optimum elephant flow forwarding path; and the elephant flow scheduling module sends a flow table to switches on the forwarding path through an SDN controller, so as to achieve elephant flow scheduling. The system and method provided by the invention has the advantage that the elephant flow scheduling efficiency is improved through the accurate elephant flow identification.
Description
Technical field
The invention belongs to network communication field, particularly to a kind of based on elephant stream accurately the flow scheduling system of identification and
Method.
Background technology
With the fast development of Network, the data traffic of explosive growth proposes huge choosing to network management
War, flow scheduling becomes the focus of current research.According to stream carry data volume number network flow can be divided into elephant stream and old
Mouse is flowed, and elephant stream accounts for the 10% about of network flow sum, but it carries the 85% of network total amount of data, has transmission time
Long, occupied bandwidth is big, the feature of negligible amounts, and mouse stream then contrast.Traditional traffic scheduling method is to all-network stream
Carry out indiscriminate scheduling, the more network node load of elephant stream is larger, and the uneven load of each node can reduce network and gulp down
The amount of telling, increase network response time.If the quick, elephant accurately identifying in network is flowed and realizes effective load dispatch, energy
Reduce the probability of network congestion, improve the reliability of network.Software defined network (Software Defined Network,
SDN) it is a kind of network architecture of innovation, it has to turn controls separation, central controlled feature, realizes elephant stream identification based on SDN
And scheduling can effectively lift network traffics dispatching efficiency.At present, also by stream terminal, accurately identification and SDN do not combine and to realize
The pertinent literature of elephant stream scheduling, for this reason, a kind of flow scheduling system based on the accurate identification of elephant stream of this patent design and side
Method.
Content of the invention
It is an object of the invention to provide a kind of flow scheduling system and method accurately being identified based on elephant stream, accurately know
Do not go out the elephant in network to flow and calculate forward-path.The present invention is first depending on feature in host terminal with network for the data flow
Realize the accurate identification of elephant stream, then elephant stream forward-path is calculated according to network link situation, final realization is based on elephant
The flow scheduling that stream accurately identifies, improves the handling capacity of network.
A kind of flow scheduling system accurately being identified based on elephant stream proposed by the present invention, it includes accurately identifying that elephant is flowed
A path module, scheduling elephant flow module are sent out in module, calculating elephant circulation.
1st, accurately identify elephant flow module：Accurately identify for realizing elephant stream in host terminal.By monitoring main frame eventually
The data measure feature that end sends TCP transmit queue storage in data procedures realizes the identification that elephant is flowed, by IP packet header differential service
Code point (Differentiated Services Code Point, DSCP) field is set as elephant flow identifier, and with this
Mark elephant stream.Identify that the elephant in network is flowed and records by packet dscp field, calculate big in each stream each time period
As flowing bag average byte number.If the bag average byte number of elephant stream is less than elephant stream screening threshold value N in network, assert this stream
Do not possess elephant stream feature, it has been rejected from elephant stream list；Otherwise still regard as elephant stream.
2nd, calculate elephant circulation and send out path module：For calculating the forward-path of elephant stream.This module is based on existing route
Agreement is calculated all paths that can transmit elephant stream, and the link available bandwidth information that analysis SDN controller is collected simultaneously compares
Minimum available bandwidth w of each forward-path, the optimal forward-path that the path selecting w value maximum is flowed as elephant.
3rd, dispatch elephant flow module：For being scheduling to the forwarding that elephant is flowed controlling.This module obtains certain elephant stream
Optimal forward-path and flow table is issued to the switch on forward-path by SDN controller, inform how switch forwards
Elephant is flowed, and realizes the scheduling of elephant stream.
A kind of flow scheduling system accurately being identified based on elephant stream proposed by the present invention, as shown in Figure 1.
The inventive method combines stream terminal recognition and the stream screening of feature based realizes the accurate identification of elephant stream and to network
In elephant stream be scheduling, equalising network node load.Before the inventive method is applied, network manager can be according to reality
Situation setting elephant flows accurate recognition threshold M, elephant stream screening threshold value N, elephant flow identifier etc..
A kind of traffic scheduling method accurately being identified based on elephant stream proposed by the present invention, it is as follows：
Step 1, monitoring TCP transmit queue are realized the terminal recognition of elephant stream and are marked.
Send end main frame and TCP is set up to end main frame be connected, to transmission end main frame TCP transmit queue in data transmission procedure
It is monitored, if the data volume of storage is more than M in transmit queue, assert that this stream flows for elephant, this stream packets IP is set
Packet header dscp field is elephant flow identifier；Otherwise regard as mouse stream, be not required to dscp field is configured.
Step 2, foundation dscp field identification elephant are flowed and record and flow list in elephant.
SDN controller is analyzed the packet-in message sent out on switch and is obtained entering the new stream feature of network, if this stream
Dscp field is elephant flow identifier, then by this stream feature record in elephant stream list.
Step 3, monitoring elephant flow each stream traffic characteristic in a network in list.
SDN controller to obtain elephant every T time to SDN switch transmission elephant stream request message and to flow in a network
Traffic characteristic, including the total bit number of hit flow table, the total data bag number of hit flow table, stream duration etc..
Step 4, analysis traffic characteristic, to screen elephant stream, update elephant stream list.
Controller flows, using the elephant that step 3 obtains, the bag average byte that traffic characteristic calculates this elephant stream in T time section
Number, if this value is less than N, assert that this elephant stream has not possessed elephant stream feature, it is rejected from elephant stream list；If
This value is more than N, then assert that this stream still flows for elephant.
Step 5, obtained using ECMP elephant stream all can forward-path
SDN controller is calculated, based on global view and using existing routing protocol, all roads forwarding that elephant is flowed
Footpath, gained path is saved in database.
Step 6, the minimum available bandwidth of each forward-path of calculating simultaneously select elephant to flow optimal forward-path.
The link available bandwidth information that analysis SDN controller is collected, obtains minimum available bandwidth w of each forward-path, choosing
Select the optimal forward-path that the maximum path of w value is flowed as elephant.
Step 7, issue flow table realize elephant stream scheduling.
After determining the optimal forward-path of certain elephant stream, issued to the switch on forward-path by SDN controller
Flow table, informs how switch forwards this elephant to flow, and realizes the scheduling of elephant stream, and the inventive method terminates.
So far, entirely terminated based on the traffic scheduling method that elephant stream accurately identifies, method flow diagram is as shown in Figure 2.
The system and method for the present invention has following two advantages：
(1) after terminal recognition elephant stream, using data flow, Feature Selection elephant in a network is flowed, and improves elephant
The accuracy that stream accurately identifies.
(2) the elephant stream being directed in network implements effective flow scheduling, has equalized the load of network node, has reduced chain
The possibility of roadlock plug, improves network throughput.
Brief description
Fig. 1 is the system block diagram of the present invention.
Fig. 2 is method of the present invention flow chart.
Fig. 3 is embodiment of the present invention network topology schematic diagram
Specific embodiment
Below the preferred embodiment of the present invention is elaborated.
The present embodiment with the application program 1 on host A (Host A) by TCP to host B (Host B) transmission data is
Example, referred to as this connection data flow are ab, and residing network is as shown in Figure 3.In the present embodiment, network manager can arrange stream information and ask
Seek interval T=1s, elephant flows accurate recognition threshold M=1MB, elephant stream screening threshold value N=1000B, elephant flow identifier is
110000, equal-cost route agreement (Equal-Cost Multipath can be adopted during forward-path calculating all elephant streams
Routing, ECMP) realize.
The step of the traffic scheduling method accurately being identified based on elephant stream is as follows：
Step 1, monitoring TCP transmit queue are realized the terminal recognition of elephant stream and are marked.
Main frame is set up TCP with host B and is connected, and sends to B in A and monitors storage in transmit queue in A in data procedures
Data volume is 1.5MB, more than M, then assert that ab flows and flows for elephant, arranging this stream packets IP packet header dscp field is 110000.
Step 2, foundation dscp field identification elephant are flowed and record and flow list in elephant.
The packet-in message comprising ab stream feature sent out on switch analyzed by SDN controller, finds that this stream DSCP is big
As flow identifier, then the feature record that ab flows is flowed in list in elephant.
Step 3, monitoring elephant flow each stream traffic characteristic in a network in list.
SDN controller to obtain ab every the 1s time to SDN switch transmission elephant stream request message and to flow in a network
Traffic characteristic, the total bit number that can obtain the up-to-date hit flow table of ab stream is 19000byte, the total bit number of secondary new hit flow table
For 2400byte, the total data bag number of up-to-date hit flow table is 33, and the total data bag number of secondary new hit flow table is 31.
Step 4, analysis traffic characteristic, to screen elephant stream, update elephant stream list.
The elephant that controller is obtained using step 3 is flowed traffic characteristic and calculates the average byte number of this ab stream packets in 1s and is
1100B, this value is more than N, then assert that this stream still flows for elephant.
Step 5, obtained using ECMP elephant stream all can forward-path
SDN controller is calculated, based on global view and using ECMP agreement, 3 paths that can forward that ab flows, and such as schemes
Shown in 3, path 1 is HA S3 S1 S2 S5 HB, and path 2 is HA S3 S2 S5 HB, and path 3 is HA S3
S1—S5—HB.
Step 6, the minimum available bandwidth of each forward-path of calculating simultaneously select elephant to flow optimal forward-path.
The link available bandwidth information that analysis SDN controller is collected understands, the available bandwidth of HA S3 is 50Mbps, S3
The available bandwidth of S1 is 40Mbps, and the available bandwidth of S1 S2 is 60Mbps, and the available bandwidth of S2 S5 is 30Mbps, S5 HB
Available bandwidth be 50Mbps, the available bandwidth of S3 S2 is 20Mbps, and the available bandwidth of S1 S5 is 40Mbps.Analysis understands
Minimum available bandwidth w in path 11=30Mbps, minimum available bandwidth w in path 22=20Mbps, the minimum in path 3 can use band
Wide w3=40Mbps, selects the optimal forward-path that path 3 is flowed as elephant.
Step 7, issue flow table realize elephant stream scheduling.
After determining that the optimal forward-path of ab stream is path 3, by SDN controller under the switch on forward-path
S3, switch S1, switch S5 issues flow table, informs that this three switches receive the forwarding rule after ab flows, realizes elephant
The scheduling of stream ab, the inventive method terminates.
So far, entirely terminated based on the traffic scheduling method that elephant stream accurately identifies.
A kind of flow scheduling system based on the accurate identification of elephant stream of the present invention, adopt in instances with method example in
Identical scene.Concrete application is as follows：
1st, accurately identify elephant flow module：Host A is set up with host B and is connected and sends data, and this module monitors is sent out in A
The data volume sending storage in queue is 1.5MB, more than M, then assert that ab flows and flows for elephant, then arrange it and set IP packet header DSCP
Field is 110000 marks realizing elephant stream.This module by read ab stream dscp field identify ab flow flow for elephant and incite somebody to action
This stream feature record, in elephant stream list, then sends elephant stream request message to SDN switch to obtain every the 1s time
Ab stream traffic characteristic in a network, the total bit number that can obtain the up-to-date hit flow table of ab stream is 19000byte, secondary new hit
The total bit number of flow table is 2400byte, and the total data bag number of up-to-date hit flow table is 33, secondary hit flow table newly total
Number-of-packet is 31, and can be calculated ab stream bag average byte number in this time period is 1100B.The bag that ab is flowed by this module is average
Byte number and elephant are flowed screening threshold value N and are compared, and this value is more than N, then assert that this stream still flows for elephant.
2nd, calculate elephant circulation and send out path module：This module calculates first by ECMP agreement can transmit 3 that ab flows
The path that can forward, as shown in figure 3, path 1 is HA S3 S1 S2 S5 HB, path 2 is HA S3 S2 S5
HB, path 3 is HA S3 S1 S5 HB.Then the link available bandwidth information that analysis SDN controller is collected understands, HA
The available bandwidth of S3 is 50Mbps, and the available bandwidth of S3 S1 is 40Mbps, and the available bandwidth of S1 S2 is 60Mbps, S2 S5
Available bandwidth be 30Mbps, the available bandwidth of S5 HB is 50Mbps, and the available bandwidth of S3 S2 is 20Mbps, S1 S5's
Available bandwidth is 40Mbps.Analysis understands minimum available bandwidth w in path 11=30Mbps, minimum available bandwidth w in path 22=
20Mbps, minimum available bandwidth w in path 33=40Mbps, selects the optimal forward-path that path 3 is flowed as elephant.
3rd, dispatch elephant flow module：This module passes through SDN controller to S3 under the switch on forward-path, switch
S1, switch S5 issues flow table, informs that this three switches receive the forwarding rule after ab flows, realizes the tune that elephant flows ab
Degree,.
Certainly, those of ordinary skill in the art is it should be appreciated that above example is intended merely to this is described
Bright, and it is not intended as limitation of the invention, as long as within the scope of the invention, to the change of above example, modification all
Protection scope of the present invention will be fallen into.
Claims (10)
1. a kind of based on elephant stream accurately identification flow scheduling system it is characterised in that：Comprise accurately to identify elephant flow module,
Calculate elephant circulation and send out path module and scheduling elephant flow module.
2. the flow scheduling system accurately being identified based on elephant stream according to claim 1, it accurately identifies elephant stream mould
Block is characterised by：The data measure feature sending TCP transmit queue storage in data procedures by monitoring host terminal is realized greatly
As the identification of stream, and the dscp field in IP packet header is set as elephant flow identifier.
3. the flow scheduling system accurately being identified based on elephant stream according to claim 1, it accurately identifies elephant stream mould
Block is characterised by：Identify that the elephant in network is flowed and records by packet dscp field, calculate in each stream each time period
Elephant flows bag average byte number, if the bag average byte number of elephant stream is less than elephant stream screening threshold value in network, assert should
Stream has not possessed elephant stream feature, and it is rejected from elephant stream list；Otherwise still regard as elephant stream.
4. the flow scheduling system accurately being identified based on elephant stream according to claim 1, it calculates elephant circulation and sends out road
Footpath module is characterised by：It is calculated all paths that can transmit elephant stream based on existing routing protocol, analyze SDN controller
The link available bandwidth information collected minimum available bandwidth w comparing each forward-path, select the maximum path of w value as big
Optimal forward-path as stream.
5. the flow scheduling system accurately being identified based on elephant stream according to claim 1, its scheduling elephant flow module
It is characterised by：Obtain the optimal forward-path of elephant stream and stream is issued to the switch on this forward-path by SDN controller
Table, informs how switch forwards elephant to flow, and realizes the scheduling of elephant stream.
6. a kind of traffic scheduling method accurately being identified based on elephant stream is it is characterised in that comprise the steps of：
Step 1, monitoring TCP transmit queue are realized the terminal recognition of elephant stream and are marked；
Step 2, foundation dscp field identification elephant are flowed and record and flow list in elephant；
Step 3, monitoring elephant flow each stream traffic characteristic in a network in list；
Step 4, analysis traffic characteristic, to screen elephant stream, update elephant stream list；
Step 5, obtained using ECMP elephant stream all can forward-path；
Step 6, the minimum available bandwidth of each forward-path of calculating simultaneously select elephant to flow optimal forward-path；
Step 7, issue flow table realize elephant stream scheduling.
7. the traffic scheduling method accurately being identified based on elephant stream according to claim 6, its step 3 is characterised by：SDN
The spacing of controls set time sends elephant to SDN switch and flows request message to obtain elephant stream flow spy in a network
Levy, including the total bit number of hit flow table, the total data bag number of hit flow table, stream duration etc..
8. the traffic scheduling method accurately being identified based on elephant stream according to claim 6, its step 4 is characterised by：Control
Device processed utilizes elephant to flow the bag average byte number that traffic characteristic calculates this elephant stream in fixed time period, if this value is less than N,
Assert that this elephant stream has not possessed elephant stream feature, it is rejected from elephant stream list；If this value is more than N, assert should
Stream still flows for elephant.
9. the traffic scheduling method accurately being identified based on elephant stream according to claim 6, its step 6 is characterised by：Point
The link available bandwidth information that analysis SDN controller is collected, obtains minimum available bandwidth w of each forward-path, selects w value maximum
The optimal forward-path that path is flowed as elephant.
10. the traffic scheduling method accurately being identified based on elephant stream according to claim 6, its step 7 is characterised by：Really
After determining the optimal forward-path of elephant stream, accurate elephant flow table is issued to the switch on forward-path by SDN controller,
Inform how switch forwards this elephant to flow, realize the scheduling of elephant stream.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610870963.6A CN106453130A (en) | 2016-09-30 | 2016-09-30 | Flow scheduling system and method based on accurate elephant flow identification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610870963.6A CN106453130A (en) | 2016-09-30 | 2016-09-30 | Flow scheduling system and method based on accurate elephant flow identification |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106453130A true CN106453130A (en) | 2017-02-22 |
Family
ID=58172580
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610870963.6A Pending CN106453130A (en) | 2016-09-30 | 2016-09-30 | Flow scheduling system and method based on accurate elephant flow identification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106453130A (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108696446A (en) * | 2018-07-30 | 2018-10-23 | 网宿科技股份有限公司 | A kind of update method of traffic characteristic information, device and Centroid server |
| CN109614215A (en) * | 2019-01-25 | 2019-04-12 | 广州大学 | Stream scheduling method, device, equipment and medium based on deeply study |
| CN110677324A (en) * | 2019-09-30 | 2020-01-10 | 华南理工大学 | Elephant flow two-stage detection method based on sFlow sampling and controller active update list |
| CN111262756A (en) * | 2020-01-20 | 2020-06-09 | 长沙理工大学 | High-speed network elephant flow accurate measurement method and structure |
| CN111970211A (en) * | 2020-08-13 | 2020-11-20 | 苏州盛科科技有限公司 | Elephant flow processing method and device based on IPFIX |
| CN112615798A (en) * | 2020-11-25 | 2021-04-06 | 华南师范大学 | Bandwidth allocation method and device based on elephant flow reservation |
| CN113079102A (en) * | 2020-01-03 | 2021-07-06 | 中国移动通信有限公司研究院 | Elephant flow multi-stage scheduling method, device, equipment and storage medium |
| CN113746700A (en) * | 2021-09-02 | 2021-12-03 | 中国人民解放军国防科技大学 | Elephant flow rapid detection method and system based on probability sampling |
| US11252078B2 (en) * | 2017-04-11 | 2022-02-15 | Huawei Technologies Co., Ltd. | Data transmission method and apparatus |
| CN114070758A (en) * | 2021-12-20 | 2022-02-18 | 重庆邮电大学 | Flow table optimization method and device based on SDN network |
| TWI763261B (en) * | 2021-01-19 | 2022-05-01 | 瑞昱半導體股份有限公司 | Data flow classification device |
| CN114615200A (en) * | 2022-03-14 | 2022-06-10 | 芯河半导体科技(无锡)有限公司 | Elephant flow detection method and device based on ACL |
| CN114827042A (en) * | 2021-01-22 | 2022-07-29 | 瑞昱半导体股份有限公司 | Data flow classification device |
| CN114866488A (en) * | 2021-01-18 | 2022-08-05 | 阿里巴巴集团控股有限公司 | Information flow identification method, network chip and network equipment |
| CN114884883A (en) * | 2022-06-16 | 2022-08-09 | 深圳星云智联科技有限公司 | Flow forwarding method, device, equipment and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103379042A (en) * | 2012-04-25 | 2013-10-30 | 丛林网络公司 | Path weighted equal-cost multipath |
-
2016
- 2016-09-30 CN CN201610870963.6A patent/CN106453130A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103379042A (en) * | 2012-04-25 | 2013-10-30 | 丛林网络公司 | Path weighted equal-cost multipath |
Non-Patent Citations (3)
| Title |
|---|
| A. R. CURTIS, W. KIM AND P. YALAGANDULA: ""Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection"", 《2011 PROCEEDINGS IEEE INFOCOM》 * |
| C. BI, X. LUO, T. YE AND Y. JIN: ""On precision and scalability of elephant flow detection in data center with SDN"", 《2013 IEEE GLOBECOM WORKSHOPS》 * |
| PENG XIAO, WENYU QU, HENG QI, YUJIE XU AND ZHIYANG LI: ""An efficient elephant flow detection with cost-sensitive in SDN"", 《2015 1ST INTERNATIONAL CONFERENCE ON INDUSTRIAL NETWORKS AND INTELLIGENT SYSTEMS》 * |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11252078B2 (en) * | 2017-04-11 | 2022-02-15 | Huawei Technologies Co., Ltd. | Data transmission method and apparatus |
| CN108696446A (en) * | 2018-07-30 | 2018-10-23 | 网宿科技股份有限公司 | A kind of update method of traffic characteristic information, device and Centroid server |
| CN108696446B (en) * | 2018-07-30 | 2022-01-25 | 网宿科技股份有限公司 | Method and device for updating flow characteristic information and central node server |
| CN109614215A (en) * | 2019-01-25 | 2019-04-12 | 广州大学 | Stream scheduling method, device, equipment and medium based on deeply study |
| CN110677324A (en) * | 2019-09-30 | 2020-01-10 | 华南理工大学 | Elephant flow two-stage detection method based on sFlow sampling and controller active update list |
| CN110677324B (en) * | 2019-09-30 | 2023-02-14 | 华南理工大学 | Elephant flow two-stage detection method based on sFlow sampling and controller active update list |
| CN113079102A (en) * | 2020-01-03 | 2021-07-06 | 中国移动通信有限公司研究院 | Elephant flow multi-stage scheduling method, device, equipment and storage medium |
| CN111262756A (en) * | 2020-01-20 | 2020-06-09 | 长沙理工大学 | High-speed network elephant flow accurate measurement method and structure |
| CN111262756B (en) * | 2020-01-20 | 2022-05-06 | 长沙理工大学 | High-speed network elephant flow accurate measurement method and device |
| CN111970211A (en) * | 2020-08-13 | 2020-11-20 | 苏州盛科科技有限公司 | Elephant flow processing method and device based on IPFIX |
| CN112615798A (en) * | 2020-11-25 | 2021-04-06 | 华南师范大学 | Bandwidth allocation method and device based on elephant flow reservation |
| CN112615798B (en) * | 2020-11-25 | 2022-05-17 | 华南师范大学 | Bandwidth allocation method and device based on elephant flow reservation |
| CN114866488A (en) * | 2021-01-18 | 2022-08-05 | 阿里巴巴集团控股有限公司 | Information flow identification method, network chip and network equipment |
| TWI763261B (en) * | 2021-01-19 | 2022-05-01 | 瑞昱半導體股份有限公司 | Data flow classification device |
| CN114827042A (en) * | 2021-01-22 | 2022-07-29 | 瑞昱半导体股份有限公司 | Data flow classification device |
| CN113746700A (en) * | 2021-09-02 | 2021-12-03 | 中国人民解放军国防科技大学 | Elephant flow rapid detection method and system based on probability sampling |
| CN113746700B (en) * | 2021-09-02 | 2023-04-07 | 中国人民解放军国防科技大学 | Elephant flow rapid detection method and system based on probability sampling |
| CN114070758A (en) * | 2021-12-20 | 2022-02-18 | 重庆邮电大学 | Flow table optimization method and device based on SDN network |
| CN114070758B (en) * | 2021-12-20 | 2023-07-18 | 重庆邮电大学 | SDN network-based flow table optimization method and device |
| CN114615200A (en) * | 2022-03-14 | 2022-06-10 | 芯河半导体科技(无锡)有限公司 | Elephant flow detection method and device based on ACL |
| CN114884883A (en) * | 2022-06-16 | 2022-08-09 | 深圳星云智联科技有限公司 | Flow forwarding method, device, equipment and storage medium |
| CN114884883B (en) * | 2022-06-16 | 2024-01-30 | 深圳星云智联科技有限公司 | Traffic forwarding method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106453130A (en) | Flow scheduling system and method based on accurate elephant flow identification | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN103190126B (en) | Communication system, control device, packet forwarding path control method and program | |
| CN104158753B (en) | Dynamic stream scheduling method and system based on software defined network | |
| CN108833279B (en) | Method for multi-constraint QoS routing based on service classification in software defined network | |
| US11496399B2 (en) | Dynamically balancing traffic in a fabric using telemetry data | |
| CN1322710C (en) | Method of management of communicating quantity, and entry router executing such method | |
| US8565227B2 (en) | Mobile IP data communication system comprising a mobile router that detects a change in connection status | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN102170663B (en) | 3G (The Third Generation Telecommunication)-based method and equipment for guaranteeing service quality in real-time transmission service | |
| JP2007502584A (en) | Automatic IP traffic optimization in mobile communication systems | |
| CN106453129A (en) | Elephant flow two-level identification system and method | |
| JP6092409B2 (en) | Method and apparatus for evaluating wireless network capillary performance | |
| CN101536571A (en) | A method for improved congestion detection and control in a wireless telecommunications systems | |
| CN103765834B (en) | For minimizing the soft method and device seized seized in data network | |
| CN110913414A (en) | QoS guarantee system of 5G satellite convergence network | |
| JP2013535895A (en) | Communication system, node, statistical information collecting apparatus, statistical information collecting method and program | |
| EP2652985B1 (en) | Performance monitoring in a mobile communication network | |
| CN101166153B (en) | A method for controlling network service | |
| CN106230722A (en) | SDN congestion link method of adjustment based on transfer value | |
| CN109660465A (en) | A kind of car networking load balancing method for routing of roadside unit auxiliary | |
| TWI638552B (en) | Control device, information control method, and recording medium for recording computer program | |
| CN103096386A (en) | Data business flow control method based on signaling analyzing | |
| US20150117218A1 (en) | Feedback-based Profiling for Transport Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170222 |
|
| RJ01 | Rejection of invention patent application after publication |