CN103139212A - Security service method of complex network - Google Patents
Security service method of complex network Download PDFInfo
- Publication number
- CN103139212A CN103139212A CN 201310049575 CN201310049575A CN103139212A CN 103139212 A CN103139212 A CN 103139212A CN 201310049575 CN201310049575 CN 201310049575 CN 201310049575 A CN201310049575 A CN 201310049575A CN 103139212 A CN103139212 A CN 103139212A
- Authority
- CN
- China
- Prior art keywords
- node
- cellular
- state
- time
- complex network
- 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
Abstract
The invention discloses a security service method of a complex network. A cellular automation model is built, a model used for preventing malicious information flow transmission of the complex network is built abstractly through borrowing ideas from the method for solving traffic jam and controlling traffic flow in the traffic flow, time and route of state changing of cellular are recorded in the process of evolution, and therefore the quantitative criteria of an optimal path, namely, transmission path and time between source nodes and goal nodes are built. Optimal routing is achieved in the process of transmission of a large amount of malicious information flow due to integration of ideas of traffic flow guidance and optimization, the information transfer process is accelerated so that the straightforward line which consumes the minimal time between any two network nodes in the complex network can be found conveniently and the immunization degree to the malicious information flow by the complex network is improved, and a topological structure is perfected.
Description
Technical field
The invention belongs to a kind of method of complex network security service, particularly a kind of based on Optimal Traffic Control Model, utilize cellular automata that the method for security service discovery and security service distribution is provided for complex network.
Background technology
Along with making constant progress of society; people also increase rapidly the degree of dependence of Internet thereupon; this might make various fallacious message streams to propagate into easily in the world each corner by means of Internet; and scale trend was obviously strengthened with comparing also in the past; the Internet of hence one can see that today has been faced with various security threats, and its safety problem also enjoys people's concern.Therefore, the propagation dynamic behavior of research fallacious message stream is grasped its propagation law, and proposes on this basis effectively to reduce fallacious message and spread the measure that works the mischief of broadcasting, and all important realistic meaning will be arranged to the mankind's development and the progress of society.
Transportation network is as the basic physics facility of the transportation stream of people and logistics, and the socio-economic development of a city, country and even All Around The World is all had very important effect.Simultaneously, traffic flow has randomness, dynamic and the complexity of height on time, space, and traffic system shows abundant nonlinear characteristic, has the feature of complex network.Since the nineties, the computer technology that develops rapidly makes the large-scale computer simulation that the basis of development arranged.1986, Creme: first Cellular Automaton Theory is applied to field of traffic, for new approach has been opened up in the research of this complication system of traffic flow.In the same year, Wolftam has proposed No. 184 CA models and has been used for the traffic flow simulation, and this i.e. the most basic traffic flow CA model.Cellular automata (CA) traffic flow model be owing to can disclose abiogenous macroscopic behavior by simple microcosmic local rule, and is particularly suitable for large-scale calculations, therefore enjoys to catch people's attention, and is with fastest developing speed.The two-dimentional traffic flow CA model of American scientist Biham proposition in 1992-BML model; 1992, the one dimensional traffic flow CA model that German scholar K.Nagel and M.Schreckenberg propose-NS model (being the Nasch model).These two kinds of models are to be employed research the most at present.The concept of cellular automata (CA) is proposed by Von Neumann as far back as the 1950's, be mainly used in simulating the self-replication function that life system has, it really obtains extensive concern is that CA is widely used in every field subsequently after Conway proposed the life competition in 1970.Reason is that the simple model of this class can copy complicated phenomenon or the attraction in Dynamic Evolution, self-organizing and chaos phenomenon very easily.Therefore CA is widely used in simulating various physical systems and natural phenomena at present, as Fluid Flow in A, galaxy formation, snowslide, traffic flow simulation, parallel computation and earthquake etc.The advantage of simulating a physical process with CA is to have saved the use differential equation as transition, and directly by laying down a regulation to simulate the nonlinear physics phenomenon.In these practical applications, the CA model has disclosed abiogenous macroscopic behavior by simple microcosmic local rule, is to study at present the discrete desirable physical model of space-time, is considered to one of a kind of the most effective instrument aspect complication system in research.
Traffic flow often faces the congested problem of vehicle in reality, for this reason, experts and scholars have proposed the strategy process that some transport solutions block up, and controls, responds to control etc. as ring road.Qiao Ming has discussed how to distribute the Entrance ramp wagon flow so that maximize the expressway flow.They are take one section expressway, bicycle road with continuous two Entrance ramps as background, at first the Entrance ramp vehicle has been discussed has been incorporated into several situations of main road, then illustrated in which kind of situation by cellular Automation Model and will larger transport need have distributed to the upstream ring road and can increase the whole traffic capacity in expressway, and having given checking, the propagation in traffic model has a lot of similar places with a large amount of vehicle stream in the transmission of fallacious message stream in complex network.
Summary of the invention
1. the object of the present invention is to provide a kind of method of complex network security service, the sociological method that transport solution in traffic flow is blocked up, controls the flow of traffic is out abstract, thereby in order to find the straightforward line of used time minimum between any two network nodes to improve complex network for the epidemic prevention degree of fallacious message stream, improve its topological structure in complex network.
2. the technical solution that realizes the object of the invention is:
A kind of method of complex network security service, adopt following steps:
Step 1, set up cellular Automation Model: definition
Be set of node,
Be the minimum connection Route Set of D,
Be best through route collection; Set up cellular automata
, wherein
Mesh space for regular partition; State set
, wherein: when k=0, represent that this node is in initial condition, namely this node is also not find best route, when k=1, represents that this node is in maturity state, namely this node is the node that has found the best transmission route; P is illustrated in the propagation time under current state, and when k=1, p is the used time total on the best transmission circuit;
The node subscript that represents the upper process of this node on the transmission line of current state, when k=1,
The subscript of node of a upper process of this node on the best transmission circuit, the note cellular
State be (1, pi,
); Definition center cellular
Neighborhood
,
For
In-degree add 1; F is the local evolution rule of cellular automata; The definition evolution time is t, gets initial time
, time interval is 1; Initial time, cellular
State be (1,0,1), cellular
Initial condition be (0, t, 1), i=2,3 ..., n, automaton is from constantly
Begin to develop; For evolution time t the time, evolution rule f is: to the cellular of state for (0, t, 1)
If,
,
∈ N (
) satisfy
With
, cellular
State be changed to (1, t, i) by (0, t, 1); Corresponding states be (1, pi,
) cellular
State remains unchanged;
Step 2, set up the complex network Optimal Traffic Control Model based on cellular Automation Model
All nodes are divided into B and two set of C, wherein: B is for obtaining the best node set of propagating circuit, C does not obtain the best node set of propagating circuit, begin outwards to be searched for by start node from certain feasible assignment, progressively will obtain the best node of propagating circuit and put into set B from set C.
Setting up the node of establishing in complex network based on the complex network Optimal Traffic Control Model of cellular Automation Model in described step 2 is
, node
With
Between the through route of used time minimum be
, namely directly be communicated with between two nodes; If directly be not communicated with between two nodes, minimum communication line is designated as 0, when establishing communication, is T in the delay of each node, the used time of fallacious message stream between from the source node to the destination node be the transmission time and time of delay sum.Under the cellular evolution rule f and the time t that develops of above-mentioned definition, all satisfy condition:
Cellular
State become (1, t, i) by (0, t, 1), t becomes t+1, enters the cellular evolutionary process under the next evolution time; When all cellulars
Satisfy
The time, the state that no longer includes cellular changes, and the evolution of automaton stops.
Foundation is as follows based on the complex network Optimal Traffic Control Model algorithm steps of cellular Automation Model: use
The expression node
Relation belonging in set C or B, namely
,
Record node
A upper node. find the solution in complex network a large amount of fallacious messages and spread that to broadcast the concrete calculation procedure of the algorithm of dredging as follows:
If all nodes of step 3
Have
, use the backward tracing method, obtain the optimal solution of communication in complex network, finish;
3, beneficial effect of the present invention.
The present invention compared with prior art, its remarkable advantage: (1) uses for reference the method that in traffic flow, transport solution blocks up, controls the flow of traffic, abstract foundation out prevents in complex network that fallacious message from spreading the method for broadcasting, and recorded the moment and route that the state of cellular changes in the evolution process; (2) evolution rule of cellular automata is easily understood, and is easy to operate, and amount of calculation is little, and evolution rule is only right
Cellular work; (3) algorithm state is few, and the neighborhood of center cellular is simple.
Embodiment
Embodiment 1
A kind of method of complex network security service, step is as follows:
(1), set up two dimensional cellular automaton, be used for nodal information in the Simulation of Complex network
A cellular automata system can be expressed as
, comprise mesh space C, discrete finite state set Q, the neighborhood V of cellular and the four-tuple of local transfer function f of regular partition.F is also referred to as the local evolution rule of cellular automata, and it is the core of cellular automata.
Be best through route collection.Set up cellular automata
, wherein
Definition center cellular
Neighbours
,
For
In-degree add 1.
The definition evolution time is t, gets initial time
, time interval is 1.Initial time, cellular
State be (1,0,1), cellular
State be (0, t, 1).
Under current evolution time t, evolution rule f is: to the cellular of state for (0, t, 1)
If,
,
∈ N (
) satisfy
With
, cellular
State be changed to (1, t, i) by (0, t, 1); Corresponding states be (1, pi,
) cellular
State remains unchanged.
(2), foundation is based on the complex network security service method of Optimal Traffic Control Model
When complex network faces a large amount of fallacious message stream attack, the invention provides a kind of flow optimization algorithm based on Optimal Traffic Control Model.The purpose of algorithm is: in complex network, and the straightforward line of used time minimum between known any two network nodes, network delay is considered in the communication between from the source node to the destination node, how to make whole network topology structure minimum.Algorithm idea: all nodes are divided into B and two set of C, and wherein: B is for obtaining the best node set of propagating circuit; C does not obtain the best node set of propagating circuit, begins outwards to be searched for by start node from certain feasible assignment, progressively will obtain the best node of propagating circuit and put into set B from set C.
Can obtain a large amount of fallacious messages in complex network are spread to the analysis of final cellular state and broadcast the optimal solution of dredging.Take out cellular
End-state (1, pn,
), obtain from node thus
To node
Selecting best total used time of propagating circuit is pn.Propagate on circuit node in the best
The node of previous propagation node under be designated as
, this is propagated cellular corresponding to node continues to analyze the node subscript that obtains again next propagation node, until search out node
Till.Obtain thus in complex network a large amount of fallacious messages and spread the solution of broadcasting the optimal route of dredging.
Embodiment 2
A kind of security service method of complex network, its step is as follows:
1. set up cellular automata and describe node in complex network
State set
, wherein: when k=0, represent that this node is in initial condition, namely this node is also not find best route, when k=1, represents that this node is in maturity state, namely this node is the node that has found the best transmission route; P is illustrated in the propagation time under current state, and when k=1, p is the used time total on the best transmission circuit;
The node subscript that represents the upper process of this node on the transmission line of current state, when k=1,
The subscript of node of a upper process of this node on the best transmission circuit, the note cellular
State be (1, pi,
).
Cellular
Initial condition be (1,0,1), cellular
Initial condition be (0, t, 1), i=2,3 ..., n, automaton is from constantly
Begin to develop.
2. set up the complex network security service method based on Optimal Traffic Control Model
If the node in complex network is
, node
With
Between the through route of used time minimum be
, namely directly be communicated with between two nodes; If directly be not communicated with between two nodes, minimum communication line is designated as 0, when establishing communication, is T in the delay of each node, the used time of fallacious message stream between from the source node to the destination node be the transmission time and time of delay sum.
Under the cellular evolution rule f and the time t that develops of above-mentioned definition, all satisfy condition:
Cellular
State become (1, t, i) by (0, t, 1), t becomes t+1, enters the cellular evolutionary process under the next evolution time.When all cellulars
Satisfy
The time, the state that no longer includes cellular changes, and the evolution of automaton stops.
A kind of concrete steps of algorithm of the complex network security service based on Optimal Traffic Control Model are as follows:
With
The expression node
Relation belonging in set C or B, namely
,
Record node
A upper node. find the solution in complex network a large amount of fallacious messages and spread that to broadcast the concrete calculation procedure of the algorithm of dredging as follows:
If all nodes of step 3
Have
, use the backward tracing method, obtain the optimal solution of communication in complex network, finish;
Above-described embodiment does not limit the present invention in any way, and every employing is equal to replaces or technical scheme that the mode of equivalent transformation obtains all drops in protection scope of the present invention.
Claims (3)
1. the method for a complex network security service is characterized in that adopting following steps:
Step 1, set up cellular Automation Model: definition
Be set of node,
Be the minimum connection Route Set of D,
Be best through route collection; Set up cellular automata
, wherein
Mesh space for regular partition; State set
, wherein: when k=0, represent that this node is in initial condition, namely this node is also not find best route, when k=1, represents that this node is in maturity state, namely this node is the node that has found the best transmission route; P is illustrated in the propagation time under current state, and when k=1, p is the used time total on the best transmission circuit;
The node subscript that represents the upper process of this node on the transmission line of current state, when k=1,
The subscript of node of a upper process of this node on the best transmission circuit, the note cellular
State be (1, pi,
); Definition center cellular
Neighborhood
,
For
In-degree add 1; F is the local evolution rule of cellular automata; The definition evolution time is t, gets initial time
, time interval is 1; Initial time, cellular
State be (1,0,1), cellular
Initial condition be (0, t, 1), i=2,3 ..., n, automaton is from constantly
Begin to develop; For evolution time t the time, evolution rule f is: to the cellular of state for (0, t, 1)
If,
,
∈ N (
) satisfy
With
, cellular
State be changed to (1, t, i) by (0, t, 1); Corresponding states be (1, pi,
) cellular
State remains unchanged;
Step 2, set up the complex network Optimal Traffic Control Model based on cellular Automation Model
All nodes are divided into B and two set of C, wherein: B is for obtaining the best node set of propagating circuit, C does not obtain the best node set of propagating circuit, begin outwards to be searched for by start node from certain feasible assignment, progressively will obtain the best node of propagating circuit and put into set B from set C.
2. the method for complex network security service according to claim 1 is characterized in that: setting up the node of establishing in complex network based on the complex network Optimal Traffic Control Model of cellular Automation Model in described step 2 is
, node
With
Between the through route of used time minimum be
, namely directly be communicated with between two nodes; If directly be not communicated with between two nodes, minimum communication line is designated as 0, when establishing communication, is T in the delay of each node, the used time of fallacious message stream between from the source node to the destination node be the transmission time and time of delay sum.
3. under the cellular evolution rule f and the time t that develops of above-mentioned definition, all satisfy condition:
Cellular
State become (1, t, i) by (0, t, 1), t becomes t+1, enters the cellular evolutionary process under the next evolution time; When all cellulars
Satisfy
The time, the state that no longer includes cellular changes, and the evolution of automaton stops;
The method of complex network security service according to claim 2 is characterized in that: set up as follows based on the complex network Optimal Traffic Control Model algorithm steps of cellular Automation Model: use
The expression node
Relation belonging in set C or B, namely
,
Record node
A upper node. find the solution in complex network a large amount of fallacious messages and spread that to broadcast the concrete calculation procedure of the algorithm of dredging as follows:
If all nodes of step 3
Have
, use the backward tracing method, obtain the optimal solution of communication in complex network, finish;
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 201310049575 CN103139212A (en) | 2013-02-07 | 2013-02-07 | Security service method of complex network |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 201310049575 CN103139212A (en) | 2013-02-07 | 2013-02-07 | Security service method of complex network |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103139212A true CN103139212A (en) | 2013-06-05 |
Family
ID=48498518
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN 201310049575 Pending CN103139212A (en) | 2013-02-07 | 2013-02-07 | Security service method of complex network |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103139212A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109460949A (en) * | 2018-10-10 | 2019-03-12 | 上海工程技术大学 | A kind of logistics network optimization method based on hybrid automaton |
CN109934850A (en) * | 2019-03-21 | 2019-06-25 | 北京沃东天骏信息技术有限公司 | The methods, devices and systems that moving target counts |
-
2013
- 2013-02-07 CN CN 201310049575 patent/CN103139212A/en active Pending
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109460949A (en) * | 2018-10-10 | 2019-03-12 | 上海工程技术大学 | A kind of logistics network optimization method based on hybrid automaton |
CN109460949B (en) * | 2018-10-10 | 2021-12-07 | 上海工程技术大学 | Logistics network optimization method based on hybrid automaton |
CN109934850A (en) * | 2019-03-21 | 2019-06-25 | 北京沃东天骏信息技术有限公司 | The methods, devices and systems that moving target counts |
CN109934850B (en) * | 2019-03-21 | 2021-04-30 | 北京沃东天骏信息技术有限公司 | Method, device and system for counting moving objects |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Bi et al. | Optimal type-2 fuzzy system for arterial traffic signal control | |
Marcianò et al. | Signal setting optimization on urban road transport networks: The case of emergency evacuation | |
CN102176283A (en) | Traffic network simplifying model and navigating method based on same | |
Zou et al. | Robustness analysis of urban transit network based on complex networks theory | |
CN104391907B (en) | A kind of fast path method for searching of variable resolution degree | |
Wu et al. | Smart fog based workflow for traffic control networks | |
CN105469143A (en) | Network-on-chip resource mapping method based on dynamic characteristics of neural network | |
CN107742169A (en) | A kind of Urban Transit Network system constituting method and performance estimating method based on complex network | |
CN105303839A (en) | Latent congested road intersection prediction method and device | |
Chai et al. | Traffic performance of shared lanes at signalized intersections based on cellular automata modeling | |
CN103139212A (en) | Security service method of complex network | |
Jia et al. | Dynamic cascading failure analysis in congested urban road networks with self-organization | |
Guo et al. | Urban Road Network and Taxi Network Modeling Based on Complex Network Theory. | |
Ye et al. | Dynamic route guidance using maximum flow theory and its mapreduce implementation | |
GE et al. | Stochastic equilibrium assignment with variable demand: Literature review, comparisons and research needs | |
Crisalli et al. | A meso-simulation approach for the estimation of traffic flows in presence of automated vehicles | |
Habibi et al. | An Intelligent Traffic Light Scheduling Algorithm by using fuzzy logic and gravitational search algorithm and considering emergency vehicles | |
Mahdi et al. | Grouping vehicles in vehicular social networks | |
Cong et al. | Dnd: The controllability of dynamic temporal network in smart transportations | |
Zhao et al. | Vehicle route assignment optimization for emergency evacuation in a complex network | |
Zhang et al. | A stochastic dynamic traffic assignment model for emergency evacuations that considers background traffic | |
Keyarsalan et al. | Intelligent ontological agent for traffic light control of isolated intersections | |
Pang et al. | Transit route planning for megacities based on demand density of complex networks | |
Wang et al. | Urban public transport commuting path planning method based on dynamic programming algorithm | |
Hu et al. | Hyper-Heuristic Algorithm for Urban Traffic Flow Optimization |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130605 |