CN107483354A - Network congestion based on SDN solves method and system - Google Patents
Network congestion based on SDN solves method and system Download PDFInfo
- Publication number
- CN107483354A CN107483354A CN201710764647.5A CN201710764647A CN107483354A CN 107483354 A CN107483354 A CN 107483354A CN 201710764647 A CN201710764647 A CN 201710764647A CN 107483354 A CN107483354 A CN 107483354A
- Authority
- CN
- China
- Prior art keywords
- path
- network congestion
- network
- sdn
- data flow
- 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/12—Avoiding congestion; Recovering from congestion
-
- 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/11—Identifying congestion
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
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 kind of network congestion based on SDN to solve method and system, and method mainly includes the following steps that：Obtain topology information：Obtain network Global Topological information；Determine forward-path：The forward-path of data flow is determined by calculating path load；Distribute forward-path：Forwarding data flow is carried out using the forward-path of determination.The present invention is by obtaining topology information, determining forward-path and distributing forward-path measure to solve the problems, such as network congestion, there is node to be in blocked state when detecting in network, one or more of suitable data flows are selected to carry out heavy-route in obstruction node, and the different pieces of information bag of same data flow is set to carry out forwarding transmission using different paths, and source host is notified to reduce the speed for sending packet, not only effect solves the problems, such as network congestion, and computing cost is small, and the forward-path of guarantee data flow is optimal path.
Description
Technical field
The present invention relates to network communication technology field, more particularly to a kind of network congestion based on SDN to solve method and be
System.
Background technology
Current huge data center can realize the storage of the calculating task and magnanimity information of magnanimity, provide the user cloud
Service is calculated, and success is achieved in business application.Cloud computing technology develops the change for having driven data center, number rapidly
Resource can be effectively integrated according to center, improve resource utilization, the saving energy, reduction operating cost.Data center is information system
The core of system, major function are to provide a user information service by network.Data center is by virtualization technology by resource structure
Dynamic virtualization pool is built up, cloud computing resources automatic deployment, dynamic expansion can be realized using virtual resource administrative skill
With the function of distribution according to need.
SDN (Software Defined Network, software defined network) is a kind of new network based on software
Framework and technology, its core are that control plane is separated with datum plane, flexible DLL opens.Contrast traditional net
Network, SDN technologies instead of original Routing Protocol auto-negotiation mode by Centralized Controller, greatly improve the management and control of network
Efficiency and degree of opening.Under cloud computing background in Method on Dense Type of Data Using center, SDN technologies can provide extensive, high expansion, spirit
The network demand such as scheduling of resource and high bandwidth living, show the natural characteristic for being applied to new types of data central site network, therefore SDN
Primary application scenarios be data center network；SDN technologies face problems and challenge.
The problem of network congestion, often occurs for current data central site network, and traditional solution network congestion scheme is：Produce
One random number writes on packet header as mark, and intermediate router determines the routing plan of packet, the route side according to mark
Case is to select K bar shortest paths per data stream in advance, when blocking, travels through this K paths in order until looking for
The path do not blocked to one, still, this traditional solution network congestion scheme computing cost are big.
The content of the invention
For the deficiency of above-mentioned technology, the embodiments of the invention provide a kind of network congestion based on SDN solve method and
System, the problem of it can effectively solve the problem that network congestion, and computing cost is small.
The embodiment of the present invention solves its technical problem and adopted the technical scheme that：
On the one hand, there is provided a kind of network congestion based on SDN solves method, and it comprises the following steps：
Obtain topology information：Obtain network Global Topological information；
Determine forward-path：The forward-path of data flow is determined by calculating path load；
Distribute forward-path：Forwarding data flow is carried out using the forward-path of determination.
As a kind of possible implementation of the present embodiment, the process of the acquisition topology information is：Utilize LLDP agreements
Obtain network Global Topological information.
As a kind of possible implementation of the present embodiment, the process of the determination forward-path is：Calculate first any
All paths between two nodes, and path is ranked up according to the mode of hop count ascending order, every road is then calculated successively
The load of each link in footpath, and the maximum load of every paths is counted, if the load in path decides that more than threshold value
For obstruction, then forward-path of the path for selecting not block as data flow.
As a kind of possible implementation of the present embodiment, the threshold settings are link utilization=90%.
As a kind of possible implementation of the present embodiment, the process of the distribution forward-path is：By the forwarding of determination
Path is respectively allocated to the different pieces of information bag of data flow, and all packets of same data stream are carried out by different forward-paths
Forward simultaneously.
As a kind of possible implementation of the present embodiment, the network congestion based on SDN of the present embodiment solves method also
Including step：
Reduce the transmission rate of source host.
As a kind of possible implementation of the present embodiment, the process of the transmission rate for reducing source host is：Calculate
The cache size of destination host, source host is then notified to reduce the speed for sending packet in the event of network congestion.
On the other hand, additionally provide a kind of network congestion based on SDN and solve method, it is characterized in that, when detecting network
In when thering is the node to be in blocked state, select one or more of suitable data flows to carry out heavy-route in obstruction node, and drop
Low transmission rate.
As a kind of possible implementation of the present embodiment, the process for carrying out heavy-route comprises the following steps：
Obtain topology information：Obtain network Global Topological information；
Determine forward-path：The forward-path of data flow is determined by calculating path load；
Distribute forward-path：Forwarding data flow is carried out using the forward-path of determination.
As a kind of possible implementation of the present embodiment, the process of the acquisition topology information is：Utilize LLDP agreements
Obtain network Global Topological information.
As a kind of possible implementation of the present embodiment, the process of the determination forward-path is：Calculate first any
All paths between two nodes, and path is ranked up according to the mode of hop count ascending order, every road is then calculated successively
The load of each link in footpath, and the maximum load of every paths is counted, if the load in path decides that more than threshold value
For obstruction, then forward-path of the path for selecting not block as data flow.
As a kind of possible implementation of the present embodiment, the threshold settings are link utilization=90%.
As a kind of possible implementation of the present embodiment, the process of the distribution forward-path is：By the forwarding of determination
Path is respectively allocated to the different pieces of information bag of data flow, and all packets of same data stream are carried out by different forward-paths
Forward simultaneously.
As a kind of possible implementation of the present embodiment, the process of the reduction transmission rate is：Calculate destination host
Cache size, then notified in the event of network congestion source host reduce send packet speed.
Another further aspect, additionally provide a kind of network congestion based on SDN and solve system, including：
Occlusion detection module, to detect whether network blocks；
Topology Discovery module, to obtain network Global Topological information；
Forward-path determining module, to determine the forward-path of data flow by calculating path load；
Forward-path distribute module, to carry out forwarding data flow using the forward-path determined；
Flow table issuance module, the speed of packet is sent to notify source host to be reduced when network congestion occurs.
As a kind of possible implementation of the present embodiment, the process whether the detection network blocks is：Pass through
Query messages detection port and Link State are issued, when the threshold value more than setting, i.e. link utilization reaches 90% and decided that
For obstruction.As a kind of possible implementation of the present embodiment, the Topology Discovery module is by sending LLDP information to each
OpenFlow interchangers obtain network Global Topological information.
As a kind of possible implementation of the present embodiment, the process for calculating path load includes calculating linkage length
Process and calculate link load process, it is described calculate linkage length process be：By calculating between any two node
All possible path, and according to the order of hop count from small to large to all possible paths ordering；The calculating link load
Process be：By detecting uninterrupted and link utilization on link, by periodically being sent to OpenFlow interchangers
Status request message obtains, and then calculates the maximum load in path according to the load of each of the links.
Technical scheme provided in an embodiment of the present invention has the advantages that：
Embodiments of the invention technical scheme proposes a kind of data center's obstructive root canal mechanism based on SDN, and it passes through
Obtain topology information, determine forward-path and distribution forward-path measure solves the problems, such as network congestion, when detecting network
In there is node to be in blocked state, select one or more of suitable data flows to carry out heavy-route in obstruction node, and make same
The different pieces of information bag of one data flow carries out forwarding transmission using different paths, and notifies source host reduces to send packet
Speed, so not only effect solves the problems, such as network congestion, and computing cost is small, and ensures the forward-path of data flow for most
Shortest path.
Brief description of the drawings
With reference to Figure of description, the present invention will be described.
Fig. 1 is that a kind of network congestion based on SDN according to an exemplary embodiment solves the flow chart of method；
Fig. 2 is that another network congestion based on SDN according to an exemplary embodiment solves the flow chart of method；
Fig. 3 is that a kind of network congestion based on SDN according to an exemplary embodiment solves the block diagram of system.
Embodiment
For the technical characterstic for illustrating this programme can be understood, below by embodiment, and its accompanying drawing is combined, to this hair
It is bright to be described in detail.Following disclosure provides many different embodiments or example is used for realizing the different knots of the present invention
Structure.In order to simplify disclosure of the invention, hereinafter the part and setting of specific examples are described.In addition, the present invention can be with
Repeat reference numerals and/or letter in different examples.This repetition is that for purposes of simplicity and clarity, itself is not indicated
Relation between various embodiments are discussed and/or set.It should be noted that part illustrated in the accompanying drawings is not necessarily to scale
Draw.Present invention omits the description to known assemblies and treatment technology and process to avoid being unnecessarily limiting the present invention.
Fig. 1 is that a kind of network congestion based on SDN according to an exemplary embodiment solves the flow chart of method.Such as
Shown in Fig. 1, the network congestion based on SDN in the present embodiment solves method and may comprise steps of：
S11, obtain topology information：Obtain network Global Topological information；
S12, determine forward-path：The forward-path of data flow is determined by calculating path load；
S13, distribute forward-path：Forwarding data flow is carried out using the forward-path of determination.
In a kind of possible implementation, the process of the acquisition topology information is：Network is obtained using LLDP agreements
Global Topological information.
In a kind of possible implementation, the process of the determination forward-path is：Any two node is calculated first
Between all paths, and path is ranked up according to the mode of hop count ascending order (i.e. the order of hop count from small to large), then
The load of each link in calculating successively per paths, and the maximum load of every paths is counted, if the load in path surpasses
Threshold value (i.e. link utilization reaches 90%) is crossed it is determined that obstruction, then forwarding of the path for selecting not block as data flow
Path.
In a kind of possible implementation, the process of the distribution forward-path is：The forward-path of determination is distinguished
The different pieces of information bag of data flow is distributed to, all packets of same data stream by different forward-paths simultaneously turn
Hair.
In a kind of possible implementation, the network congestion based on SDN of the present embodiment, which solves method, to be included
Step：Reduce the transmission rate of source host.It is described reduce source host the process of transmission rate be：Calculate the caching of destination host
Size, source host is then notified to reduce the speed for sending packet in the event of network congestion.
The technical scheme of the present embodiment is by obtaining topology information, determining forward-path and distributing forward-path measure to solve
Certainly the problem of network congestion, so not only effect solves the problems, such as network congestion, and computing cost is small, and ensures data flow
Forward-path is optimal path.
Fig. 2 is that another network congestion based on SDN according to an exemplary embodiment solves the flow chart of method.
When detect in network there is node to be in blocked state when, select one or more of suitable data flows to be carried out in obstruction node
Heavy-route, and reduce transmission rate.
As shown in Fig. 2 the network congestion based on SDN in the present embodiment, which solves method, can enter oneself for the examination following steps：
S21, network congestion detection：Enter next step when detecting in network and thering is node to be in blocked state；
S22, obtain topology information：Obtain network Global Topological information；
S23, determine forward-path：The forward-path of data flow is determined by calculating path load；
S24, distribute forward-path：Forwarding data flow is carried out using the forward-path of determination；
S25, reduce transmission rate：The speed for sending packet is reduced by source host.
The cache size of destination host is calculated, then notifies source host to reduce the speed for sending packet in the event of network congestion
Rate.
In a kind of possible implementation, the process of the network congestion detection is：Detected by issuing query messages
The state of each port and link in network, when the threshold value (link utilization 90%) more than setting it is determined that network hinders
Plug.
In a kind of possible implementation, the process of the acquisition topology information is：Network is obtained using LLDP agreements
Global Topological information.
In a kind of possible implementation, the process of the determination forward-path is：Any two node is calculated first
Between all paths, and path is ranked up according to the mode of hop count ascending order (i.e. the order of hop count from small to large), then
The load of each link in calculating successively per paths, and the maximum load of every paths is counted, if the load in path surpasses
Threshold value (i.e. link utilization reaches 90%) is crossed it is determined that obstruction, then forwarding of the path for selecting not block as data flow
Path.
In a kind of possible implementation, the process of the distribution forward-path is：The forward-path of determination is distinguished
The different pieces of information bag of data flow is distributed to, all packets of same data stream by different forward-paths simultaneously turn
Hair.
In a kind of possible implementation, the process of the transmission rate for reducing source host is：Calculate destination host
Cache size, then notified in the event of network congestion source host reduce send packet speed.
Embodiments of the invention technical scheme proposes a kind of data center's obstructive root canal mechanism based on SDN, works as detection
There is node to be in blocked state into network, select one or more of suitable data flows to carry out heavy-route in obstruction node,
And the different pieces of information bag of same data flow is carried out forwarding transmission using different paths, and notify source host reduces to send number
According to the speed of bag, not only effect solves the problems, such as network congestion, and computing cost is small, and the forward-path of guarantee data flow is
Optimal path.
Fig. 3 is that a kind of network congestion based on SDN according to an exemplary embodiment solves the block diagram of system.Such as figure
Shown in 3, the network congestion based on SDN, which solves system, to be included：
Occlusion detection module, to detect whether network blocks；
Topology Discovery module, to obtain network Global Topological information；
Forward-path determining module, to determine the forward-path of data flow by calculating path load；
Forward-path distribute module, to carry out forwarding data flow using the forward-path determined；
Flow table issuance module, the speed of packet is sent to notify source host to be reduced when network congestion occurs.
As a kind of possible implementation of the present embodiment, the process whether the detection network blocks is：Pass through
Query messages detection port and Link State are issued, when the threshold value more than setting, i.e. link utilization reaches 90% and decided that
For obstruction.As a kind of possible implementation of the present embodiment, the Topology Discovery module is by sending LLDP information to each
OpenFlow interchangers obtain network Global Topological information.
As a kind of possible implementation of the present embodiment, the process for calculating path load includes calculating linkage length
Process and calculate link load process, it is described calculate linkage length process be：By calculating between any two node
All possible path, and according to the order of hop count from small to large to all possible paths ordering；The calculating link load
Process be：By detecting uninterrupted and link utilization on link, by periodically being sent to OpenFlow interchangers
Status request message obtains, and then calculates the maximum load in path according to the load of each of the links.
Modules in the system of network congestion solution described in the present embodiment are arranged in SDN controllers.Topology hair
Existing module is to allow SDN controllers to grasp global topology information, and LLDP is sent by openflow.discovery units
Topology information of the information to each OpenFlow switch queries network.Forward-path determining module mainly calculate linkage length and
The aspect index of link load two, wherein, the length that path includes link is embodied in hop count, by calculate any two node it
Between all possible path, and according to the order of hop count from small to large to all possible paths ordering, while routing information
Storage is in the controller；Link load passes through controller week mainly by detecting uninterrupted and link utilization on link
Being obtained to OpenFlow interchangers transmission status request message for phase property, then calculates path most according to the load of each of the links
Heavy load.Occlusion detection module is to detect whether network blocks in time, then starts obstructive root canal in the event of obstruction
Algorithm, to data center network scheduling of resource, solves the problems, such as network congestion.SDN controllers can be examined by issuing query messages
Port and Link State are surveyed, when the threshold value (link utilization 90%) more than setting it is determined that obstruction, starts obstructive root canal
Algorithm issues the message for reducing data package transmission velocity to source end host simultaneously.Interchanger in SDN only turns to packet
Hair processing,
Interchanger is by forward-path distribute module and flow table issuance module addition forwarding rule and according to the flow table of renewal
The flow is instructed to forward.Wherein, forwarding rule is encapsulated into Packet_out message and is handed down to support by controller
OpenFlow interchanger, interchanger flow table can dynamically update in real time with congestion control algorithm, and expired flow table
Item can be deleted.
The term that the application is related to is as follows：
SDN (Software Defined Network, software defined network):It is a kind of new network wound of Emulex networks
New architecture, is a kind of implementation of network virtualization, and its core technology OpenFlow is by by network equipment chain of command and number
Separated according to face, it is achieved thereby that the flexible control of network traffics, makes network become more intelligent as pipeline.
LLDP (Link Layer Discovery Protocol Link Layer Discovery Protocols)：Be a manufacturer it is unrelated two
Layer protocol, it allows the network equipment to notice device identification and the performance of oneself in local subnet.
OpenFlow networks：By OpenFlowswitch (OpenFlow interchangers), FlowVisor (network virtualization layer)
Formed with Controller (controller) three parts.
Simply the preferred embodiment of the present invention described above, for those skilled in the art,
Without departing from the principles of the invention, some improvements and modifications can also be made, these improvements and modifications are also regarded as this hair
Bright protection domain.
Claims (10)
1. a kind of network congestion based on SDN solves method, it is characterized in that, comprise the following steps：
Obtain topology information：Obtain network Global Topological information；
Determine forward-path：The forward-path of data flow is determined by calculating path load；
Distribute forward-path：Forwarding data flow is carried out using the forward-path of determination.
2. the network congestion according to claim 1 based on SDN solves method, it is characterized in that, the acquisition topology information
Process be：Network Global Topological information is obtained using LLDP agreements.
3. the network congestion according to claim 1 based on SDN solves method, it is characterized in that, the determination forward-path
Process be：All paths between any two node are calculated first, and path is arranged according to the mode of hop count ascending order
Sequence, the load of each link in then calculating successively per paths, and the maximum load of every paths is counted, if path
Load exceedes threshold value it is determined that obstruction, then forward-path of the path for selecting not block as data flow.
4. the network congestion according to claim 1 based on SDN solves method, it is characterized in that, the distribution forward-path
Process be：The forward-path of determination is respectively allocated to the different pieces of information bag of data flow, all packets of same data stream
By different forward-paths forward simultaneously.
5. the network congestion based on SDN according to claim 1-4 any one solves method, it is characterized in that, in addition to
Step：
Reduce the transmission rate of source host.
6. the network congestion according to claim 5 based on SDN solves method, it is characterized in that, the reduction source host
The process of transmission rate is：The cache size of destination host is calculated, then notifies source host reduces to send in the event of network congestion
The speed of packet.
7. a kind of network congestion based on SDN solves method, it is characterized in that, there is node to be in blocked state when detecting in network
When, select one or more of suitable data flows to carry out heavy-route in obstruction node, and reduce transmission rate.
8. the network congestion according to claim 7 based on SDN solves method, it is characterized in that, the progress heavy-route
Process comprises the following steps：
Obtain topology information：Obtain network Global Topological information；
Determine forward-path：The forward-path of data flow is determined by calculating path load；
Distribute forward-path：Forwarding data flow is carried out using the forward-path of determination.
9. the network congestion according to claim 7 based on SDN solves method, it is characterized in that, the reduction transmission rate
Process be：The cache size of destination host is calculated, then notifies source host reduces to send packet in the event of network congestion
Speed.
10. a kind of network congestion based on SDN solves system, it is characterized in that, including：
Occlusion detection module, to detect whether network blocks；
Topology Discovery module, to obtain network Global Topological information；
Forward-path determining module, to determine the forward-path of data flow by calculating path load；
Forward-path distribute module, to carry out forwarding data flow using the forward-path determined；
Flow table issuance module, the speed of packet is sent to notify source host to be reduced when network congestion occurs.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710764647.5A CN107483354A (en) | 2017-08-30 | 2017-08-30 | Network congestion based on SDN solves method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710764647.5A CN107483354A (en) | 2017-08-30 | 2017-08-30 | Network congestion based on SDN solves method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107483354A true CN107483354A (en) | 2017-12-15 |
Family
ID=60603153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710764647.5A Pending CN107483354A (en) | 2017-08-30 | 2017-08-30 | Network congestion based on SDN solves method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107483354A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379163A (en) * | 2018-09-05 | 2019-02-22 | 新华三技术有限公司 | A kind of message forwarding rate control method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209669A (en) * | 2016-06-30 | 2016-12-07 | 中国人民解放军国防科学技术大学 | Towards SDN data center network maximum of probability path stream scheduling method and device |
| CN106230722A (en) * | 2016-08-05 | 2016-12-14 | 山东省计算中心（国家超级计算济南中心） | SDN congestion link method of adjustment based on transfer value |
| CN106357547A (en) * | 2016-09-08 | 2017-01-25 | 重庆邮电大学 | Software-defined network congestion control algorithm based on stream segmentation |
| CN106411733A (en) * | 2016-09-08 | 2017-02-15 | 重庆邮电大学 | SDN dynamic load balanced scheduling method based on real-time load of link |
-
2017
- 2017-08-30 CN CN201710764647.5A patent/CN107483354A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209669A (en) * | 2016-06-30 | 2016-12-07 | 中国人民解放军国防科学技术大学 | Towards SDN data center network maximum of probability path stream scheduling method and device |
| CN106230722A (en) * | 2016-08-05 | 2016-12-14 | 山东省计算中心（国家超级计算济南中心） | SDN congestion link method of adjustment based on transfer value |
| CN106357547A (en) * | 2016-09-08 | 2017-01-25 | 重庆邮电大学 | Software-defined network congestion control algorithm based on stream segmentation |
| CN106411733A (en) * | 2016-09-08 | 2017-02-15 | 重庆邮电大学 | SDN dynamic load balanced scheduling method based on real-time load of link |
Non-Patent Citations (1)
| Title |
|---|
| 樊自甫 等: "基于流量调度的SDN数据中心网络拥塞控制算法", 《计算机科学》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379163A (en) * | 2018-09-05 | 2019-02-22 | 新华三技术有限公司 | A kind of message forwarding rate control method and device |
| CN109379163B (en) * | 2018-09-05 | 2021-11-23 | 新华三技术有限公司 | Message forwarding rate control method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108600102B (en) | Flexible data transmission system based on intelligent cooperative network | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| JP2964957B2 (en) | High-speed routing control method | |
| CN103888369B (en) | Ethernet communication method, system and SDN switch | |
| CN105471764B (en) | A kind of method of end-to-end QoS guarantee in SDN network | |
| CN103716208B (en) | Support network management, system, interchanger and the network of elephant stream | |
| CN107959633A (en) | A kind of load balance method based on price mechanism in industry real-time network | |
| CN106559330B (en) | SDN-based dynamic path planning method | |
| US20120075999A1 (en) | Dynamic latency-based rerouting | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| CN102714628A (en) | Communication system, control apparatus, processing rule setting method, packet transmitting method and program | |
| CN104994033A (en) | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management | |
| CN104871490B (en) | The multipath communication device of energy ecology and its method for distributing business for improving energy ecology can be improved | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| JP2015029346A (en) | Communication system, control device, packet transfer route control method, and program | |
| KR20120055955A (en) | Open flow network system and method of controlling the same | |
| Carpa et al. | Segment routing based traffic engineering for energy efficient backbone networks | |
| CN101841487A (en) | Configuration method for aggregating link service flow and packet switching device | |
| Yan et al. | A survey of low-latency transmission strategies in software defined networking | |
| CN105743804B (en) | Data flow control method and system | |
| CN110351187A (en) | Data center network Road diameter switches the adaptive load-balancing method of granularity | |
| CN114500354B (en) | Switch control method, device, control equipment and storage medium | |
| CN105071947A (en) | Link optimization method for SDN network | |
| CN113746750A (en) | Method, network node, system and storage medium for forwarding data message | |
| CN107682264B (en) | Data transmission method and system based on real-time active path planning |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171215 |
|
| RJ01 | Rejection of invention patent application after publication |