CN106888163A - The method for routing divided based on network domains in software defined network - Google Patents
The method for routing divided based on network domains in software defined network Download PDFInfo
- Publication number
- CN106888163A CN106888163A CN201710205383.XA CN201710205383A CN106888163A CN 106888163 A CN106888163 A CN 106888163A CN 201710205383 A CN201710205383 A CN 201710205383A CN 106888163 A CN106888163 A CN 106888163A
- Authority
- CN
- China
- Prior art keywords
- network
- domain
- routing
- sub
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the method for routing divided based on network domains in a kind of software defined network, including step：Software defined network is divided into multiple sub-network domains by controller according to network topology；Controller calculates the forward-path between access switch and edge switch in the domain of each sub-network domain, the static flow table item of configuration；When data flow needs route, controller dynamic control inter-domain routing, calculate from source to the shortest path for converging, and on corresponding interchanger Dynamical Deployment fine granularity flow table item, and repeatedly change purpose IP address, control data stream is forwarded between domain, is forwarded according to static flow table item inside each sub-network domain.The traffic between controller and interchanger will greatly reduce, and so as to alleviate the burden of controller, the scalability of network be improve, with very wide application prospect.
Description
Technical field
The invention belongs to network routing techniques field, divided based on network domains more particularly in a kind of software defined network
Method for routing.
Background technology
Due to a variety of limitation of existing network framework, software defined network has been expedited the emergence of（Software Defined
Network, SDN）Generation.SDN is a kind of network architecture based on software, and its core concept is network data Forwarding plane
With the separation of control and management plane.In traditional IP, web-transporting device（Such as router）Need to be each responsible for data
Forwarding capability and control logic function, therefore the control management logic NOT of legacy network is often complicated.And in software defined network,
This framework of control plane and data planar separation causes that the function of web-transporting device becomes simple, it is only necessary to be responsible for forwarding
Data, the control function of web-transporting device script then all transfers to the controlled entity on upper strata to complete.Under such framework, net
Network keeper and researcher only need to be programmed in controlled entity and just network can be managed, configured and ground
Study carefully.Therefore SDN not only increases the transmission performance of network while also so that the management control of network becomes flexibly expansible.
SDN has many advantages relative to traditional network.Controller can grasp the topologys such as the state of whole network, data
Information, according to these information, it is possible to achieve many functions, for example：（1）By ospf（Open Shortest
Path First, OSPF）Path cost in network is calculated in being placed on controller, more many soon than existing calculation.（2）Meter
The speed for calculating route can be more many soon than original calculation.（3）Solution can be provided previously by for some problems, when problem goes out
Can solve faster now.
In SDN, all control management functions are completed by controller, therefore when there is new stream to reach network, control
Device processed needs to be responsible for routeing the data flow.Typical SDN controllers are according to the data flow in following two step route networks：1、
It is optimal routed path that data-flow computation goes out the whole network according to the topology information of the bottom-layer network being collected into；2nd, add corresponding
All interchangers in flow table item to optimal routed path.Obviously there is scalability in typical SDN routing mechanisms.One
Aspect controller be data stream by when, it is needed with all interchanger interactive information on routed path, existing research hair
The quantity of the existing number of interactive information between SDN control planes and datum plane and interchanger in network and number of data streams
Relation is all linear, therefore when network size increases or when number of data streams increases, the interactive information meeting in controlling network
Dramatically increase；On the other hand, the limited disposal ability of single controller is also the weight for causing SDN to route scalability problem
Reason is wanted, in the case where certain treatment time delay is ensured, the single manageable number of data streams of SDN controllers and network size
Size be all limited.The present invention is therefore.
The content of the invention
For above-mentioned technical problem, the present invention seeks to：There is provided in a kind of software defined network be based on network
Network domains are divided by the method for routing that domain divides, and static routing is carried out in domain, and the side of dynamic routing is carried out between domain
Method.Controller burden can be effectively reduced, so as to improve the scalability of whole network.
The technical scheme is that：
The method for routing divided based on network domains in a kind of software defined network, is comprised the following steps：
S01：Software defined network is divided into multiple sub-network domains by controller according to network topology；
S02：Controller calculates the forward-path between access switch and edge switch in the domain of each sub-network domain, and configuration is static
Flow table item；
S03：When data flow needs route, controller dynamic control inter-domain routing is calculated from source to the shortest path for converging, and
Dynamical Deployment fine granularity flow table item on corresponding interchanger, and purpose IP address are repeatedly changed, control data stream is forwarded between domain,
Forwarded according to static flow table item inside each sub-network domain.
Preferably, in the step S01, the division of sub-network domain is carried out using label propagation algorithm, is made in each sub-network domain
Connection between portion's interchanger is dense, and the connection between interchanger between sub-network domain is sparse.
Preferably, in the step S02, using network topology as without weight graph, using Dijkstra shortest path first meters
Calculate the forward-path between access switch and edge switch, IP ground of the configuration static state flow table item according to purpose interchanger
Location is matched, other fields all wildcards.
Preferably, in the step S03, using network topology as authorized graph, between access switch and edge switch
The weight in path determined by the length of shortest path, calculated from source to the shortest path for converging using dijkstra's algorithm.
Preferably, according to the matching result of packet header selection forwarding route, packet header is provided with interchanger
With field Match Fields, priority field Priority, count area Counters, instruction field Instructions,
Timeout field Timeouts, Cookie, interchanger are carried out by the matching field Match Fields changed in packet header
Inter-domain routing, makes packet be forwarded according to static flow table in domain, on path is reached during last network domains, will match
Field modification is returned.
Compared with prior art, it is an advantage of the invention that：
（1）The method is based on the community structure that numerous real networks are met, using label propagation algorithm（LPA）, will be extensive
SDN be divided into network domains one by one, the connection between each network domains internal switch is dense, and between network domains
Connection is sparse.When routing decision is carried out, the all-network domain passed through from source to remittance path is all each according to being deployed in advance
The static flow table of network domains is forwarded, and controller only needs to the forwarding between dynamic control network domain（Assuming that only edge is exchanged
Machine is connected with main frame）.The traffic between controller and interchanger will greatly reduce, and so as to alleviate the burden of controller, carry
The scalability of network high, with very wide application prospect.
（2）Controller calculate data stream by complexity reduction.For certain cross-domain data stream by when, controller only
It needs to be determined which edge switch optimal inter-domain routing path is needed by, and then can be without examining for the interchanger in domain
Consider, network optimum route is calculated compared to Traditional routing solutions, the method computation complexity is substantially reduced.
（3）Interactive information between control plane and interchanger is greatly reduced.For certain cross-domain data stream by when,
Controller only needs to add flow table item, including access switch and the son for being passed through for the sub-fraction interchanger on routed path
The edge switch of network domains, compared to needing to add flow table item to all interchangers on path in other routing plans, is somebody's turn to do
Scheme effectively reduces the interactive information between controller and interchanger.
Brief description of the drawings
Below in conjunction with the accompanying drawings and embodiment the invention will be further described：
Fig. 1 is the flow chart of method for routing of the present invention；
Fig. 2 is the complete network topology of the present embodiment；
Fig. 3 is the sub-network domain that the present embodiment is divided；
The network topology that Fig. 4 is used by the present embodiment controller when inter-domain routing is carried out.
Specific embodiment
Such scheme is described further below in conjunction with specific embodiment.It should be understood that these embodiments are for illustrating
The present invention and be not limited to limit the scope of the present invention.The implementation condition used in embodiment can be done according to the condition of specific producer
Further adjustment, unreceipted implementation condition is usually the condition in normal experiment.
Embodiment：
Invention software defines the method for routing divided based on network domains in network.Large-scale SDN is divided into one
Individual small sub-network domain, only disposes static flow table item in advance on a small number of interchangers in each sub-network domain, data stream by mistake
By controller dynamic control inter-domain routing in journey.As shown in figure 1, the routing procedure of the present embodiment is as follows：
（1）Using label propagation algorithm（LPA）The division of sub-network domain is carried out to fairly large SDN, makes each sub-network domain
Connection between internal switch is dense, and only a small number of interchangers between sub-network domain（Referred to as edge switch）It is connected.
（2）Before data flow arrival, controller calculates each sub-network domain inside and accesses friendship according to shortest-path method
The forward-path changed planes and edge switch between, will network topology be considered as without weight graph, using Dijkstra shortest paths calculate
Method calculates the shortest path between access switch and edge switch, and the route results that will be calculated write interchanger.These
Static flow table item is only matched according to the IP address of purpose interchanger, other fields all wildcards.
（3）When data flow is reached, controller needs to carry out dynamic routing to it, and now controller only considers to access and exchanges
Machine and edge switch, will network topology be considered as authorized graph, the weight in the path between access switch and edge switch
By step（2）In the length of shortest path that calculates determine, calculated from source to the shortest path for converging using dijkstra's algorithm,
And there is result to write interchanger on the road of calculating.Access switch and edge switch on path all carry out fine-grained flow table
Matching, and purpose IP address to packet modify, and can carry out domain using the good static routing list item of configured in advance
Interior forwarding.
In order to illustrate framework of the present invention, the present embodiment has used network as shown in Figure 2.Assuming that controller calculating is optimal
Path is shortest path, and implementation steps are as follows:
（1）Using label propagation algorithm, network topology as shown in Figure 2 can be divided into two sub- network domains, wherein interchanger
Sw1 ~ sw9 belongs to a sub- network domains, and interchanger sw10 ~ sw19 is another sub-network domain, wherein interchanger sw1, sw2,
Sw18, sw19 are access switch, and interchanger sw8, sw9, sw10, sw11 are edge switch.
（2）The static flow table item of configuration.By taking sub-network domain sw1 ~ sw9 as an example, such as Fig. 3, controller is according to shortest-path method
Calculate the forward-path between each sub-network domain inside access switch and edge switch, will network topology be considered as and have no right
Figure, calculates the shortest path between access switch and edge switch, and will calculate using Dijkstra shortest path firsts
Route results write-in interchanger.For ease of representing, IP is used（X）The IP address of expression equipment X.
It is sw1- that controller is calculated and selects the optimal path in the sub-network domain>sw3->sw6->sw8,sw1->sw3->
sw5->sw7->Sw9, sw2->sw4->sw7->sw9,sw2->sw5->sw8,sw1->sw2,sw8->Sw9, then in interchanger
The flow table item of the upper static configurations of sw1 is as follows：
| Matching field | Operation |
| IP（sw2）, remaining field wildcard | From port p2 forwardings |
| IP（sw8）, remaining field wildcard | From port p3 forwardings |
| IP（sw9）, remaining field wildcard | From port p3 forwardings |
All interchangers on these paths all configure similar flow table.
（3）Assuming that next PC1 will send data to PC4, controller has calculated sw1 to sw8's in step 2
Shortest path a length of 3, the shortest path a length of 4 of sw1 to sw9, the shortest path a length of 2 of sw10 to sw19, sw11 to sw19's
Shortest path a length of 2, therefore controller can calculate optimal inter-domain routing using topology as shown in Figure 4.Will network open up
Flutter and be considered as authorized graph, the weight in the path between access switch and edge switch is by step（2）In the shortest path that calculates
The length in footpath is determined, calculated from source to the shortest path for converging using dijkstra's algorithm, and has result to write friendship on the road of calculating
Change planes.Easily show that shortest path is sw1->sw8->sw10->Sw19, therefore controller will configure on this four interchangers
Inter-domain routing list item, in order to distinguish two different streams, has also needed to more accurate matching in addition to Match IP Address, therefore
Also need to match remaining field, such as MAC Address, MAC（X）The MAC Address of expression equipment X.
sw1
| Matching field | Operation |
| IP（pc4）And MAC（pc4） | Purpose IP is changed to IP（sw8） |
sw8
| Matching field | Operation |
| IP（sw8）And MAC（pc4） | Purpose IP is changed to IP（sw10） |
| IP（sw10）, remaining field wildcard | Sw10 is directly forwarded to from certain port |
sw10
| Matching field | Operation |
| IP（sw10）And MAC（pc4） | Purpose IP is changed to IP（sw19） |
sw19
| Matching field | Operation |
| IP（sw19）And MAC（pc4） | Purpose IP is changed to IP（pc4） |
Examples detailed above technology design and feature only to illustrate the invention, can its object is to allow person skilled in the art to be
Understand present disclosure and implement according to this, it is not intended to limit the scope of the present invention.It is all real according to spirit of the invention
Equivalent transformation or modification that matter is done, should all be included within the scope of the present invention.
Claims (5)
1. the method for routing for being divided based on network domains in a kind of software defined network, it is characterised in that comprise the following steps：
S01：Software defined network is divided into multiple sub-network domains by controller according to network topology；
S02：Controller calculates the forward-path between access switch and edge switch in the domain of each sub-network domain, and configuration is static
Flow table item；
S03：When data flow needs route, controller dynamic control inter-domain routing is calculated from source to the shortest path for converging, and
Dynamical Deployment fine granularity flow table item on corresponding interchanger, and purpose IP address are repeatedly changed, control data stream is forwarded between domain,
Forwarded according to static flow table item inside each sub-network domain.
2. the method for routing for being divided based on network domains in software defined network according to claim 1, it is characterised in that institute
State in step S01, the division of sub-network domain is carried out using label propagation algorithm, make the connection between the internal switch of each sub-network domain
Dense, the connection between interchanger between sub-network domain is sparse.
3. the method for routing for being divided based on network domains in software defined network according to claim 1, it is characterised in that institute
State in step S02, using network topology as without weight graph, access switch and border are calculated using Dijkstra shortest path firsts
Forward-path between interchanger, the configuration static state flow table item is matched according to the IP address of purpose interchanger, other words
Section all wildcards.
4. the method for routing for being divided based on network domains in software defined network according to claim 3, it is characterised in that institute
State in step S03, using network topology as authorized graph, the weight in the path between access switch and edge switch is by most short
The length in path is determined, calculated from source to the shortest path for converging using dijkstra's algorithm.
5. the method for routing for being divided based on network domains in software defined network according to claim 1, it is characterised in that hand over
Change planes according to the matching result of packet header selection forwarding route, packet header is provided with matching field Match
Fields, priority field Priority, count area Counters, instruction field Instructions, timeout field
Timeouts, Cookie, interchanger carry out inter-domain routing by the matching field Match Fields changed in packet header,
Packet is forwarded according to static flow table in domain, on path is reached during last network domains, matching field is changed
Return.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710205383.XA CN106888163A (en) | 2017-03-31 | 2017-03-31 | The method for routing divided based on network domains in software defined network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710205383.XA CN106888163A (en) | 2017-03-31 | 2017-03-31 | The method for routing divided based on network domains in software defined network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106888163A true CN106888163A (en) | 2017-06-23 |
Family
ID=59182550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710205383.XA Pending CN106888163A (en) | 2017-03-31 | 2017-03-31 | The method for routing divided based on network domains in software defined network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106888163A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107809381A (en) * | 2017-10-19 | 2018-03-16 | 北京邮电大学 | One kind, which is realized, is based on route loop active auditing algorithm and implementation method in SDN |
| CN107872385A (en) * | 2017-10-11 | 2018-04-03 | 中国电子科技集团公司第三十研究所 | A kind of SDN router-level topology and control method |
| CN108199970A (en) * | 2017-12-15 | 2018-06-22 | 浙江大学 | Packet path reconstructing method in a kind of software defined network |
| CN108768848A (en) * | 2018-09-04 | 2018-11-06 | 北京邮电大学 | A kind of segmental routing method and device |
| CN110708245A (en) * | 2019-09-29 | 2020-01-17 | 华南理工大学 | SDN data plane fault monitoring and recovery method under multi-controller architecture |
| CN111245716A (en) * | 2018-11-28 | 2020-06-05 | 中国电信股份有限公司 | Inter-domain routing method, device and system |
| CN114363297A (en) * | 2021-12-21 | 2022-04-15 | 西安四叶草信息技术有限公司 | Network space detection method and device, storage medium and electronic equipment |
| CN114513426A (en) * | 2022-03-02 | 2022-05-17 | 郑州轻工业大学 | CCN community division method based on node similarity and influence |
| CN114884879A (en) * | 2022-05-06 | 2022-08-09 | 鹏城实验室 | Software defined network hybrid switching method based on label technology |
| CN115550065A (en) * | 2022-11-25 | 2022-12-30 | 国网四川省电力公司信息通信公司 | Integrated network security analysis system and method based on large-scale multiple data sources |
| CN117119555A (en) * | 2023-10-24 | 2023-11-24 | 中国兵器科学研究院 | Lunar exploration time-varying topology group node self-adaptive networking routing method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155080A (en) * | 2006-09-30 | 2008-04-02 | 联想(北京)有限公司 | Method for network similar region partition and routing information multiplexing |
| CN103825823A (en) * | 2014-02-21 | 2014-05-28 | 中国科学技术大学苏州研究院 | Data forwarding method based on different priorities in software-defined network |
| EP2784993A1 (en) * | 2013-03-29 | 2014-10-01 | Alcatel Lucent | Method and device for setting up paths between network elements belonging to different network domains of a software-defined network |
| CN105264844A (en) * | 2014-04-10 | 2016-01-20 | 华为技术有限公司 | Routing method, apparatus and device in software defined network |
| CN106059933A (en) * | 2016-05-30 | 2016-10-26 | 杭州华三通信技术有限公司 | Method and device for maintaining software defined network (SDN) |
-
2017
- 2017-03-31 CN CN201710205383.XA patent/CN106888163A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155080A (en) * | 2006-09-30 | 2008-04-02 | 联想(北京)有限公司 | Method for network similar region partition and routing information multiplexing |
| EP2784993A1 (en) * | 2013-03-29 | 2014-10-01 | Alcatel Lucent | Method and device for setting up paths between network elements belonging to different network domains of a software-defined network |
| CN103825823A (en) * | 2014-02-21 | 2014-05-28 | 中国科学技术大学苏州研究院 | Data forwarding method based on different priorities in software-defined network |
| CN105264844A (en) * | 2014-04-10 | 2016-01-20 | 华为技术有限公司 | Routing method, apparatus and device in software defined network |
| CN106059933A (en) * | 2016-05-30 | 2016-10-26 | 杭州华三通信技术有限公司 | Method and device for maintaining software defined network (SDN) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107872385A (en) * | 2017-10-11 | 2018-04-03 | 中国电子科技集团公司第三十研究所 | A kind of SDN router-level topology and control method |
| CN107809381A (en) * | 2017-10-19 | 2018-03-16 | 北京邮电大学 | One kind, which is realized, is based on route loop active auditing algorithm and implementation method in SDN |
| CN108199970A (en) * | 2017-12-15 | 2018-06-22 | 浙江大学 | Packet path reconstructing method in a kind of software defined network |
| CN108199970B (en) * | 2017-12-15 | 2020-08-04 | 浙江大学 | Method for reconstructing data packet path in software defined network |
| CN108768848A (en) * | 2018-09-04 | 2018-11-06 | 北京邮电大学 | A kind of segmental routing method and device |
| CN111245716A (en) * | 2018-11-28 | 2020-06-05 | 中国电信股份有限公司 | Inter-domain routing method, device and system |
| CN110708245A (en) * | 2019-09-29 | 2020-01-17 | 华南理工大学 | SDN data plane fault monitoring and recovery method under multi-controller architecture |
| CN110708245B (en) * | 2019-09-29 | 2021-10-22 | 华南理工大学 | SDN data plane fault monitoring and recovery method under multi-controller architecture |
| CN114363297A (en) * | 2021-12-21 | 2022-04-15 | 西安四叶草信息技术有限公司 | Network space detection method and device, storage medium and electronic equipment |
| CN114513426A (en) * | 2022-03-02 | 2022-05-17 | 郑州轻工业大学 | CCN community division method based on node similarity and influence |
| CN114513426B (en) * | 2022-03-02 | 2023-09-15 | 郑州轻工业大学 | CCN community division method based on node similarity and influence |
| CN114884879A (en) * | 2022-05-06 | 2022-08-09 | 鹏城实验室 | Software defined network hybrid switching method based on label technology |
| CN114884879B (en) * | 2022-05-06 | 2023-07-14 | 鹏城实验室 | Software defined network hybrid switching method based on label technology |
| CN115550065A (en) * | 2022-11-25 | 2022-12-30 | 国网四川省电力公司信息通信公司 | Integrated network security analysis system and method based on large-scale multiple data sources |
| CN115550065B (en) * | 2022-11-25 | 2023-03-03 | 国网四川省电力公司信息通信公司 | Integrated network security analysis system and method based on large-scale multiple data sources |
| CN117119555A (en) * | 2023-10-24 | 2023-11-24 | 中国兵器科学研究院 | Lunar exploration time-varying topology group node self-adaptive networking routing method and system |
| CN117119555B (en) * | 2023-10-24 | 2024-04-26 | 中国兵器科学研究院 | Lunar exploration time-varying topology group node self-adaptive networking routing method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106888163A (en) | The method for routing divided based on network domains in software defined network | |
| CN104380667B (en) | The method for routing and equipment of a kind of data message | |
| CN108289104B (en) | Industrial SDN network DDoS attack detection and mitigation method | |
| CN103166876B (en) | Data transmission method for uplink and device between OpenFlow network domains | |
| CN104253770B (en) | Realize the method and apparatus of the distributed virtual switch system | |
| CN107566440A (en) | The automatic discovery that is serviced in the network environment of software definition and automatic scalable | |
| CN103825823B (en) | Data forwarding method based on different priorities in software-defined network | |
| CN104618244B (en) | A kind of SDN and the method and system of traditional IP intercommunication | |
| CN103986663B (en) | Data center and its method and network controller for realizing data processing | |
| CN104717098B (en) | A kind of data processing method and device | |
| US8775352B2 (en) | Methods and apparatus to model end-to-end class of service policies in networks | |
| CN103916326B (en) | System, method and equipment for data center | |
| CN106464522A (en) | A method and system for network function placement | |
| CN107071087A (en) | Logic L3 is route | |
| CN106105115A (en) | The service chaining originated by service node in network environment | |
| CN107147509A (en) | Centrex service implementation method, device and communication system | |
| CN107003860A (en) | A kind of software defined network controller and its creation method | |
| Ramesh et al. | FPGA implementation of 3D NOC using anti-hebbian for multicast routing algorithm | |
| CN108173694A (en) | The secure resources pond cut-in method and system of a kind of data center | |
| CN106921572A (en) | A kind of method, apparatus and system for propagating qos policy | |
| CN107566237A (en) | A kind of data message processing method and device | |
| WO2023206600A1 (en) | Low-delay and low-overhead path deployment method for active network telemetry | |
| CN108075982A (en) | Real-time route renewing method in software defined network | |
| CN103346950B (en) | Between a kind of rack wireless controller customer service plate, method and device are shared in load equally | |
| CN107046504A (en) | Method and controller for the traffic engineering in communication network |
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: 20170623 |
|
| RJ01 | Rejection of invention patent application after publication |