CN105634938B - A kind of data dual path backup transmission method for software defined network - Google Patents
A kind of data dual path backup transmission method for software defined network Download PDFInfo
- Publication number
- CN105634938B CN105634938B CN201410713384.1A CN201410713384A CN105634938B CN 105634938 B CN105634938 B CN 105634938B CN 201410713384 A CN201410713384 A CN 201410713384A CN 105634938 B CN105634938 B CN 105634938B
- Authority
- CN
- China
- Prior art keywords
- data
- interchanger
- path
- node
- flow table
- 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.)
- Active
Links
Abstract
The invention discloses a kind of data dual path backup transmission method for software defined network, including two processes of path planning process and dual path repeating process concentrated.Method is that the Business Stream for having dual path backup transmission demand distributes two coincidence nodes minimum link according to full mesh topology by SDN manager, and allocation result is sent the respective switch node to path in the form of forwarding flow table.The network switch is forwarded according to flow table item to Business Stream：Top interchanger receives user data, replicates customer traffic according to flow table item and is respectively sent to two downstream switch；Intermediary switch forwards data according to flow table item, and the data aggregate that end interchanger will be received simultaneously is sent to terminal user.The present invention is carried out data transmission using the minimum both links of registration in network, is farthest avoided because of loss of data caused by certain node in network or certain link failure, improves the reliability of key business transmission.
Description
Technical field
It is the method for reliable transmission of software defined network the invention belongs to data communication technology field, and in particular to a kind of
For the data dual path backup transmission method of software defined network.
Background technology
With the development of Internet technology, the application of software defined network (SDN) is more and more extensive.With legacy network not
Together, the structure that software defined network using control and forwarding separate, can be controlled on the premise of hardware device is not changed with center
The mode of system, with program again planning network.So as to reduce network design cost, network operation and maintenance load are alleviated.
The reliability requirement more and more higher that network application is transmitted to data, particularly in the application of industrial circle.And network
Transmission often has uncertainty, particularly wireless network, and network connection is often unstable.Once in network certain node or
Person's link breaks down, and whole network needs certain hour to be reorganized, this just for reliable data transmission propose it is new
Challenge.
For problem above, traditional distributed network being directed to existing solution, its technological means is in SDN more
And do not apply to.
The content of the invention
In view of this, transmission side is backed up present invention aim at a kind of data dual path for software defined network of offer
Method, the business higher to reliability requirement uses two paths simultaneous transmissions, it is to avoid because unstable networks or link failure draw
The packet loss for rising.
The technical scheme that is used to achieve the above object of the present invention is：A kind of data two-way for software defined network
Footpath backup transmission method, including concentrate path planning process and data dual path backup repeating process；
Described concentration path planning process, network manager is accepted business the backup transmission requirement of data, according to the whole network
Topological sum loading condition carries out path planning to data service, and program results is sent to each exchange in the form of flow table item
Machine；
Described Dual-path backup repeating process, interchanger realizes branch in data transmission procedure, intersects and be polymerized, stream
Journey is that branch interchanger receives business datum and replicates business datum according to flow table item and exchanged while being transmitted to two downstreams
Machine, node in both links forwarding service data step by step, end is transmitted to after finally two paths of data is merged by aggregation switch
End node.
The concentration path planning process is comprised the following steps：
(1) network switch calculates the real-time link cost of each of the links at regular intervals：
Wherein, riIt is link LiRemaining bandwidth；
(2) step by step be sent in network manager link cost by the network switch, updates the link in network manager
Cost information；
(3) network manager accept business data Dual-path backup forwarding request, in solicited message comprising business datum source
Information, purpose information；
(4) all set of paths from source node s to destination node d are calculated, Q'(s is designated as, d)={ Pi' (s, d) | i=
1,2,...,n'}；
(5) P is calculatedi' (s, d) path cost and according to from small to large sequence be designated as Di' (s, d), if Di' in (s, d)
Element meets Di+1' 2 × D of (s, d) ＞i' (s, d) then by link cost be more than Di' (s, d) path from Q'(s, d) in delete, and
Residual paths set is designated as Q (s, d)={ Pi(s, d) | i=1,2 ..., n }；
(6) source node s to destination node d number of paths is judged, if equal to 1 cannot distribute backup link, feedback is lost
Lose message；If quantity is more than 1, step (8) is carried out；
(7) all node N that path is passed through in statistics Q (s, d)i(s, d), and remember in Q (s, d) by node Ni(s's, d)
Number of paths
(8) N is searched fori(s, d) finds outThe node equal with number of paths in Q (s, d), and according to source node s
G is designated as to destination node d order arrangementsj, wherein j=1,2 ..., m
(9) calculate node GjTo Gj+1, the nonintersecting paths of j=1,2 ..., m-1：
(10) willConnect into pathConnect into pathJ=
1,2,…,m-1；
(11) if GjSimultaneously in splitting node list and aggregation list, then it is deleted and added in two lists
It is added in intersection point list, j=1,2 ..., m；
(12) route programming result is converted into interchanger flow table item and sent extremely by network manager according to data flow characteristics
Respective switch.
The calculate node GjTo Gj+1, the nonintersecting paths of j=1,2 ..., m-1 comprises the following steps：
9.1) take in Q (s, d) in GjTo Gj+1Between part differ path, and in GjTo Gj+1Between truncate composition road
Footpath set Q (Gj,Gj+1)={ Pi(Gj,Gj+1) | i=1,2 ..., m }, i=1,2 ..., k；
9.2) Q (G are judgedj,Gj+1) in element number, if not " 1 " then carries out step 9.3), otherwise by P0(Gj,Gj+1)
It is designated as simultaneouslyWithCarry out step (10)；
9.3) statistics Q (Gj,Gj+1) in path pass through all node Ni(Gj,Gj+1)；
9.4) with Pi(Gj,Gj+1) it is line index, Ni(Gj,Gj+1) it is column index generation path node matrix H(Gj,Gj+1), it is raw
It is into rule：If Pi(Gj,Gj+1) by Ni(Gj,Gj+1), then H(Gj,Gj+1)Corresponding element value is " 1 "；Otherwise corresponding element value
It is " 0 "；
9.5) H is taken(Gj,Gj+1)In row vector two do matrix multiplication, record all vector products be " 2 " row corresponding to
Combination of paths, be designated as Pi x(Gj,Gj+1) and Pi y(Gj,Gj+1), i=1,2 ..., h；
9.6) P is calculatedi x(Gj,Gj+1) and Pi y(Gj,Gj+1) link cost sum, and by the minimum group of link cost sum
Conjunction is designated asWithWhereinIt is cost compared with small path,For cost compared with
Big path；
9.7) by GjIt is added to splitting node list, Gj+1It is added to aggregation list.
The Dual-path backup repeating process is comprised the following steps：
(1) flow table parsing；
(2) data forwarding
(3) interchanger cleaning count pick up list, deletes the long list items of retention time.
The flow table parsing is comprised the following steps：
1.1) interchanger receiving network managing device issues flow table item and is added in flow table list；
If 1.2) flow table designated switch is the branch interchanger of the data flow, interchanger is that the data flow creates two bytes
Counter is simultaneously initially " 0 ", carries out data forwarding step；Otherwise carry out 1.3)；
If 1.3) flow table designated switch is the intersection point interchanger of the data flow；Interchanger is that the data flow creates reception meter
Ordered series of numbers table is used to preserve count pick up and reception time, carries out data forwarding step；Otherwise carry out 1.4)；
If 1.4) flow table designated switch is the aggregation switch of the data flow, interchanger is that the data flow creates reception meter
Ordered series of numbers table is used to preserve count pick up and reception time.
The data forwarding is comprised the following steps：
2.1) interchanger receives the data that network sends, and is contrasted with flow table item；
2.2) if interchanger is not the branch interchanger of the data flow, carry out 2.3)；It is otherwise special in packet data stream
Two byte count fields are added after levying and the field is assigned by the traffic count device value, unison counter adds " 1 ", and according to stream
Table indicates for data to be sent to two downstream nodes；
2.3) if interchanger is not the intersection point interchanger of the data flow, carry out 2.4)；Otherwise determine whether packet
Count field value whether in count pick up list：If abandoning the packet if；Otherwise by data count field and reception
Time is saved in count pick up list, and the packet is forwarded into two downstream nodes according to flow table, is carried out (3)；
2.4) if interchanger is not the aggregation switch of the data flow, carry out 2.5)；Otherwise determine whether packet
Count field value whether in count pick up list：If abandoning the packet if；Otherwise by data count field and reception
Time is saved in count pick up list, deletes the data count field of packet, is forwarded to downstream node, is carried out (3)；
2.5) interchanger forwards the packet to next node according to flow table.
The present invention has advantages below and beneficial effect：
1. the present invention is carried out data transmission using the minimum both links of registration in network, farthest avoid because
Loss of data caused by certain node or certain link failure in network, improves the reliability of key business transmission.While road
With due regard to network link loads factors in the planning process of footpath, it is to avoid because network environment deteriorates caused by backup transmission.
2. with due regard to network link loads factors during path planning, it is to avoid because of network rings caused by backup transmission
Border deteriorates.
Brief description of the drawings
Fig. 1 is the schematic diagram of present invention application deployment；
Fig. 2 is the flow chart that the present invention concentrates path planning process；
Fig. 3 is path planning process example figure of the present invention；
Fig. 4 is the exemplary plot that present invention segmentation solves mulitpath；
Fig. 5 is the flow chart of dual link repeating process of the present invention；
Fig. 6 is the resolution flow table flow chart of dual link repeating process of the present invention；
Fig. 7 is the data forwarding flow chart of dual link repeating process of the present invention.
Specific embodiment
With reference to the accompanying drawings and examples, narration in detail is made to present invention：
A kind of reference picture 1, data dual path backup transmission method for software defined network of the invention includes concentrating
Path planning process and data dual path backup repeating process.Wherein time delay assigning process realizes in network manager 1, when
Prolong guarantee repeating process to be realized by the network switch 2 in transmission path.
Reference picture 2, the path planning process, comprises the following steps：
Step 1：The network switch calculates the real-time link cost of each of the links at regular intervals：
Wherein, riIt is link LiRemaining bandwidth；
Step 2：Step by step be sent in network manager link cost by the network switch, updates the chain in network manager
Road cost information；
Step 3：Network manager accepts business the forwarding request of data Dual-path backup, comprising business datum in solicited message
Source information, purpose information；
Step 4：The all set of paths from source node s to destination node d are calculated, Q'(s is designated as, d)={ Pi'(s,d)|i
=1,2 ..., n'}.Reference picture 3, two terminal rooms have ABCH, ABCFH, ABCGEGH, AEFCH, AEFH, AEGH, ADEFCH,
ADEFH, ADEGH totally 9 paths；
Step 5：Calculate Pi' (s, d) path cost and according to from small to large sequence be designated as Di' (s, d), if Di'(s,d)
In element meet Di+1' 2 × D of (s, d) ＞i' (s, d) then by link cost be more than Di' (s, d) path from Q'(s, d) in delete
Remove, and residual paths set is designated as Q (s, d)={ Pi(s, d) | i=1,2 ..., n }.Reference picture 3, between two terminal rooms have BC
Cause link cost larger because real time load is overweight, by the link path be deleted, Q (s, d) be residue AEFCH, AEFH,
AEGH, ADEFCH, ADEFH, ADEGH totally 6 paths；
Step 6：Judge source node s to destination node d number of paths, if equal to 1 cannot distribute backup link, feedback
Failed message；If quantity is more than 1, step 7 is carried out；
Step 7：All node N that path is passed through in statistics Q (s, d)i(s, d), and remember in Q (s, d) by node Ni(s,
D) number of pathsReference picture 3, all nodes that Q (s, d) passes through are A, C, D, E, F, G, H, by these nodes
Number of paths be followed successively by 6 times, 1 time, 3 times, 6 times, 4 times, 2 times, 6 times；
Step 8：Search Ni(s, d) finds outThe node equal with number of paths in Q (s, d), and saved according to source
Point s to destination node d order arrangements are designated as Gj, wherein j=1,2 ..., m.Reference picture 3, number of paths is 6 in Q (s, d), therefore
GjIt is followed successively by A, E, H；
Step 9：Calculate node GjTo Gj+1, the nonintersecting paths of j=1,2 ..., m-1：
Step 9-1：Take in Q (s, d) in GjTo Gj+1Between part differ path, and in GjTo Gj+1Between truncation group
Into set of paths Q (Gj,Gj+1)={ Pi(Gj,Gj+1) | i=1,2 ..., m }, i=1,2 ..., k.Reference picture 3, be between E, H
The total paths of EFCH, EFH, EGH tri- of example；
Step 9-2：Judge Q (Gj,Gj+1) in element number, if not " 1 " then carries out step 9-3, otherwise by P0(Gj,
Gj+1) while being designated asWithCarry out step 10；
Step 9-3：Statistics Q (Gj,Gj+1) in path pass through all node Ni(Gj,Gj+1).Reference picture 3, between E, H
Path is by five nodes of C, E, F, G, H；
Step 9-4：With Pi(Gj,Gj+1) it is line index, Ni(Gj,Gj+1) it is column index generation path node matrix
H(Gj,Gj+1), create-rule is：If Pi(Gj,Gj+1) by Ni(Gj,Gj+1), then H(Gj,Gj+1)Corresponding element value is " 1 "；Otherwise
Corresponding element value is " 0 ".Reference picture 4, is the path node matrix in Fig. 3 between E, H；
Step 9-5：Take H(Gj,Gj+1)In row vector two do matrix multiplication, it is the row institute of " 2 " to record all vector products
Corresponding combination of paths, is designated as Pi x(Gj,Gj+1) and Pi y(Gj,Gj+1), i=1,2 ..., h.Reference picture 4, path EGH and EFH,
EGH and EFCH meet condition；
Step 9-6：Calculate Pi x(Gj,Gj+1) and Pi y(Gj,Gj+1) link cost sum, it is and link cost sum is minimum
Combination be designated asWithWhereinIt is cost compared with small path,For
Cost larger path.Reference picture 3 and Fig. 4,It is EFH,It is EGH；
Step 9-7：By GjIt is added to splitting node list, Gj+1It is added to aggregation list.Reference picture 3, E is branch
Node, H is aggregation.
Step 10：Will(j=1,2 ..., m-1) connect into path(j
=1,2 ..., m-1) connect into pathReference picture 3, two paths are respectively AEFH and ADGH；
Step 11：If Gj(j=1,2 ..., m) while in splitting node list and aggregation list, then by it two
Deleted in individual list and be added in intersection point list.Reference picture 3, intersection point is replaced with by E；
Step 12：It is concurrent that network manager is converted into interchanger flow table item according to data flow characteristics, by route programming result
Deliver to respective switch.
Reference picture 5, the dual path repeating process, comprises the following steps：
Step 1：Reference picture 6, parses flow table；
Step 1-1：Interchanger receiving network managing device issues flow table item and is added in flow table list；
Step 1-2：If flow table designated switch is the branch interchanger of the data flow, interchanger is that the data flow creates two
Byte counter is simultaneously initially " 0 ", carries out step 2；Otherwise carry out step 1-3；
Step 1-3：If flow table designated switch is the intersection point interchanger of the data flow；Interchanger is that data flow establishment connects
Receiving count list is used to preserve count pick up and reception time, carries out step 2；Otherwise carry out step 1-4；
Step 1-4：If flow table designated switch is the aggregation switch of the data flow, interchanger is that data flow establishment connects
Receiving count list is used to preserve count pick up and reception time；
Step 2：Reference picture 7, carries out data forwarding；
Step 2-1：Interchanger receives the data that network sends, and is contrasted with flow table item；
Step 2-2：If interchanger is not the branch interchanger of the data flow, step 2-3 is carried out；Otherwise in number-of-packet
According to adding two byte count fields after stream feature and assigning the field by the traffic count device value, unison counter adds " 1 ", and
Indicate for data to be sent to two downstream nodes according to flow table；
Step 2-3：If interchanger is not the intersection point interchanger of the data flow, step 2-4 is carried out；Otherwise determine whether
Whether the count field value of packet is in count pick up list：If abandoning the packet if；Otherwise by data count field
It is saved in count pick up list with the reception time, and the packet is forwarded to by two downstream nodes according to flow table, is walked
Rapid 3；
Step 2-4：If interchanger is not the aggregation switch of the data flow, step 2-5 is carried out；Otherwise determine whether
Whether the count field value of packet is in count pick up list：If abandoning the packet if；Otherwise by data count field
It is saved in count pick up list with the reception time, deletes the data count field of packet, be forwarded to downstream node, is walked
Rapid 3；
Step 2-5：Interchanger forwards the packet to next node according to flow table；
Step 3：Interchanger clears up count pick up list, deletes the long list items of retention time, carries out step 2.
Claims (5)
1. a kind of data dual path backup transmission method for software defined network, it is characterised in that including the path concentrated
Planning process and data dual path backup repeating process；
Described concentration path planning process, network manager is accepted business the backup transmission requirement of data, according to full mesh topology
Path planning is carried out to data service with loading condition, and program results is sent to respective switch in the form of flow table item；
Described dual path backup repeating process, interchanger realizes branch in data transmission procedure, intersects and be polymerized, flow
For branch interchanger receives business datum and replicates business datum according to flow table item and is transmitted to two downstream switch simultaneously,
Node in both links forwarding service data step by step, are transmitted to terminal section after finally two paths of data is merged by aggregation switch
Point；
The concentration path planning process is comprised the following steps：
(1) interchanger calculates the real-time link cost of each of the links at regular intervals：
Wherein, riIt is link LiRemaining bandwidth；
(2) step by step be sent in network manager link cost by interchanger, updates the link cost information in network manager；
(3) network manager accept business data dual path backup forwarding request, in solicited message comprising business datum source believe
Breath, purpose information；
(4) all set of paths from source node s to destination node d are calculated, Q'(s is designated as, d)={ Pi' (s, d) | i=1,
2,...,n'}；
(5) P is calculatedi' (s, d) path cost and according to from small to large sequence be designated as Di' (s, d), if Di' element in (s, d)
Meet Di+1' 2 × D of (s, d) ＞i' (s, d) then by link cost be more than Di' (s, d) path from Q'(s, d) in delete, and will be surplus
Remaining set of paths is designated as Q (s, d)={ Pi(s, d) | i=1,2 ..., n }；
(6) source node s to destination node d number of paths is judged, if equal to 1 cannot distribute backup link, feeding back unsuccessful disappears
Breath；If quantity is more than 1, step (7) is carried out；
(7) all node N that path is passed through in statistics Q (s, d)i(s, d), and remember in Q (s, d) by node NiThe path of (s, d)
Quantity
(8) N is searched fori(s, d) finds outThe node equal with number of paths in Q (s, d), and according to source node s to mesh
Node d order arrangement be designated as Gj, wherein j=1,2 ..., m；
(9) calculate node GjTo Gj+1, the nonintersecting paths of j=1,2 ..., m-1 is designated as
(10) willConnect into path Connect into pathJ=1,2 ...,
m-1；
(11) if GjSimultaneously in splitting node list and aggregation list, then it is deleted and be added in two lists
In intersection point list, j=1,2 ..., m；
(12) route programming result is converted into interchanger flow table item and sent to each by network manager according to data flow characteristics
Interchanger.
2. a kind of data dual path backup transmission method for software defined network according in claim 1, its
It is characterised by, the calculate node GjTo Gj+1, the nonintersecting paths of j=1,2 ..., m-1 comprises the following steps：
9.1) take in Q (s, d) in GjTo Gj+1Between part differ path, and in GjTo Gj+1Between truncate composition path set
Close Q (Gj,Gj+1)={ Pi(Gj,Gj+1) | i=1,2 ..., v }；
9.2) Q (G are judgedj,Gj+1) in element number, if not " 1 " then carries out step 9.3), otherwise by P1(Gj,Gj+1) while
It is designated asWithCarry out step (10)；
9.3) statistics Q (Gj,Gj+1) in path pass through all node Ni(Gj,Gj+1)；
9.4) with Pi(Gj,Gj+1) it is line index, Ni(Gj,Gj+1) it is column index generation path node matrixCreate-rule
For：If Pi(Gj,Gj+1) by Ni(Gj,Gj+1), thenCorresponding element value is " 1 "；Otherwise corresponding element value is " 0 "；
9.5) takeIn row vector do matrix multiplication two-by-two, record all vector products be " 2 " row corresponding to road
Footpath is combined, and is designated asWithI=1,2 ..., h；
9.6) P is calculatedi x(Gj,Gj+1) and Pi y(Gj,Gj+1) link cost sum, and by the minimum combination note of link cost sum
ForWithWhereinIt is cost compared with small path,It is cost compared with main road
Footpath；
9.7) by GjIt is added to splitting node list, Gj+1It is added to aggregation list.
3. a kind of data dual path backup transmission method for software defined network according in claim 1, its
It is characterised by, the dual path backup repeating process is comprised the following steps：
(1) flow table parsing；
(2) data forwarding；
(3) interchanger cleaning count pick up list, deletes the long list items of retention time.
4. a kind of data dual path backup transmission method for software defined network according in claim 3, its
It is characterised by, the flow table parsing is comprised the following steps：
1.1) interchanger receiving network managing device issues flow table item and is added in flow table list；
If 1.2) flow table designated switch is the branch interchanger of the data flow, interchanger is that the data flow creates the counting of two bytes
Device is simultaneously initially " 0 ", carries out data forwarding step；Otherwise carry out 1.3)；
If 1.3) flow table designated switch is the intersection point interchanger of the data flow；Interchanger is that the data flow creates count pick up row
Table is used to preserve count pick up and reception time, carries out data forwarding step；Otherwise carry out 1.4)；
If 1.4) flow table designated switch is the aggregation switch of the data flow, interchanger is that the data flow creates count pick up row
Table is used to preserve count pick up and reception time.
5. a kind of data dual path backup transmission method for software defined network according in claim 3, its
It is characterised by, the data forwarding is comprised the following steps：
2.1) interchanger receives the data that network sends, and is contrasted with flow table item；
2.2) if interchanger is not the branch interchanger of the data flow, carry out 2.3)；Otherwise after packet data stream feature
Add two byte count fields and assign the field by the traffic count device value, unison counter adds " 1 ", and refers to according to flow table
Show and data are sent to two downstream nodes；
2.3) if interchanger is not the intersection point interchanger of the data flow, carry out 2.4)；Otherwise determine whether the meter of packet
Whether field value is in count pick up list：If abandoning the packet if；Otherwise by data count field and reception time
It is saved in count pick up list, and the packet is forwarded to by two downstream nodes according to flow table, carries out (3)；
2.4) if interchanger is not the aggregation switch of the data flow, carry out 2.5)；Otherwise determine whether the meter of packet
Whether field value is in count pick up list：If abandoning the packet if；Otherwise by data count field and reception time
It is saved in count pick up list, deletes the data count field of packet, be forwarded to downstream node, carries out (3)；
2.5) interchanger forwards the packet to next node according to flow table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410713384.1A CN105634938B (en) | 2014-11-30 | 2014-11-30 | A kind of data dual path backup transmission method for software defined network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410713384.1A CN105634938B (en) | 2014-11-30 | 2014-11-30 | A kind of data dual path backup transmission method for software defined network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105634938A CN105634938A (en) | 2016-06-01 |
| CN105634938B true CN105634938B (en) | 2017-06-06 |
Family
ID=56049465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410713384.1A Active CN105634938B (en) | 2014-11-30 | 2014-11-30 | A kind of data dual path backup transmission method for software defined network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105634938B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113098773B (en) | 2018-03-05 | 2022-12-30 | 华为技术有限公司 | Data processing method, device and system |
| CN113950117B (en) * | 2021-10-13 | 2023-06-27 | 国网江苏省电力有限公司无锡供电分公司 | Low-delay image transmission method based on software defined network in tunnel environment |
| CN114726772B (en) * | 2022-03-02 | 2023-03-24 | 山西大学 | Route protection method based on optimized network topology structure |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103051537A (en) * | 2012-12-17 | 2013-04-17 | 广东省电信规划设计院有限公司 | IP (Internet Protocol) circuit service transmission scheduling method and system |
| CN103986651A (en) * | 2014-05-30 | 2014-08-13 | 杭州华三通信技术有限公司 | SDN controller and control method thereof |
| CN104113477A (en) * | 2009-11-18 | 2014-10-22 | 日本电气株式会社 | Dynamic route branching system and dynamic route branching method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9112793B2 (en) * | 2012-05-31 | 2015-08-18 | International Business Machines Corporation | End-to-end multipathing through network having switching devices compatible with different protocols |
-
2014
- 2014-11-30 CN CN201410713384.1A patent/CN105634938B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104113477A (en) * | 2009-11-18 | 2014-10-22 | 日本电气株式会社 | Dynamic route branching system and dynamic route branching method |
| CN103051537A (en) * | 2012-12-17 | 2013-04-17 | 广东省电信规划设计院有限公司 | IP (Internet Protocol) circuit service transmission scheduling method and system |
| CN103986651A (en) * | 2014-05-30 | 2014-08-13 | 杭州华三通信技术有限公司 | SDN controller and control method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105634938A (en) | 2016-06-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102238443B (en) | Method for establishing cross-domain path meeting wavelength-continuity constraints | |
| CN103986651B (en) | A kind of software defined network controller and its control method | |
| CN108512760A (en) | The method for routing of QoS of survice is ensured based on SDN | |
| CN106209622A (en) | A kind of method of multicasting based on SDN | |
| CN104618236A (en) | Parallel data transmission system and method of acceleration network | |
| CN103036792B (en) | Transmitting and scheduling method for maximizing minimal equity multiple data streams | |
| CN105634938B (en) | A kind of data dual path backup transmission method for software defined network | |
| CN103607737B (en) | A kind of heterogeneous-network service shunt method and system | |
| CN108833279A (en) | The method of Multi-constraint QoS paths based on business classification in software defined network | |
| CN106059861B (en) | System and method for constructing minimum dynamic aggregation tree of Internet of things in distributed mode | |
| CN101605280A (en) | Dual-route computing unit system based on multi-layer multi-domain optical network | |
| CN107948087A (en) | A kind of method and apparatus of load balancing | |
| CN105610707A (en) | Implementation method of AntNet routing algorithm in two-dimensional mesh topology network-on-chip | |
| CN106330730A (en) | Multicast control method and apparatus | |
| CN107454009B (en) | Data center-oriented offline scene low-bandwidth overhead traffic scheduling scheme | |
| CN103178976A (en) | Method for multicast tree establishment and fault restoration | |
| CN109889447B (en) | Network transmission method and system based on hybrid ring networking and fountain codes | |
| CN110061874A (en) | A kind of method of alliance's block chain visualization channel management | |
| CN111131064B (en) | Multicast stream scheduling method in data center network | |
| WO2016004820A1 (en) | Data flow forwarding method and device for switch system | |
| CN103326916A (en) | System and method for automatic partition of intelligent substation and optimization of VLAN | |
| CN103560937B (en) | Data access method and portal server | |
| CN103999404B (en) | For the third edition IGMP of QoS support | |
| CN105657671A (en) | Method and equipment for realizing multicast | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |