CN109450675A - Network topology method, apparatus, network topology equipment and storage medium - Google Patents
Network topology method, apparatus, network topology equipment and storage medium Download PDFInfo
- Publication number
- CN109450675A CN109450675A CN201811257557.8A CN201811257557A CN109450675A CN 109450675 A CN109450675 A CN 109450675A CN 201811257557 A CN201811257557 A CN 201811257557A CN 109450675 A CN109450675 A CN 109450675A
- Authority
- CN
- China
- Prior art keywords
- network
- data
- network topology
- cutpoint
- topology data
- 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
- 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
Abstract
This application involves a kind of network topology method, apparatus, network topology equipment and storage mediums.The network topology method includes: by collection network topological data；Network structure set is obtained after handling using worldlet construction algorithm network topology data；Use FM3Placement algorithm is laid out calculating to network structure set, obtains topology data；Topology data is output in specified equipment.Network structure set is obtained after being handled collected network topology data by small-world network construction algorithm in the embodiment of the present invention, data are combined into obtained network structure collection and enter ginseng, carry out FM3Regular topology data is calculated in algorithm, and then is output on designated equipment, to realize short time rapid topology layout, improves network topology efficiency.
Description
Technical field
This application involves network topology technical fields, set more particularly to a kind of network topology method, apparatus, network topology
Standby and storage medium.
Background technique
Existing Network Management System layout is most of to use random multi-layer algorithm, i.e., the position of each network equipment layout
Setting will not be overlapped, and position is random.Such mode network topology layout can be unfolded to obtain the nonoverlapping figure of node,
But it is random and in disorder by the topology that the layout type obtains.And then there is small part Network Management System layout to be oriented to using power
Algorithm, node and line have all been applied the effect of power, and power is calculated according to the relative position of node and line.According to power
Effect, carrys out the motion profile of calculate node and line, and constantly reduce their energy, is finally reached a kind of peace that energy is very low
State is determined, to keep the length of each line almost equal, and as non-intersecting as possible.Topology can be allowed using power guiding layout type
Scheme regular and salubrious, but the calculating time of power guiding placement algorithm is as node number and wiring quantity are in the increasing of secondary index
It is long.In large-scale complex network, this problem is more obvious.As a result, in large complicated network, user is likely difficult in short-term
Interior acquisition topological layout, current network-management tool do not have the ability of short time rapid topology layout.
Summary of the invention
Based on this, it is necessary to which in view of the above technical problems, providing one kind can be realized short time rapid topology layout, mention
High the network topology method, apparatus of network topology efficiency, network topology equipment and storage medium.
In a first aspect, the application provides a kind of network topology method, which comprises
Collection network topological data；
Network structure set is obtained after handling using worldlet construction algorithm the network topology data；
Use FM3Placement algorithm is laid out calculating to the network structure set, obtains topology data；
The topology data is output in specified equipment.
The step of collection network topological data in one of the embodiments, comprising:
Existing network data acquisition is carried out using the mode that packet capturing or SNMP are scanned, obtains network topology data；
The collected network topology data are saved in database.
After the use worldlet construction algorithm handles the network topology data in one of the embodiments,
The step of obtaining network structure set, comprising:
Cum rights connected graph is generated according to the network topology data；
The cum rights connected graph is handled with worldlet construction algorithm, determines cutpoint；
Network structure set is determined according to the cutpoint.
It is described in one of the embodiments, that the cum rights connected graph is handled with worldlet construction algorithm, it determines
The step of cutpoint, comprising:
It is deleted the side in any minimum spanning tree is not appeared in the cum rights connected graph G, it separately will be in described
The boundary point deletion of cum rights connected graph G, the cum rights connected graph G ' after being optimized.
The cum rights connected graph G ' after optimization is handled using Small-world Theory in Self, determines cutpoint.
In one of the embodiments, it is described using Small-world Theory in Self for optimization after cum rights connected graph G ' at
The step of managing, determining cutpoint, comprising:
Construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate GiΔ LiWith Δ Ci, and
By (Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd behind coupled side
Subgraph, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；
It determines and deletes vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.
Described the step of network structure set is determined according to the cutpoint in one of the embodiments, comprising:
Judge Δ L corresponding to each cutpointiWith Δ Ci；
Determine Δ L corresponding to cutpointiWith Δ CiFor the subgraph of the vertex correspondence of positive number；
Summarize determining subgraph and obtains network structure set.
It is described in one of the embodiments, to use FM3Placement algorithm is laid out calculating to the network structure set,
The step of obtaining topology data, comprising:
Random distribution start node position；
Generate quaternary tree Q-Tree；
Calculate in each iteration regional area unit displacement A caused by the repulsion between node two-by-two；
The gravitation of each iteration each edge is calculated to unit displacement B caused by two end nodes；
The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
Second aspect, the application provide a kind of network topology device, and described device includes:
Collection module is used for collection network topological data；
Processing module, for obtaining network knot after handling using worldlet construction algorithm the network topology data
Structure set；
Computing module, for using FM3Placement algorithm is laid out calculating to the network structure set, obtains cloth inning
According to；
Output module, for the topology data to be output to specified equipment.
The collection module is specifically used in one of the embodiments:
Existing network data acquisition is carried out using the mode that packet capturing or SNMP are scanned, obtains network topology data；
The collected network topology data are saved in database.
The processing module is specifically used in one of the embodiments:
Cum rights connected graph is generated according to the network topology data；
The cum rights connected graph is handled with worldlet construction algorithm, determines cutpoint；
Network structure set is determined according to the cutpoint.
The processing module is specifically used in one of the embodiments:
It is deleted the side in any minimum spanning tree is not appeared in the cum rights connected graph G, it separately will be in described
The boundary point deletion of cum rights connected graph G, the cum rights connected graph G ' after being optimized.
The cum rights connected graph G ' after optimization is handled using Small-world Theory in Self, determines cutpoint.
The processing module is specifically used in one of the embodiments:
Construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate GiΔ LiWith Δ Ci, and
By (Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd behind coupled side
Subgraph, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；
It determines and deletes vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.
The processing module is specifically used in one of the embodiments:
Judge Δ L corresponding to each cutpointiWith Δ Ci；
Determine Δ L corresponding to cutpointiWith Δ CiFor the subgraph of the vertex correspondence of positive number；
Summarize determining subgraph and obtains network structure set.
The computing module is specifically used in one of the embodiments:
Random distribution start node position；
Generate quaternary tree Q-Tree；
Calculate in each iteration regional area unit displacement A caused by the repulsion between node two-by-two；
The gravitation of each iteration each edge is calculated to unit displacement B caused by two end nodes；
The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
The third aspect, the application provides a kind of network topology equipment, including memory, processor and storage are on a memory
And the computer program that can be run on a processor, the processor is realized in first aspect when executing the computer program appoints
The step of one the method.
Fourth aspect, the application provide a kind of computer readable storage medium, are stored thereon with computer program, the meter
The step of any the method in first aspect is realized when calculation machine program is executed by processor.
Above-mentioned network topology method, apparatus, network topology equipment and storage medium, pass through collection network topological data；Make
Network structure set is obtained after being handled with worldlet construction algorithm network topology data；Use FM3Placement algorithm is to net
Network structured set is laid out calculating, obtains topology data；Topology data is output in specified equipment.The embodiment of the present invention
In collected network topology data are handled by small-world network construction algorithm after obtain network structure set, with
To network structure collection be combined into data enter ginseng, carry out FM3Regular topology data is calculated in algorithm, and then is output to specified set
It is standby upper, to realize short time rapid topology layout, improve network topology efficiency.
Detailed description of the invention
Fig. 1 is the applied environment figure of the network topology method of one embodiment in the embodiment of the present invention；
Fig. 2 is the flow diagram of the network topology method of one embodiment in the embodiment of the present invention；
Fig. 3 is the structural schematic diagram of the network topology equipment of one embodiment in the embodiment of the present invention；
Fig. 4 is the internal structure chart of network topology equipment in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
Network topology method provided by the present application, can be applied in application environment as shown in Figure 1.Wherein, network cloth
Office's 10 collection network topological data of equipment, obtains network knot after handling using worldlet construction algorithm network topology data
Structure set；Use FM3Placement algorithm is laid out calculating to network structure set, obtains topology data；Topology data is exported
Onto specified equipment 20 (such as terminal).Wherein, specified equipment 20 can be, but not limited to be various personal computers, notebook
Computer etc..
In one embodiment, as shown in Fig. 2, to provide a kind of network topology method in the embodiment of the present invention, with this
Method is applied to be illustrated for the network topology equipment in Fig. 1, comprising the following steps:
S201, collection network topological data.
Wherein, network topology data are that network topology equipment is collected from network and obtained.
S202, network structure set is obtained after handling using worldlet construction algorithm network topology data.
Complex network is made of the side being connected between many nodes and node, the composition of the node on behalf system in network
Element, even side then describes the interaction between two elements.The scale of one network and sparse dense property can be by nets
The parameters of the two network structure properties of network average path length and network cybotaxis is measured.In network between two nodes
Even number of edges is known as the path length between two nodes, the average path length of network be in network between any two node most
The average value of short path length.The cybotaxis of network is the average value (node to the bunching coefficient of node each in network
Bunching coefficient be defined as between all neighbor nodes of the node it is practical even number of edges mesh divided by all these neighbor nodes it
Between the most Dalian number of edges that is likely to occur).But there is the network of big network bunching coefficient with small network average path length, just
Referred to as small-world network.It is exactly that small-world network construction is calculated by the algorithm that real network is converted to small-world network structured set
Method.
S203, FM is used3Placement algorithm is laid out calculating to network structure set, obtains topology data.
A quasi-representative of the power guidance algorithm as spring theoretical algorithm is applied to the relationship types hum patterns such as description network.
Its principle is in fact very understandable, and whole network of throwing the net can be imagined as a virtual physical system by we.Each of system
Node can regard the electric discharge particle with certain energy as to be made there are certain Coulomb repulsion between particle and particle
They are mutually exclusive two-by-two.Meanwhile being involved between some particles by some " sides ", the Hooke that these sides generate spring-like draws
Power, and tightly restrain the particle at " side " both ends.Between particles under the continuous effect of repulsion and gravitation, particles are from random unordered
Initial state be constantly subjected to displacement, gradually tend to balance orderly final state.The energy of entire physical system is also constantly consuming simultaneously,
After iteration for several times, relative displacement almost no longer occurs between particle, whole system reaches the state of stable equilibrium a kind of, i.e.,
Energy goes to zero.This moment, the final ideal network of this width is also completed substantially.FM3Based on power guidance algorithm, in efficiency
Aspect optimizes, and is calculated different from traditional power guidance algorithm by graph structure, FM3Data are carried out using quaternary tree to deposit
Storage and calculating, tree construction are simple and efficient convenient for beta pruning, and efficiency has more apparent raising with increasing for data volume.
S204, topology data is output in specified equipment.
Wherein, specified equipment can be desktop computer, the equipment that PC etc. is connect with network topology equipment.
In above-mentioned network topology method, pass through collection network topological data；Using worldlet construction algorithm to network topology
Data obtain network structure set after being handled；Use FM3Placement algorithm is laid out calculating to network structure set, obtains
Topology data；Topology data is output in specified equipment.Passing through small-world network construction algorithm in the embodiment of the present invention will
Collected network topology data obtain network structure set after being handled, and are combined into data with obtained network structure collection and enter
Ginseng carries out FM3Regular topology data is calculated in algorithm, and then is output on designated equipment, so that it is fast to realize the short time
Fast topological layout improves network topology efficiency.
The step of collection network topological data in one of the embodiments, comprising: scanned using packet capturing or SNMP
Mode carry out existing network data acquisition, obtain network topology data；The collected network topology data are saved in data
In library.In the embodiment of the present invention, it can use network topology data collecting assembly network topology data, it further, can be with
Collected data are subjected to data persistence, that is, are saved in Relational database, database can be and network topology data
Local data base of the collection assembly in identical equipment, is also possible in remote data base.Network topology data include that network is set
The information such as standby line, line weight, nodal community.
In the embodiment of the present invention, cum rights connected graph G is generated by the network data acquired, if L and C are respectively cum rights connected graph
The average path length and cluster coefficients of G (indicates the coefficient of a figure interior joint aggregation extent, the bigger aggregation extent of coefficient is more
It is high)；L (i) and C (i) is figure GiAverage path length and cluster coefficients, wherein scheming GiRemove vertex V for cum rights connected graph GiAnd
Subgraph behind coupled side.ΔLiWith Δ CiTo scheme GiAverage path length and cluster coefficients variable quantity.ΔLi=L
(i)-LΔCi=C (i)-C.
After the use worldlet construction algorithm handles the network topology data in one of the embodiments,
The step of obtaining network structure set, comprising: generate cum rights connected graph according to the network topology data；It is constructed and is calculated with worldlet
Method handles the cum rights connected graph, determines cutpoint；Network structure set is determined according to the cutpoint.
It is described in one of the embodiments, that the cum rights connected graph is handled with worldlet construction algorithm, it determines
The step of cutpoint, comprising: delete the side in any minimum spanning tree is not appeared in the cum rights connected graph G, separately will
Boundary point deletion in the cum rights connected graph G, the cum rights connected graph G ' after being optimized.Using Small-world Theory in Self for excellent
Cum rights connected graph G ' after change is handled, and determines cutpoint.
It is described in one of the embodiments, that the cum rights connected graph G ' after optimization is located using Small-world Theory in Self
The step of managing, determining cutpoint, comprising: construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate Gi
Δ LiWith Δ Ci, and by (Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd with
Subgraph behind its connected side, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；It determines and deletes
Vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.Since useless side is not present in figure G ', so
Delete vertex ViAfter may will form Δ LiInfinitely great situation, as disconnected figure, this is to illustrate that the vertex is " cutpoint ",
It is connected to the important node of full figure.
Described the step of network structure set is determined according to the cutpoint in one of the embodiments, comprising:
Judge Δ L corresponding to each cutpointiWith Δ Ci；Determine Δ L corresponding to cutpointiWith Δ CiFor the vertex of positive number
Corresponding subgraph；Summarize determining subgraph and obtains network structure set.
It is described in one of the embodiments, to use FM3Placement algorithm is laid out calculating to the network structure set,
The step of obtaining topology data, comprising: random distribution start node position；Generate quaternary tree Q-Tree；Calculate each iteration office
Unit displacement A caused by repulsion between node two-by-two in portion region；The gravitation of each iteration each edge is calculated to two end nodes
Generated unit displacement B；The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree；
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
It should be understood that although each step in the flow chart of Fig. 1 is successively shown according to the instruction of arrow, this
A little steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly state otherwise herein, these steps
It executes there is no the limitation of stringent sequence, these steps can execute in other order.Moreover, at least part in Fig. 1
Step may include that perhaps these sub-steps of multiple stages or stage are executed in synchronization to multiple sub-steps
It completes, but can execute at different times, the execution sequence in these sub-steps or stage, which is also not necessarily, successively to be carried out,
But it can be executed in turn or alternately at least part of the sub-step or stage of other steps or other steps.
In one embodiment, as shown in figure 3, providing a kind of network topology device, the network topology device 300 packet
It includes: collection module 301, processing module 302, computing module 303 and output module 304, in which:
Collection module 301 is used for collection network topological data；
Processing module 302, for obtaining net after handling using worldlet construction algorithm the network topology data
Network structured set；
Computing module 303, for using FM3Placement algorithm is laid out calculating to the network structure set, obtains cloth
Office data；
Output module 304, for the topology data to be output to specified equipment.
The collection module 301 is specifically used in one of the embodiments:
Existing network data acquisition is carried out using the mode that packet capturing or SNMP are scanned, obtains network topology data；
The collected network topology data are saved in database.
The processing module 302 is specifically used in one of the embodiments:
Cum rights connected graph is generated according to the network topology data；
The cum rights connected graph is handled with worldlet construction algorithm, determines cutpoint；
Network structure set is determined according to the cutpoint.
The processing module 302 is specifically used in one of the embodiments:
It is deleted the side in any minimum spanning tree is not appeared in the cum rights connected graph G, it separately will be in described
The boundary point deletion of cum rights connected graph G, the cum rights connected graph G ' after being optimized.
The cum rights connected graph G ' after optimization is handled using Small-world Theory in Self, determines cutpoint.
The processing module 302 is specifically used in one of the embodiments:
Construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate GiΔ LiWith Δ Ci, and
By (Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd behind coupled side
Subgraph, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；
It determines and deletes vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.
The processing module 302 is specifically used in one of the embodiments:
Judge Δ L corresponding to each cutpointiWith Δ Ci；
Determine Δ L corresponding to cutpointiWith Δ CiFor the subgraph of the vertex correspondence of positive number；
Summarize determining subgraph and obtains network structure set.
The computing module 303 is specifically used in one of the embodiments:
Random distribution start node position；
Generate quaternary tree Q-Tree；
Calculate in each iteration regional area unit displacement A caused by the repulsion between node two-by-two；
The gravitation of each iteration each edge is calculated to unit displacement B caused by two end nodes；
The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
Specific about network topology device limits the restriction that may refer to above for network topology method, herein not
It repeats again.Modules in above-mentioned network topology device can be realized fully or partially through software, hardware and combinations thereof.On
Stating each module can be embedded in the form of hardware or independently of in the processor in network topology equipment, can also deposit in a software form
It is stored in the memory in network topology equipment, executes the corresponding operation of the above modules in order to which processor calls.
In one embodiment, a kind of network topology equipment is provided, which can be server, in
Portion's structure chart can be as shown in Figure 4.The network topology equipment includes processor, the memory, network connected by system bus
Interface and database.Wherein, the processor of the network topology equipment is for providing calculating and control ability.The network topology equipment
Memory include non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system, computer
Program and database.The built-in storage provides ring for the operation of operating system and computer program in non-volatile memory medium
Border.The database of the network topology equipment is for storing network topology data.The network interface of the network topology equipment be used for
External terminal passes through network connection communication.To realize a kind of network topology method when the computer program is executed by processor.
It will be understood by those skilled in the art that structure shown in Fig. 4, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the network topology equipment being applied thereon to application scheme, specific network topology
Equipment may include perhaps combining certain components or with different component cloth than more or fewer components as shown in the figure
It sets.
In one embodiment, it provides a kind of network topology equipment, including memory, processor and is stored in memory
Computer program that is upper and can running on a processor, processor perform the steps of when executing computer program
Collection network topological data；
Network structure set is obtained after handling using worldlet construction algorithm the network topology data；
Use FM3Placement algorithm is laid out calculating to the network structure set, obtains topology data；
The topology data is output in specified equipment.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Existing network data acquisition is carried out using the mode that packet capturing or SNMP are scanned, obtains network topology data；
The collected network topology data are saved in database.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Cum rights connected graph is generated according to the network topology data；
The cum rights connected graph is handled with worldlet construction algorithm, determines cutpoint；
Network structure set is determined according to the cutpoint.
In one embodiment, it is also performed the steps of when computer program is executed by processor
It is deleted the side in any minimum spanning tree is not appeared in the cum rights connected graph G, it separately will be in described
The boundary point deletion of cum rights connected graph G, the cum rights connected graph G ' after being optimized.
The cum rights connected graph G ' after optimization is handled using Small-world Theory in Self, determines cutpoint.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate GiΔ LiWith Δ Ci, and
By (Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd behind coupled side
Subgraph, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；
It determines and deletes vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Judge Δ L corresponding to each cutpointiWith Δ Ci；
Determine Δ L corresponding to cutpointiWith Δ CiFor the subgraph of the vertex correspondence of positive number；
Summarize determining subgraph and obtains network structure set.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Random distribution start node position；
Generate quaternary tree Q-Tree；
Calculate in each iteration regional area unit displacement A caused by the repulsion between node two-by-two；
The gravitation of each iteration each edge is calculated to unit displacement B caused by two end nodes；
The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program performs the steps of when being executed by processor
Collection network topological data；
Network structure set is obtained after handling using worldlet construction algorithm the network topology data；
Use FM3Placement algorithm is laid out calculating to the network structure set, obtains topology data；
The topology data is output in specified equipment.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Existing network data acquisition is carried out using the mode that packet capturing or SNMP are scanned, obtains network topology data；
The collected network topology data are saved in database.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Cum rights connected graph is generated according to the network topology data；
The cum rights connected graph is handled with worldlet construction algorithm, determines cutpoint；
Network structure set is determined according to the cutpoint.
In one embodiment, it is also performed the steps of when computer program is executed by processor
It is deleted the side in any minimum spanning tree is not appeared in the cum rights connected graph G, it separately will be in described
The boundary point deletion of cum rights connected graph G, the cum rights connected graph G ' after being optimized.
The cum rights connected graph G ' after optimization is handled using Small-world Theory in Self, determines cutpoint.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate GiΔ LiWith Δ Ci, and
By (Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd behind coupled side
Subgraph, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；
It determines and deletes vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Judge Δ L corresponding to each cutpointiWith Δ Ci；
Determine Δ L corresponding to cutpointiWith Δ CiFor the subgraph of the vertex correspondence of positive number；
Summarize determining subgraph and obtains network structure set.
In one embodiment, it is also performed the steps of when computer program is executed by processor
Random distribution start node position；
Generate quaternary tree Q-Tree；
Calculate in each iteration regional area unit displacement A caused by the repulsion between node two-by-two；
The gravitation of each iteration each edge is calculated to unit displacement B caused by two end nodes；
The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the concept of this application, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of network topology method, which is characterized in that the described method includes:
Collection network topological data；
Network structure set is obtained after handling using worldlet construction algorithm the network topology data；
Use FM3Placement algorithm is laid out calculating to the network structure set, obtains topology data；
The topology data is output in specified equipment.
2. the method according to claim 1, wherein the step of collection network topological data, comprising:
Existing network data acquisition is carried out using the mode that packet capturing or SNMP are scanned, obtains network topology data；
The collected network topology data are saved in database.
3. the method according to claim 1, wherein described use worldlet construction algorithm to the network topology
Data obtain the step of network structure set after being handled, comprising:
Cum rights connected graph is generated according to the network topology data；
The cum rights connected graph is handled with worldlet construction algorithm, determines cutpoint；
Network structure set is determined according to the cutpoint.
4. according to the method described in claim 3, it is characterized in that, described use worldlet construction algorithm to the cum rights connected graph
The step of being handled, determining cutpoint, comprising:
It is deleted the side in any minimum spanning tree is not appeared in the cum rights connected graph G, will separately be in the cum rights
The boundary point deletion of connected graph G, the cum rights connected graph G ' after being optimized；
The cum rights connected graph G ' after optimization is handled using Small-world Theory in Self, determines cutpoint.
5. according to the method described in claim 4, it is characterized in that, described connect the cum rights after optimization using Small-world Theory in Self
The step of logical figure G ' is handled, is determined cutpoint, comprising:
Construction deletion of node V from the cum rights connected graph G 'iThe subgraph G formed afterwardsi, calculate GiΔ LiWith Δ Ci, and will
(Vi, Δ Li, Δ Ci) (stored, wherein subgraph GiRemove vertex V for cum rights connected graph GiAnd the son behind coupled side
Figure, Δ LiWith Δ CiFor subgraph GiAverage path length and cluster coefficients variable quantity；
It determines and deletes vertex ViAfter may will form Δ LiVertex in the case where infinity is cutpoint.
6. according to the method described in claim 5, it is characterized in that, the step for determining network structure set according to the cutpoint
Suddenly, comprising:
Judge Δ L corresponding to each cutpointiWith Δ Ci；
Determine Δ L corresponding to cutpointiWith Δ CiFor the subgraph of the vertex correspondence of positive number；
Summarize determining subgraph and obtains network structure set.
7. the method according to claim 1, wherein described use FM3Placement algorithm is to the network structure set
The step of being laid out calculating, obtaining topology data, comprising:
Random distribution start node position；
Generate quaternary tree Q-Tree；
Calculate in each iteration regional area unit displacement A caused by the repulsion between node two-by-two；
The gravitation of each iteration each edge is calculated to unit displacement B caused by two end nodes；
The unit displacement for all nodes that cumulative A, B are calculated carries out beta pruning to quaternary tree Q-Tree
When A and B reach preset effect, all leaf nodes of quaternary tree Q-Tree is taken to obtain topology data.
8. a kind of network topology device, which is characterized in that described device includes:
Collection module is used for collection network topological data；
Processing module, for obtaining network structure collection after handling using worldlet construction algorithm the network topology data
It closes；
Computing module, for using FM3Placement algorithm is laid out calculating to the network structure set, obtains topology data；
Output module, for the topology data to be output to specified equipment.
9. a kind of network topology equipment, can run on a memory and on a processor including memory, processor and storage
Computer program, which is characterized in that the processor realizes any one of claims 1 to 7 when executing the computer program
The step of the method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claims 1 to 7 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811257557.8A CN109450675A (en) | 2018-10-26 | 2018-10-26 | Network topology method, apparatus, network topology equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811257557.8A CN109450675A (en) | 2018-10-26 | 2018-10-26 | Network topology method, apparatus, network topology equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109450675A true CN109450675A (en) | 2019-03-08 |
Family
ID=65548444
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811257557.8A Pending CN109450675A (en) | 2018-10-26 | 2018-10-26 | Network topology method, apparatus, network topology equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109450675A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111865400A (en) * | 2020-08-06 | 2020-10-30 | 四川安迪科技实业有限公司 | Mesh satellite network forwarding inhibition method and device |
| CN114741217A (en) * | 2022-05-06 | 2022-07-12 | 苏州大学 | Method, device, equipment and storage medium for determining fault tolerance of network structure |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702655A (en) * | 2009-10-27 | 2010-05-05 | 北京星网锐捷网络技术有限公司 | Layout method and system of network topological diagram |
| CN104426736A (en) * | 2013-08-29 | 2015-03-18 | 中国移动通信集团河南有限公司 | Network topology layout method and equipment |
| CN106202662A (en) * | 2016-06-30 | 2016-12-07 | 中国电力科学研究院 | A kind of distribution network structure figure draws mapping method automatically |
| CN107749803A (en) * | 2017-10-16 | 2018-03-02 | 浙江宇视科技有限公司 | A kind of network topology layout method and device |
| CN108228972A (en) * | 2016-12-12 | 2018-06-29 | 德国弗劳恩霍夫应用研究促进协会 | Determine the method and computer program of the arrangement of at least one circuit for Reconfigurable logic device |
-
2018
- 2018-10-26 CN CN201811257557.8A patent/CN109450675A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702655A (en) * | 2009-10-27 | 2010-05-05 | 北京星网锐捷网络技术有限公司 | Layout method and system of network topological diagram |
| CN104426736A (en) * | 2013-08-29 | 2015-03-18 | 中国移动通信集团河南有限公司 | Network topology layout method and equipment |
| CN106202662A (en) * | 2016-06-30 | 2016-12-07 | 中国电力科学研究院 | A kind of distribution network structure figure draws mapping method automatically |
| CN108228972A (en) * | 2016-12-12 | 2018-06-29 | 德国弗劳恩霍夫应用研究促进协会 | Determine the method and computer program of the arrangement of at least one circuit for Reconfigurable logic device |
| CN107749803A (en) * | 2017-10-16 | 2018-03-02 | 浙江宇视科技有限公司 | A kind of network topology layout method and device |
Non-Patent Citations (2)
| Title |
|---|
| 徐悦竹，刘大昕等: ""基于小世界网络理论的机会发现算法"", 《计算机工程与应用》 * |
| 陈昌娜、王雅娟、晏平: ""网络拓扑布局技术研究"", 《信息通信》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111865400A (en) * | 2020-08-06 | 2020-10-30 | 四川安迪科技实业有限公司 | Mesh satellite network forwarding inhibition method and device |
| CN111865400B (en) * | 2020-08-06 | 2022-03-25 | 四川安迪科技实业有限公司 | Mesh satellite network forwarding inhibition method and device |
| CN114741217A (en) * | 2022-05-06 | 2022-07-12 | 苏州大学 | Method, device, equipment and storage medium for determining fault tolerance of network structure |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rusitschka et al. | Smart grid data cloud: A model for utilizing cloud computing in the smart grid domain | |
| CN112287182B (en) | Graph data storage and processing method and device and computer storage medium | |
| Gong et al. | Network performance aware MPI collective communication operations in the cloud | |
| CN104809182B (en) | Based on the web crawlers URL De-weight method that dynamically can divide Bloom Filter | |
| Blelloch et al. | Efficient algorithms with asymmetric read and write costs | |
| RU2646349C2 (en) | Data processing method and system | |
| CN103516733A (en) | Method and apparatus for processing virtual private cloud | |
| CN110213107A (en) | A kind of autoplacement method, device and equipment for network topological diagram | |
| CN109450675A (en) | Network topology method, apparatus, network topology equipment and storage medium | |
| Liu et al. | Graph computation and its applications in smart grid | |
| CN103455948B (en) | A kind of distribution system multi-dimensional multi-resolution Modeling and the method for analysis | |
| CN104980462A (en) | Distributed computation method, distributed computation device and distributed computation system | |
| CN113449153A (en) | Index construction method and device, computer equipment and storage medium | |
| Járai et al. | Minimal configurations and sandpile measures | |
| Kling et al. | Optimization by simulated evolution with applications to standard cell placement | |
| CN109492055B (en) | A method of power grid big data warehouse is established based on CIM model | |
| CN107276093B (en) | The Probabilistic Load calculation method cut down based on scene | |
| Zhang et al. | A modeling reliability analysis technique for cloud storage system | |
| CN106780747B (en) | A kind of method that Fast Segmentation CFD calculates grid | |
| Gedik et al. | Disk-based management of interaction graphs | |
| Liu et al. | A hierarchical synchronous parallel model for wide-area graph analytics | |
| Huang et al. | Distributed merge forest: a new fast and scalable approach for topological analysis at scale | |
| Boghrati et al. | Incremental solution of power grids using random walks | |
| CN104932982B (en) | A kind of Compilation Method and relevant apparatus of message memory access | |
| Cui | Parallel pso in spark |
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: 20190308 |
|
| RJ01 | Rejection of invention patent application after publication |