CN105306251B - A kind of method of mimicry network topology transformation - Google Patents
A kind of method of mimicry network topology transformation Download PDFInfo
- Publication number
- CN105306251B CN105306251B CN201510582300.XA CN201510582300A CN105306251B CN 105306251 B CN105306251 B CN 105306251B CN 201510582300 A CN201510582300 A CN 201510582300A CN 105306251 B CN105306251 B CN 105306251B
- Authority
- CN
- China
- Prior art keywords
- subnet
- equivalent
- network
- transformation
- node
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/147—Network analysis or design for predicting network behaviour
Abstract
A kind of method that the present invention has opened mimicry network topology transformation, overcomes in the prior art, network structure change problem to be solved.The invention has follow steps: the equivalent transformation step of a local subnet includes: the local subnet that A1. determination will carry out topoligical equivalence transformation；A2. method is described with network to be described abstractly the A1 local subnet determined；A3. the equivalent subnet based on local subnet described by constraint condition building A2；A4. original subnet is substituted with the subnet newly constructed.Compared with prior art, the method of mimicry network topology transformation of the present invention has the advantage that 1. this method achieve the effect that overall network topology converts by the topoligical equivalence transformation repeatedly to network local subnet, since the target of topological transformation is the subnet in network, rather than whole network, therefore the network size for substantially reducing topological transformation reduces the difficulty of network topology transformation.
Description
Technical field
The invention is related to the transform method in computer communication technology field, converts more particularly to a kind of mimicry network topology
Method.
Background technique
The basic thought of mimicry Prevention-Security be under the conditions of function equivalence, with provide target environment dynamic, it is non-really
It is dynamic to construct the diversified mimicry environment such as network for the purpose of qualitative, isomerism, non-standing, with the controllable side of defender
Formula implements actively jump or fast transferring between diversified environment, and the target ring that is difficult to observe and predict then is shown as to attacker
Border variation, to increase including unknown attack difficulty and cost using including loophole and back door.I.e. with uncertain right
Resist unknown threat.
The safety of mimicry network is by the uncertain reflected of network, and wherein the uncertainty of structure is that its is heavy
Want content.Varistructure network can be made by the dynamic change of network topology structure network have dynamic, isomerism and
Uncertainty makes network system have unpredictability for attacker from architecture angle, so that attack be significantly greatly increased
The attack difficulty of person.How to allow network structure according to constraint condition and pipe under the precondition for not influencing network function, performance
Reason person's intention progress dynamic change is one and needs to solve the problems, such as.To solve the above-mentioned problems, the present invention provides a kind of mimicry net
Network topological transformation method.
Summary of the invention
The present invention overcomes in the prior art, it is bright to provide a kind of effect for network structure change problem to be solved
The method of aobvious mimicry network topology transformation.
The technical solution of the invention is as follows, provides a kind of method of mimicry network topology transformation having following structure:
The equivalent transformation step of local subnet includes: the local subnet that A1. determination will carry out topoligical equivalence transformation；A2. network is used
Description method is described abstractly the A1 local subnet determined；A3. based on local subnet described by constraint condition building A2
Equivalent subnet；A4. original subnet is substituted with the subnet newly constructed.
The subnet size that topological transformation is carried out in step A1 is intended to any definition according to management decision-maker, and subnet is entire
A part in network or network, such as a node, a link or a connection subnet.
Step A2 will decide the subnet of local topology transformation to be carried out according to abutment points and adjacent attribute in step A1
It is described abstractly, specific mathematical description are as follows: assuming that weighted graph G=(V, E) is overall network topological diagram, if G1=(V1,E1) be
A subgraph in weighted graph G=(V, E), thenReferred to as subnet G1Adjoint point collection；
If A ∈ Γ (G1), it usesIndicate adjacent category of the subnet G1 on the chain road connecting with abutment points A
Property, it is indicated by binary group, wherein first elementIndicate the function collection that the chain road that subnet G1 is connect with node A is realized,
Second elementIndicate the link bandwidth that subnet G1 is connect with node A；Use binary groupIndicate one
A subnet G1, wherein Γ (G1) indicate the adjoint point collection of the subnet, L (G1) indicate that the subnet corresponds to the adjacent of each abutment points and belongs to
Property collection；No matter two network topological structures, if it is possible to be described as the same binary groupThen this
Two networks are equivalent, the mutual equivalent subnets for being known as other side, and the two networks replace mutually generated topological transformation
It is the transformation of mimicry network topology.
Step A3 is based on available redundancy resource or topological variation requires to be described as constraint condition and constructs topological become
Equivalent subnet after change.Available redundancy resource includes network switching node and the link for connecting network node；Available redundancy
The state of resource includes network switching node state and link state, and network switching node state includes available network switching node
Distribution, network switching node function, link state is primarily referred to as available link bandwidth.
The distribution of the network switching node refers to the relationship of switching node and other switching nodes in network；The net
The function of network switching node refers to the data type that switching node can exchange, specifically include IPv4, IPv6, MPLS and
OpenFlow。
The available redundancy resource includes: the enough structures of B1. redundant resource by the result that decision condition can be determined that
Build equivalent subnet；B2. equivalent subnet can be constructed with full resource；B3. whether can go out equivalent subnet with fragment resource construction；
If it is determined that being as a result unsatisfactory for B1 but meeting B2, constraint condition includes: that the subnet after C1. topological transformation must expire
Sufficient function, performance are fully equivalent；C2. the subnet after topological transformation must satisfy function equivalence, but performance can degrade, degradation threshold
Value limits within the specified range；C3. the subnet after topological transformation must satisfy Performance Equivalent, but function can degrade, degradation threshold
Value limits within the specified range；C4. its function of the subnet after topological transformation, performance can degrade, but degradation threshold value is limited to finger
Determine in range；
If it is determined that result is B1, constraint condition includes: that D1. resources optimization constructs equivalent subnet；D2. building speed is excellent
First construct equivalent subnet；
D3. topological variation, which maximizes, constructs equivalent subnet etc..
If it is determined that being as a result unsatisfactory for B2 but meeting B3, constraint condition includes: E1. with the maximum section of nodal function reusing degree
Point carries out subnet decomposition as node is participated in；E2. subnet decomposition is carried out referring to node to meet the node of bandwidth requirement.
The process that the subnet decomposes is the subnet according to the description of abstractdesription method according to function or link bandwidth etc.
Constraint condition is divided into multiple subnets, and still equivalent with atom net after the subnet superposition after decomposition, then the decomposition is equivalent point
Solution, the multiple subnets generated after decomposition are to decompose subnet.
Compared with prior art, the method for mimicry network topology transformation of the present invention has the advantage that
1. the effect that this method reaches overall network topology transformation by the topoligical equivalence transformation repeatedly to network local subnet
Fruit, since the target of topological transformation is the subnet in network, rather than whole network, therefore substantially reduce the network of topological transformation
Scale reduces the difficulty of network topology transformation；
2. describing method based on subnet provided by the invention, the arbitrary portion in network can be described abstractly, from
One link, a node are to a connection subnet, even whole network, to considerably increase the spirit of network topology transformation
Activity；
3. providing the method for flexible Application available resources based on the method that network available resource constructs equivalent subnet, it is based on
This method can be such that equivalent subnet building process is not influenced by resource constraint, can construct under the conditions of various resource status
Imitate the subnet of subnet or Approximate Equivalent.
Detailed description of the invention
Fig. 1 is the flow chart of the method for mimicry network topology transformation of the present invention；
Fig. 2 is the definition schematic diagram of local subnet in the method for mimicry network topology transformation of the present invention；
Fig. 3 is the schematic diagram of local subnet abstractdesription method in the method for mimicry network topology transformation of the present invention；
(1) and (2) is two kinds of schematic diagrames of equivalent subnet in the method for mimicry network topology transformation of the present invention in Fig. 4；
(1), (2) and (3) is that subnet is raw by Function Decomposition in method Fig. 2 of mimicry network topology transformation of the present invention in Fig. 5
At decomposition subnet schematic diagram；
(1) and (2) is that subnet is given birth to by link bandwidth decomposition in method Fig. 2 of mimicry network topology transformation of the present invention in Fig. 6
At decomposition subnet schematic diagram；
(1), (2) and (3) is that full resource and fragment resource are general in the method for mimicry network topology transformation of the present invention in Fig. 7
Read schematic diagram；
(1) and (2) is the decomposition based on nodal function reusing degree in the method for mimicry network topology transformation of the present invention in Fig. 8
Constructing plan schematic diagram；
Fig. 9 is the decomposition constructing plan based on simple function bandwidth constraint in the method for mimicry network topology transformation of the present invention
Schematic diagram.
Specific embodiment
Give to explain below for the mark occurred in Detailed description of the invention:Indicate node,Indicate nodal function,20、25、30、35、40、50、60Indicate link bandwidth.
The method of mimicry network topology of the present invention transformation is described further with reference to the accompanying drawings and detailed description:
Can allow network under equivalent condition based on this method, dynamically construct network topology, thus provide the dynamic of network topology,
Uncertainty, isomerism are implemented actively to jump or quickly move between diversified topological environmental in the controllable mode of network architect
It moves, the change in topology for making it show as being difficult to observe and predicting to attacker.Wherein the network equivalent refers to topological transformation
The indices such as function, performance of network are consistent with the network before transformation afterwards, i.e., the network before and after topological transformation can be with abstract
Description method is described as the same network.
Network abstraction, which describes method not, to be described by constituting the linking relationship between the node set and node of network,
But network is described by the network external connection point and connection attribute.
Mimicry network topology transform method provided by the invention is by the equivalent transformation to connection subnet local in network
Change the local topology of network, to achieve the effect that whole mimicry network topology transformation.Local subnet it is equivalent
Shift step includes:
A1. determination will carry out the local subnet of topoligical equivalence transformation；
A2. method is described with above-mentioned network to be described abstractly the A1 subnet determined；
A3. the equivalent subnet based on subnet described by constraint condition building A2；
A4. original subnet is substituted with the subnet newly constructed；
Wherein, it is any fixed to refer to that the subnet size of topological transformation to be carried out can be intended to according to management decision-maker by step A1
Justice, as long as method description can be described with network abstraction.The subnet that carry out topological transformation can be whole network, can also
To be a part in network, such as a node, a link or a connection subnet.Excessively flexible describing mode makes
Concrete engineering, which is difficult to determine how during realizing, to be started which part of network to carry out topological transformation, therefore also needs spy
Fixed constraint condition elects strategy to the determining local subnet for needing to carry out topoligical equivalence transformation, this is not belonging to of the invention
Summary of the invention.
Step A2 is exactly to describe method with above-mentioned network to decide the network of local topology transformation to be carried out according to neighbour
Contact and adjacent attribute are described abstractly, in order to the progress of subsequent step.
As shown in Fig. 3, it is abstractdesription method to one of subnet.It is by constituting network that this, which describes method not,
Node set and node between linking relationship description, but by the network external connection point and connection attribute to network
It is described.
Specific mathematical description are as follows: if G1=(V1,E1) it is a subgraph in weighted graph G=(V, E), thenThe referred to as adjoint point collection of subnet G'；If A ∈ Γ (G1), it usesIt indicates adjoining attribute of the subnet G1 on the chain road connecting with abutment points A, is indicated by binary group,
In first elementIndicate the function collection that the chain road that subnet G1 is connect with node A is realized, second elementIt indicates
The link bandwidth that subnet G1 is connect with node A；Use binary groupIndicate a subnet G1, wherein Γ (G1)
Indicate the adjoint point collection of the subnet, L (G1) indicate that the subnet corresponds to the adjoining property set of each abutment points.With pictorial representation
It is denoted as black box subnet as shown in Fig. 3, does not need to be concerned about its internal topology using the subnet that this method describes
How.No matter two network topological structures, if it is possible to be described as the same binary groupThen this
Two networks are equivalent, the mutual equivalent subnets for being known as other side, and the two networks replace mutually generated topological transformation
It is the transformation of mimicry network topology.As of figure 4 the entirely different subnet of two topological structures can Unify legislation be
Subnet shown in Fig. 3, therefore the equivalent subnet each other of two subnets in Fig. 4.
Since step A3, exactly try to construct the equivalent subnet after a change in topology.But it can for same subnet
To derive the equivalent subnet of a variety of isomeries, if other any constraint conditions are not considered, for subnet described in step A2
Theoretically there is infinite multiple equivalent subnets, these equivalent subnets are all theoretically the solutions of network topology equivalent transformation, constitute institute
The equivalent transformation solution space of subnet is described.In order to determine unique solution in above-mentioned solution space, need to be arranged some constraint conditions, about
Beam condition is different, and corresponding equivalent subnet developing algorithm is also different, and constraint condition of the present invention includes: available redundancy money
Source, topological variation requirement etc..The present invention is described mainly around this constraint condition of available redundancy resource.
Available redundancy resource is to convert preset resource in order to which mimicry network carries out mimicry, these resources can according to need
Transformation is reconstructed, to adapt to different demands.In different moments, available redundancy resource status is different, and resource status influence etc.
Imitate the selection and application of subnet developing algorithm.Redundant resource includes: network switching node, and the link for connecting network node
Deng；Corresponding redundant resource state includes: network switching node state and link state.For network switching node, state
Distribution, each nodal function including enabled node；For link, its state is primarily referred to as available link bandwidth.The exchange section
Point distribution refers to the relationship of switching node and other switching nodes in network, if having link phase among certain two switching node
Lian Ze two nodes have a syntople, switching node distribution then by the switching node and which node have syntople
Description.The switching node function refers to the data type that switching node can exchange, and specifically includes: IPv4, IPv6,
MPLS, OpenFlow etc..
It is also different according to the different selectable equivalent subnet developing algorithms of resource status, therefore determining available resources state
It also needs to carry out primitive decision to available resources afterwards.Include: based on the result that decision condition can be determined that
B1. whether redundant resource constructs equivalent subnet enough；
B2. whether equivalent subnet can be constructed with full resource；
B3. whether can go out equivalent subnet with fragment resource construction.
Above-mentioned each judgement result is successively provided according to certain logical relation.Even if under same asset status condition, base
Equivalent subnet its topological structure obtained in algorithms of different may be also different, thus how selection algorithm also need to follow it is certain
Constraint condition.
Basic definition is provided first.In all selectable algorithms, one kind is to be decomposed based on subnet and constructed decomposition
The class of algorithms of the equivalent subnet of subnet, mentions the concept of full resource and fragment resource in this kind of algorithm, provides first basic
Definition.It as shown in Fig. 7, is that full resource and fragment resource concept illustrate legend.
The resource that full resource is used during referring to the equivalent subnet of building had both met the bandwidth demand of link building,
Meet distribution and the functional requirement of node building, such resource is referred to as in the full resource such as Fig. 7 for constructing the equivalent subnet
(1) and shown in (2)；The fragment resource refers to the resource used in building process or is that link bandwidth is unsatisfactory for building need
It asks or is Node distribution or function is unsatisfactory for demand and is then known as fragment resource, as shown in (3) in Fig. 7.
B1 is unsatisfactory for according to judgement result but meets B2, if redundant resource not enough constructs equivalent subnet, is needed into one
Step determines how to selection algorithm according to constraint condition, and constraint condition includes:
C1. it is fully equivalent to must satisfy function, performance for the subnet after topological transformation；
C2. the subnet after topological transformation must satisfy function equivalence, but performance can degrade, and degradation threshold value is limited to specified
In range；
C3. the subnet after topological transformation must satisfy Performance Equivalent, but function can degrade, and degradation threshold value is limited to specified
In range；
C4. its function of the subnet after topological transformation, performance can degrade, but degradation threshold value limits within the specified range.
If it is determined that result is B1, constraint condition includes:
D1. resources optimization constructs equivalent subnet；
D2. building speed-priority constructs equivalent subnet；
D3. topological variation, which maximizes, constructs equivalent subnet etc..
It is needed further if equivalent subnet can be gone out with fragment resource construction according to resource shape according to judgement result B3
State carries out equivalent decomposition to original subnet, and then carries out each equivalent subnet building for decomposing subnet again.According to abstractdesription method
The subnet of description is known as subnet according to the process that the constraint conditions such as function or link bandwidth can be divided into multiple subnets and decomposes,
Still equivalent with atom net after subnet superposition after decomposition, then the decomposition is equivalent decomposition, the multiple subnets generated after decomposition
It is to decompose subnet.It as shown in Fig. 5, is the decomposition subnet legend generated to subnet described by Fig. 3 by Function Decomposition, such as attached drawing 6
It is shown, it is that the decomposition subnet legend generated is decomposed by link bandwidth to subnet described by Fig. 3.
Available resources have uncertainty, in order to enable the subnet after decomposing can be abundant when carrying out the building of equivalent subnet
Using available resources, just have to carry out the decomposition for meeting certain resource constraints, resource constraint according to resource status
It is exactly decomposition goal, if it is decided that result is unsatisfactory for B2 but meets B3, and constraint condition includes:
E1. subnet decomposition is carried out using the maximum node of nodal function reusing degree as node is participated in；
E2. subnet decomposition is carried out referring to node to meet the node of bandwidth requirement.
It as shown in Fig. 8, is a kind of decomposition constructing plan for subnet shown in Fig. 3 based on nodal function reusing degree, such as
It is a kind of decomposition constructing plan for subnet shown in Fig. 3 based on simple function bandwidth constraint shown in attached drawing 9.
Claims (6)
1. a kind of equivalent changing method of mimicry network topology, it is characterised in that: the equivalent transformation step packet of a local subnet
It includes:
A1. determination will carry out the local subnet of topoligical equivalence transformation, wherein to carry out the subnet size of topological transformation according to management
Policymaker is intended to any definition, and subnet is a part in whole network or network, a node, a link or a connection
Subnet；
A2. describe method with network to be described abstractly the A1 local subnet determined, detailed process is as follows: according to abutment points and
Adjacent attribute is described abstractly, specific mathematical description are as follows: weighted graph G=(V, E) is overall network topological diagram, G1=(V1,E1) be
A subgraph in weighted graph G=(V, E),Referred to as subnet G1Adjoint point collection；Such as
Fruit A ∈ Γ (G1), it usesIndicate adjoining attribute of the subnet G1 on the chain road connecting with abutment points A,
It is indicated by binary group, wherein first elementIndicate the function collection that the chain road that subnet G1 is connect with abutment points A is realized,
Second elementIndicate the link bandwidth that subnet G1 is connect with abutment points A；Use binary groupIt indicates
Subnet G1, L (G1) indicate that the subnet corresponds to the adjoining property set of each abutment points；No matter two network topological structures, energy
Enough it is described as the same binary groupThen the two networks are equivalent, are known as the equivalent of other side mutually
Subnet, and it is the transformation of mimicry network topology that the two networks, which replace mutually generated topological transformation,；
A3. the equivalent subnet based on local subnet described by constraint condition building A2；
A4. original subnet is substituted with the subnet newly constructed.
2. the equivalent changing method of mimicry network topology according to claim 1, it is characterised in that: the step A3 is based on
Available redundancy resource or topological variation require that the equivalent subnet after building change in topology is described as constraint condition.
3. the equivalent changing method of mimicry network topology according to claim 2, it is characterised in that: the available redundancy money
Source includes network switching node and the link for connecting network node；The state of available redundancy resource includes network switching node
State and link state, network switching node state include the function of the distribution of available network switching node, network switching node,
Link state refers to available link bandwidth.
4. the equivalent changing method of mimicry network topology according to claim 3, it is characterised in that: the network exchange section
The distribution of point refers to the relationship of switching node and other switching nodes in network；The function of the network switching node refers to friendship
The data type that node can exchange is changed, IPv4, IPv6, MPLS and OpenFlow are specifically included.
5. the equivalent changing method of mimicry network topology according to claim 2, it is characterised in that: the available redundancy money
Source includes: by the result that decision condition can be determined that
B1. redundant resource constructs equivalent subnet enough；
B2. equivalent subnet can be constructed with full resource；
B3. it can go out equivalent subnet with fragment resource construction；
If it is determined that being as a result unsatisfactory for B1 but meeting B2, constraint condition includes:
C1. it is fully equivalent to must satisfy function, performance for the subnet after topological transformation；
C2. the subnet after topological transformation must satisfy function equivalence, but performance can degrade, and degradation threshold value is limited to specified range
It is interior；
C3. the subnet after topological transformation must satisfy Performance Equivalent, but function can degrade, and degradation threshold value is limited to specified range
It is interior；
C4. its function of the subnet after topological transformation, performance can degrade, but degradation threshold value limits within the specified range；
If it is determined that result is B1, constraint condition includes:
D1. resources optimization constructs equivalent subnet；
D2. building speed-priority constructs equivalent subnet；
D3. topological variation, which maximizes, constructs equivalent subnet；
If it is determined that being as a result unsatisfactory for B2 but meeting B3, constraint condition includes:
E1. subnet decomposition is carried out using the maximum node of nodal function reusing degree as node is participated in；
E2. subnet decomposition is carried out referring to node to meet the node of bandwidth requirement.
6. the equivalent changing method of mimicry network topology according to claim 5, it is characterised in that: what the subnet decomposed
Process is to be divided into multiple subnets according to function or link bandwidth constraint condition according to the subnet of abstractdesription method description, point
Still equivalent with atom net after subnet superposition after solution, then the decomposition is equivalent decomposition, and the multiple subnets generated after decomposition are
Decompose subnet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510582300.XA CN105306251B (en) | 2015-09-14 | 2015-09-14 | A kind of method of mimicry network topology transformation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510582300.XA CN105306251B (en) | 2015-09-14 | 2015-09-14 | A kind of method of mimicry network topology transformation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105306251A CN105306251A (en) | 2016-02-03 |
| CN105306251B true CN105306251B (en) | 2018-12-18 |
Family
ID=55203035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510582300.XA Active CN105306251B (en) | 2015-09-14 | 2015-09-14 | A kind of method of mimicry network topology transformation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105306251B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106713262B (en) * | 2016-11-17 | 2020-05-15 | 上海红阵信息科技有限公司 | Credibility-based heterogeneous executive dynamic scheduling device and scheduling method thereof |
| US9954611B1 (en) * | 2016-12-16 | 2018-04-24 | Futurewei Technologies, Inc. | System and method for abstracting wavelength-switched optical network traffic engineering topology in SDN control hierarchy |
| CN108055232B (en) * | 2017-10-30 | 2020-11-06 | 中国人民解放军空军工程大学 | High-speed lightweight mimicry virtual network construction method |
| CN109218440B (en) * | 2018-10-12 | 2020-12-15 | 上海拟态数据技术有限公司 | Dynamic scheduling method for heterogeneous executive bodies of scene simulation web server |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127649A (en) * | 2007-09-30 | 2008-02-20 | 华为技术有限公司 | A method and system for preventing from network attacks |
-
2015
- 2015-09-14 CN CN201510582300.XA patent/CN105306251B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127649A (en) * | 2007-09-30 | 2008-02-20 | 华为技术有限公司 | A method and system for preventing from network attacks |
Non-Patent Citations (2)
| Title |
|---|
| "动态弹性安全防御技术及发展趋势";刘杰等;《通信技术》;20150228;第117-123页 * |
| "网络空间拟态安全防御";邬江兴;《保密科学技术》;20141031;第1-9页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105306251A (en) | 2016-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113316118B (en) | Unmanned aerial vehicle cluster network self-organizing system and method based on task cognition | |
| Bai et al. | Network approach for resilience evaluation of a UAV swarm by considering communication limits | |
| CN110138764B (en) | Attack path analysis method based on hierarchical attack graph | |
| CN105306251B (en) | A kind of method of mimicry network topology transformation | |
| CN110022230B (en) | Deep reinforcement learning-based service chain parallel deployment method and device | |
| CN111478811B (en) | Network key point analysis method based on double-layer information flow transmission | |
| Darabseh et al. | A software-defined architecture for control of IoT cyberphysical systems | |
| Lin et al. | Topology‐based distributed optimization for multi‐UAV cooperative wildfire monitoring | |
| Saghiri et al. | An approach for designing cognitive engines in cognitive peer-to-peer networks | |
| Ghosh et al. | A cognitive routing framework for reliable communication in IoT for industry 5.0 | |
| CN113341712B (en) | Intelligent hierarchical control selection method for unmanned aerial vehicle autonomous control system | |
| Firouz et al. | A novel controller placement algorithm based on network portioning concept and a hybrid discrete optimization algorithm for multi-controller software-defined networks | |
| CN104618130A (en) | Minimum cost synchronization method of data center network controller by using software | |
| Khamfroush et al. | On propagation of phenomena in interdependent networks | |
| Lu et al. | Security-aware routing protocol based on artificial neural network algorithm and 6LoWPAN in the internet of things | |
| Geyik et al. | Dynamic composition of services in sensor networks | |
| Dowling et al. | Building autonomic systems using collaborative reinforcement learning | |
| CN104410529A (en) | Minimum cover deployment method for controllers based on software definition data center network | |
| CN115913979A (en) | Global network topology processing method and device | |
| Rodríguez et al. | Exploring complex networks with failure-prone agents | |
| Bhavanasi et al. | Dealing with changes: Resilient routing via graph neural networks and multi-agent deep reinforcement learning | |
| Dzaferagic et al. | Improving in-network computing in IoT through degeneracy | |
| CN106452897A (en) | Method for placing controllers of software defined network | |
| Chen et al. | Dynamic hypernetwork-based evolutionary model of command-and-control network | |
| Ngo et al. | ATOM: An Efficient Topology Adaptive Algorithm for Minor Embedding in Quantum Computing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170809 Address after: 201112 3A building, No. 1588 union airways, Shanghai, Minhang District Applicant after: Shanghai RedNeurons Information Technology Co., Ltd. Applicant after: National Digital Switch System Engineering Technology Research Center Address before: 201112 3A building, No. 1588 union airways, Shanghai, Minhang District Applicant before: Shanghai RedNeurons Information Technology Co., Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |