CN113517997B - Network state query method and device based on fragmentation and storage medium - Google Patents
Network state query method and device based on fragmentation and storage medium Download PDFInfo
- Publication number
- CN113517997B CN113517997B CN202110346967.5A CN202110346967A CN113517997B CN 113517997 B CN113517997 B CN 113517997B CN 202110346967 A CN202110346967 A CN 202110346967A CN 113517997 B CN113517997 B CN 113517997B
- Authority
- CN
- China
- Prior art keywords
- network
- node
- information
- report
- temporary
- 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
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000013467 fragmentation Methods 0.000 title claims abstract description 42
- 238000006062 fragmentation reaction Methods 0.000 title claims abstract description 42
- 239000012634 fragment Substances 0.000 claims abstract description 37
- 238000012545 processing Methods 0.000 claims abstract description 24
- 238000004422 calculation algorithm Methods 0.000 claims description 49
- 238000010586 diagram Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 10
- 238000007726 management method Methods 0.000 description 9
- 238000004364 calculation method Methods 0.000 description 7
- 238000012544 monitoring process Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 238000002372 labelling Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000011218 segmentation Effects 0.000 description 2
- 238000006424 Flood reaction Methods 0.000 description 1
- 206010033799 Paralysis Diseases 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a network state query method and device based on fragmentation and a storage medium. The network state query method based on the fragmentation comprises the following steps: acquiring the topology type and network complexity of a network to be queried; performing fragmentation processing on a network to be queried according to the topology type and the network complexity to obtain at least one network fragment, wherein each network fragment at least comprises one network node, and the network node comprises a father node; traversing each network patch to obtain node information of each network node in each network patch; acquiring a temporary status report of each network patch according to the information of each node, wherein the temporary reports of the network patches are summarized in a father node; and obtaining a status information report of the network to be queried according to the temporary status report of each network zone. The network state query method based on the fragments improves the efficiency of network state query.
Description
Technical Field
The present invention relates to, but not limited to, the field of computer network status monitoring, and in particular, to a method, apparatus, and storage medium for querying a network status based on fragmentation.
Background
In the field of computer network state monitoring, monitoring the computer network state is equal to ensuring the high-reliability running of software, but the current network state query technology faces the problems of delay, invalidity and instability, and the query efficiency of the current network state query method is lower.
Disclosure of Invention
The present application aims to solve at least one of the technical problems existing in the prior art. Therefore, the network state query method based on the fragmentation can solve the problem of low network state query efficiency.
A method for querying a network state based on fragmentation according to an embodiment of the first aspect of the present application, the method includes: acquiring the topology type and network complexity of a network to be queried; performing slicing processing on the network to be queried according to the topology type and the network complexity to obtain at least one network slice, wherein each network slice at least comprises one network node, and the network node comprises a father node; traversing each network patch to obtain node information of each network node in each network patch; acquiring a temporary status report of each network patch according to the node information, wherein the temporary status report of each network patch is summarized in the father node; and obtaining a state information report of the network to be queried according to the temporary state report of each network fragment.
The network state query method based on the fragments, provided by the embodiment of the application, has at least the following technical effects: the network state query method based on the slicing carries out slicing processing and asynchronous traversal on the network to be queried, divides the complex network into a plurality of simple network slices, reduces the delay of the network state query process, gathers network node information from child nodes to father nodes in the slicing, enhances the real-time performance of the network node state query, and further improves the efficiency of the network state query as a whole.
According to some embodiments of the present application, the performing a slicing process on the network to be queried according to the topology type and the network complexity to obtain at least one network slice includes: constructing an identification algorithm and a fragmentation algorithm according to the topology type and the network complexity; and carrying out slicing processing on the network to be queried according to the identification algorithm and the slicing algorithm.
According to some embodiments of the present application, the network node further includes a child node, and traversing each network tile to obtain node information of each network node in each network tile includes: acquiring a preset frequency; acquiring node information of the father node; and acquiring node information of the child nodes in the network fragment according to the preset frequency.
According to some embodiments of the present application, the traversing each network tile to obtain node information of each network node in each network tile further includes: and if the node information of the child node changes, sending the changed node information to the father node.
According to some embodiments of the present application, the network node further includes a child node, and the acquiring, according to each node information, a temporary status report of each network tile includes: obtaining a temporary state report of the network fragment according to the node information of the child node and the node information of the father node; and storing the temporary state report of the network patch in the father node.
According to some embodiments of the present application, the obtaining a status information report of the network to be queried according to the temporary status report of each network tile includes: sending the temporary status report to an adjacent patch of the network patch; and summarizing and fusing the temporary status reports of all the network segments to obtain the status information report of the network to be queried.
According to an embodiment of the second aspect of the present application, a fragmentation-based network state query device includes: the topology type and network complexity acquisition module is used for acquiring the topology type and network complexity of the network to be queried; the network segmentation processing module is used for carrying out segmentation processing on the network to be queried according to the topology type and the network complexity to obtain at least one network segment, wherein each network segment at least comprises a network node, and the network node comprises a father node; the network node traversing module is used for traversing each network patch to obtain node information of each network node in each network patch; the temporary report summarizing module is used for acquiring a temporary status report of each network patch according to the node information, and the temporary reports of the network patches are summarized in the father node; and the state information report generating module is used for obtaining the state information report of the network to be queried according to the temporary state report of each network fragment.
According to an embodiment of the third aspect of the present application, a network state query device based on fragmentation includes: a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing when executing the program: the embodiment of the first aspect of the present application provides a method for querying a network state based on fragmentation.
According to an embodiment of the fourth aspect of the present application, a storage medium stores computer-executable instructions for: the method for querying the network state based on the slicing according to the embodiment of the first aspect is performed.
Additional aspects and advantages of the application will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the application.
Drawings
The application is further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a flow chart of a method for querying a network state based on fragmentation according to one embodiment of the present application;
FIG. 2 is a flow chart of a method for querying a network state based on fragmentation according to another embodiment of the present application;
FIG. 3 is a flow chart of a method for querying a network state based on fragmentation according to another embodiment of the present application;
FIG. 4 is a flow chart of a method for querying a network state based on fragmentation according to another embodiment of the present application;
FIG. 5 is a flow chart of a method for querying a network state based on fragmentation according to another embodiment of the present application;
fig. 6 is a flowchart of a method for querying a network state based on a slice according to another embodiment of the present application.
Detailed Description
Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary only for the purpose of explaining the present application and are not to be construed as limiting the present application.
In the description of the present application, a description with reference to the terms "one embodiment," "some embodiments," "illustrative embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
In the process of computer software research and development and network deployment, the computer network state is essentially monitored, the network state is updated in time, and the state of a network node is checked in time so as to ensure the reliable operation of the software.
To achieve real-time monitoring of network status, it is necessary to know the network architecture of the computer. The complexity of the computer network architecture is different, and for simpler network architectures, such as bus type, star type and ring topology architecture modes with the number of the host computers within 100, the mode of monitoring the network state is not complex; however, for a large-scale (more than 100 hosts), multi-level and deep nested hybrid network topology architecture, it is difficult to complete the state monitoring of network nodes in the entire network. For the complex hybrid network topology, if any simple method is selected for traversing, whether a priority breadth traversing method or a priority depth traversing method is used, the problem of delay exists, that is, the acquired network topology data necessarily has the problem that a host traversed later is behind a host traversed earlier.
Due to the drawbacks of the current network state query methods, the following problems are caused:
(1) The problem of delay is that the delay increases exponentially as the complexity of the network topology increases; (2) The invalidity problem is that the network state is changed instantly, if the time consumption is relatively large in the process of acquiring the network node state, the state of the host computer which is firstly inquired may be changed, so that the inaccuracy of the state information of the node is caused, and the real-time network condition cannot be reflected; (3) The problem of instability is that for network topology with higher complexity, the query algorithm is more complex, the use of computing resources is higher, the waiting time is longer, and congestion is easy to cause.
The current network query technology mainly comprises the following steps:
the Dijkstra (dikksther) algorithm includes the steps of: (1) Each node is labeled with a distance from the source node to the node along a known best path, the labels being classified into temporary labels and permanent labels; (2) Initially, all nodes are temporarily marked, marked as infinity. Marking a source node as 0, permanently marking the source node and enabling the source node to be a working node; (3) Checking temporary nodes adjacent to the working node, if the sum of the distance from the node to the working node and the label of the working node is smaller than the label of the node, re-labeling the node by using the newly calculated sum; (4) Searching a temporary labeling node with the minimum value in the whole graph, changing the temporary labeling node into a permanent node, and changing the temporary labeling node into a working node for the next round of examination; (5) Repeating the steps (3) and (4) until the destination node becomes a working node, and completing topology traversal. The Dijkstra algorithm has the problems of high consumption of computing resources and high time delay.
The flooding algorithm is a simple way of sending data packets to all network nodes, each node flooding new data packets received on the incoming link by sending them out of all other links, which belongs to a static algorithm. The flooding algorithm has the problems that: the repeated data packets are more, network congestion and network paralysis are easy to cause, and nodes need to track the flooded data packets to prevent flooding, and even the use limit on the hop count can be multiple exploded.
The computing idea of the link state routing algorithm is as follows: each node floods information about its neighbors in LSPs (link state packets), all nodes learn a complete network graph, and each node runs Dijkstra's algorithm to calculate paths to other destinations. The algorithm comprises the following steps: (1) Discovering a neighbor node, knowing the network address of the neighbor node, and after the router is started, discovering the neighbor node by sending an HELLO data packet; (2) measuring delay or overhead to each neighbor node; (3) creating a link state data packet; (4) sending this packet to all other routers. The problems with the link state routing algorithm are: sequence number rotations can be confusing; after the router crashes, if it starts again from zero, the next packet is discarded as a duplicate packet.
In summary, the current network state query method does not solve the problem of real-time performance and stability of the query network topology state well.
In view of this, the present application proposes a network state query method based on fragmentation, which performs fragmentation processing and asynchronous traversal on a network to be queried, divides a complex network into a plurality of simple network fragments, reduces delay in a network state query process, and gathers network node information from a child node to a parent node in the fragmentation, thereby enhancing real-time performance of network node state query, and further improving efficiency of network state query as a whole.
According to the network state query method based on the fragmentation, the method comprises the following steps: acquiring the topology type and network complexity of a network to be queried; performing fragmentation processing on a network to be queried according to the topology type and the network complexity to obtain at least one network fragment, wherein each network fragment at least comprises one network node, and the network node comprises a father node; traversing each network patch to obtain node information of each network node in each network patch; acquiring a temporary status report of each network patch according to the information of each node, wherein the temporary reports of the network patches are summarized in a father node; and obtaining a status information report of the network to be queried according to the temporary status report of each network zone.
As shown in fig. 1, in some embodiments, the fragmentation-based network state query method includes:
s110, obtaining the topology type and network complexity of the network to be queried;
s120, performing fragmentation processing on the network to be queried according to the topology type and the network complexity to obtain at least one network fragment;
s130, traversing each network patch to obtain node information of each network node in each network patch;
s140, acquiring a temporary status report of each network fragment according to the information of each node;
and S150, obtaining a state information report of the network to be queried according to the temporary state report of each network fragment.
In steps S110 to S120, each network segment includes at least one network node, where the network node includes a parent node and a child node, and the network nodes in the network segment are distinguished, so that subsequent summary of node information and summary of temporary status report are facilitated, thereby improving query efficiency of network status.
In step S130, the traversing includes asynchronous traversing, that is, each segment is queried separately, when the query of a segment or node is blocked, the query can be put into a suspended state, and the query is continued after the blocked condition is satisfied, so that the query efficiency of the network state is improved.
In step S140, the temporary report of the network fragment is collected by the child node to the parent node, so that the subsequent collection of node information and temporary status report are facilitated, and thus the network status query efficiency is improved.
In step S150, the status information report of the entire network is obtained by splicing the temporary status reports of each network segment.
The network state query method based on the slicing carries out slicing processing and asynchronous traversal on the network to be queried, divides the complex network into a plurality of simple network slices, reduces the delay of the network state query process, gathers network node information from child nodes to father nodes in the slicing, enhances the real-time performance of the network node state query, and further improves the efficiency of the network state query as a whole.
According to some embodiments of the present application, according to topology type and network complexity, a network to be queried is fragmented to obtain at least one network fragment, including: constructing an identification algorithm and a fragmentation algorithm according to the topology type and the network complexity; and carrying out slicing processing on the network to be queried according to the identification algorithm and the slicing algorithm.
As shown in fig. 2, in some embodiments, the fragmentation-based network state query method includes:
s210, constructing an identification algorithm and a fragmentation algorithm according to the topology type and the network complexity;
s220, the network to be queried is subjected to slicing processing according to the identification algorithm and the slicing algorithm.
In step S210, topology types include, but are not limited to bus type, star type, ring type, tree type, hybrid type; the network complexity is a quantized value estimated according to factors such as the number of network nodes; the identification algorithm is used for identifying the network topology type; the slicing algorithm is used for slicing the network; according to different topology types and network complexity, an identification algorithm and a fragmentation algorithm matched with the network to be queried are constructed for the network to be queried, and the algorithm suitable for the network to be queried can be formulated in a targeted manner, so that the fragmentation processing efficiency is improved.
In a specific embodiment, the slicing algorithm includes an optimal slicing algorithm, and the core idea of the optimal slicing algorithm is to find an optimal slicing structure with the shallowest depth and the narrowest breadth, where the shallowest depth refers to that when a network to be queried is sliced, the depth of the query network is minimized as much as possible, and taking a tree network as an example, that is, the classification of the network is minimized as much as possible; likewise, narrowest breadth means that the network branches are as least as possible. The shallowest depth is the same-level topological node division basis, and the narrowest breadth is the parent connection point node division basis with public.
Specifically, the optimal slicing algorithm is: (1) Obtaining a topological connection relation from top to bottom, searching a first-level topological connection diagram, and dividing the first-level topological connection diagram into a network fragment; (2) Searching the network nodes of the first-level network patch, searching whether the network nodes have a child node connection relationship, and if so, dividing all the child nodes into a network patch; (3) Dividing the same-level node with a plurality of hierarchical node connection relations into a patch.
According to some embodiments of the present application, the network node further includes a child node, and traversing each network fragment to obtain node information of each network node in each network fragment, including: acquiring a preset frequency; acquiring node information of a father node; and acquiring node information of the sub-nodes in the network fragment according to the preset frequency.
According to some embodiments of the present application, traversing each network tile to obtain node information of each network node in each network tile, further includes: if the node information of the child node changes, the changed node information is sent to the father node.
In a specific embodiment, after the network segments to be queried are processed, each network segment is traversed in an asynchronous traversing mode, the traversing process mainly comprises two modes, the first mode is a top-down mode, namely, a top management node periodically recursively acquires all sub-nodes of the top management node from the top node, and node information of the network node is obtained in a layered and hierarchical mode; the second mode is a bottom-up mode, namely when node information of a certain area changes, the node information is asynchronously pushed to each own father node (management node), the father node pushes the node information to an upper layer management node of the father node, and finally the state data is summarized to a top layer node.
As shown in fig. 3, in some embodiments, the top-down traversal step includes:
s310, acquiring a preset frequency;
s320, obtaining node information of a father node;
s330, acquiring node information of the sub-nodes in the network fragment according to the preset frequency.
In step S310, the preset frequency is the acquisition frequency of the node information of the upper node (parent node) to acquire the node information of the lower node (child node), for example, 10 times per second, and the setting of the frequency for the network query can ensure the efficiency of the network state query.
In step S320 to step S330, according to the preset frequency, for a specific network segment, node information of a parent node is obtained first, and then node information of child nodes is summarized to the parent node, so as to obtain node information of all nodes in the network segment.
The asynchronous traversing mode from top to bottom is asynchronous, and the node information of the child nodes can be reported by a plurality of network segments at the same time, so that the network state query efficiency is improved.
In a specific embodiment, in the process of fragmenting the network topology node, the optimal fragmenting method can enable calculation to be rapidly and asynchronously executed without interference, and each network fragment consumes considerable resources in calculation, so that subsequent calculation waiting is reduced; in addition, the inquiry and data interaction of the network topology state also support asynchronous calculation and non-blocking data acquisition, so that the calculation result of the fragments can be obtained without waiting for too long time, and the waiting time delay of splicing and summarizing the subsequent data sets is reduced.
As shown in fig. 4, in some embodiments, the bottom-up steps include:
s410, acquiring node information of the child node;
s420, judging whether node information of the child node is changed; if yes, executing step S430; if the determination result is no, step S410 is performed.
And S430, transmitting the changed node information to the father node.
In step S410 to step S430, after the node information of the child node changes, the changed information is uploaded timely to update the network node state, and the real-time performance of the network is greatly improved through uploading the node information from bottom to top, so that the network state report can accurately reflect the real network state.
According to some embodiments of the present application, the network node further includes a child node, and acquiring a temporary status report of each network fragment according to each node information includes: obtaining a temporary state report of the network patch according to the node information of the child node and the node information of the father node; the temporary status report for the network patch is stored at the parent node.
As shown in fig. 5, in some embodiments, the fragmentation-based network state query method includes:
s510, obtaining a temporary state report of the network fragment according to the node information of the child node and the node information of the father node;
s520 stores the temporary status report of the network tile in the parent node.
In step S510, an entry node of each network tile (also called a jigsaw) is first found, the entry node of the network tile is set as a parent node (also called a parent management node or a flag node), other nodes of the network tile are set as child nodes (also called child management nodes), and node information is gathered by the child nodes into the parent node, and further, node information of the parent node and the child nodes is gathered into a temporary status report of the network tile.
In step S520, the temporary status report is stored in the parent node, so that the parent node and the parent nodes of other network segments can exchange the respective temporary status report, and thus, a plurality of temporary status reports are spliced to obtain the network status of the whole network.
According to some embodiments of the present application, obtaining a status information report of a network to be queried according to a temporary status report of each network tile includes: sending a temporary status report to an adjacent patch of the network patch; and summarizing and fusing the temporary status reports of all the network areas to obtain a status information report of the network to be queried.
As shown in fig. 6, in some embodiments, the tile-based network state query method includes:
s610, sending a temporary status report to an adjacent patch of the network patch;
and S620, summarizing and fusing the temporary status reports of all the network areas to obtain a status information report of the network to be queried.
Immediately after the temporary status report of each network tile is generated, the respective parent node sends the temporary status report to the adjacent network tile and the management node that aggregates the entire topology in step S610.
In step S620, the management node of the whole topology performs consistency calculation on all temporary status reports to obtain status information reports of the whole network to be queried, thereby implementing query on network status of the whole network to be queried.
The management node summarizing the whole topology is the first topology total entry searched during network inquiry.
Wherein, the consistency calculation refers to: because of the principle of network segments, two segments are based on the principle that one node with the same level is divided into one network segment, and one node with the same father node is divided into one network segment, there is necessarily a crossover of the network segments, that is, information of a certain node is repeatedly collected, so that a consistency algorithm needs to be adopted to calculate the node information of the network nodes in a consistency manner during summarization so as to ensure the consistency of data, and specifically, the consistency algorithm includes but is not limited to a shift algorithm, a hash algorithm and the like.
According to the embodiment of the application, the network state query device based on the fragmentation comprises the following components: the topology type and network complexity acquisition module is used for acquiring the topology type and network complexity of the network to be queried; the system comprises a fragmentation processing module, a network processing module and a network processing module, wherein the fragmentation processing module is used for carrying out fragmentation processing on a network to be queried according to a topology type and network complexity to obtain at least one network fragment, each network fragment at least comprises a network node, and the network node comprises a father node; the network node traversing module is used for traversing each network fragment to obtain node information of each network node in each network fragment; the temporary report summarizing module is used for acquiring a temporary status report of each network patch according to the information of each node, and summarizing the temporary report of the network patch in a father node; and the state information report generating module is used for obtaining a state information report of the network to be queried according to the temporary state report of each network fragment.
The network state query device based on the slicing realizes the network state query method based on the slicing, performs slicing processing and asynchronous traversal on the network to be queried, divides the complex network into a plurality of simple network slices, reduces the delay of the network state query process, gathers network node information from child nodes to father nodes in the slicing, enhances the real-time performance of the network node state query, and further improves the efficiency of the network state query as a whole.
According to the embodiment of the application, the network state query device based on the fragmentation comprises the following components: memory, processor and computer program stored on the memory and executable on the processor, the processor implementing when executing the program: the network state query method based on the slicing of any embodiment of the application is disclosed.
The network state query device based on the slicing realizes the network state query method based on the slicing, performs slicing processing and asynchronous traversal on the network to be queried, divides the complex network into a plurality of simple network slices, reduces the delay of the network state query process, gathers network node information from child nodes to father nodes in the slicing, enhances the real-time performance of the network node state query, and further improves the efficiency of the network state query as a whole.
According to an embodiment of the present application, a storage medium stores computer-executable instructions for: the method for querying network state based on slicing of any of the above embodiments is executed.
The above described apparatus embodiments are merely illustrative, wherein the units illustrated as separate components may or may not be physically separate, i.e. may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
Those of ordinary skill in the art will appreciate that all or some of the steps, apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
The embodiments of the present application have been described in detail above with reference to the accompanying drawings, but the present application is not limited to the above embodiments, and various changes can be made within the knowledge of one of ordinary skill in the art without departing from the spirit of the present application. Furthermore, embodiments of the present application and features of the embodiments may be combined with each other without conflict.
Claims (7)
1. The network state query method based on the fragmentation is characterized by comprising the following steps:
acquiring the topology type and network complexity of a network to be queried, and constructing an identification algorithm and a fragmentation algorithm according to the topology type and the network complexity of the network; the method comprises the steps that the optimal slicing algorithm comprises an optimal slicing algorithm, wherein the optimal slicing algorithm specifically obtains a topological connection relation from top to bottom, searches a first-level topological connection diagram, divides the first-level topological connection diagram into a network slice area, searches sub-node connection relations of network nodes of the first-level network slice area, divides all the sub-nodes into a network slice area, and divides the same-level node with a plurality of levels of node connection relations into a slice area;
performing slicing processing on the network to be queried according to the identification algorithm and the slicing algorithm to obtain at least one network slice, wherein each network slice at least comprises one network node, and the network node comprises a father node;
traversing each network patch from top to bottom to obtain node information of each network node in each network patch; if the node information of the child node is changed, uploading the node information of each network segment with the changed node information from bottom to top, and sending the changed node information to the father node;
acquiring a temporary status report of each network patch according to the node information, wherein the temporary status report of each network patch is summarized in the father node;
and obtaining a state information report of the network to be queried according to the temporary state report of each network fragment.
2. The method of claim 1, wherein the network node further comprises a child node, the traversing each network tile to obtain node information of each network node in each network tile, and the method comprises:
acquiring a preset frequency;
acquiring node information of the father node;
and acquiring node information of the child nodes in the network fragment according to the preset frequency.
3. The method of claim 1, wherein the network node further comprises a child node, and wherein the obtaining the temporary status report of each network tile according to each node information comprises:
obtaining a temporary state report of the network fragment according to the node information of the child node and the node information of the father node;
and storing the temporary state report of the network patch in the father node.
4. The method for querying the status of a network based on fragmentation according to claim 1, wherein obtaining the status information report of the network to be queried according to the temporary status report of each network fragment comprises:
sending the temporary status report to an adjacent patch of the network patch;
and summarizing and fusing the temporary status reports of all the network segments to obtain the status information report of the network to be queried.
5. The network state query device based on the slicing is characterized in that the network state query device based on the slicing comprises:
the topology type and network complexity acquisition module is used for acquiring the topology type and network complexity of the network to be queried; the network topology type and the network complexity are respectively used for constructing an identification algorithm and a fragmentation algorithm; the method comprises the steps that the optimal slicing algorithm comprises an optimal slicing algorithm, wherein the optimal slicing algorithm specifically obtains a topological connection relation from top to bottom, searches a first-level topological connection diagram, divides the first-level topological connection diagram into a network slice area, searches sub-node connection relations of network nodes of the first-level network slice area, divides all the sub-nodes into a network slice area, and divides the same-level node with a plurality of levels of node connection relations into a slice area;
the fragmentation processing module is used for carrying out fragmentation processing on the network to be queried according to the identification algorithm and the fragmentation algorithm to obtain at least one network fragment, wherein each network fragment at least comprises one network node, and the network node comprises a father node;
the network node traversing module is used for traversing each network patch from top to bottom to obtain node information of each network node in each network patch; if the node information of the child node is changed, uploading the node information of each network segment with the changed node information from bottom to top, and sending the changed node information to the father node;
the temporary report summarizing module is used for acquiring a temporary status report of each network patch according to the node information, and the temporary reports of the network patches are summarized in the father node;
and the state information report generating module is used for obtaining the state information report of the network to be queried according to the temporary state report of each network fragment.
6. The network state query device based on the slicing is characterized in that the network state query device based on the slicing comprises: a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing when executing the program:
a method of tile-based network state querying as claimed in any of claims 1 to 4.
7. A storage medium storing computer-executable instructions for:
performing the tile-based network state query method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110346967.5A CN113517997B (en) | 2021-03-31 | 2021-03-31 | Network state query method and device based on fragmentation and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110346967.5A CN113517997B (en) | 2021-03-31 | 2021-03-31 | Network state query method and device based on fragmentation and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113517997A CN113517997A (en) | 2021-10-19 |
| CN113517997B true CN113517997B (en) | 2024-03-15 |
Family
ID=78062197
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110346967.5A Active CN113517997B (en) | 2021-03-31 | 2021-03-31 | Network state query method and device based on fragmentation and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113517997B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102195683A (en) * | 2011-05-11 | 2011-09-21 | 深圳市金正方科技有限公司 | Power carrier communication method |
| CN102196481A (en) * | 2011-06-07 | 2011-09-21 | 中兴通讯股份有限公司 | Network status report method, detection method, device and system |
| CN106559345A (en) * | 2016-12-05 | 2017-04-05 | 深圳市国电科技通信有限公司 | Ranked data gathering algorithm based on network topology |
| CN107632924A (en) * | 2017-09-08 | 2018-01-26 | 携程旅游信息技术（上海）有限公司 | Visual presentation method, system, equipment and storage medium are applied in alarm |
| WO2018095300A1 (en) * | 2016-11-23 | 2018-05-31 | 华为技术有限公司 | Network control method, apparatus and system, storage medium |
| CN108712286A (en) * | 2018-05-22 | 2018-10-26 | 华为技术有限公司 | The determination method, apparatus and storage medium of network topology structure |
| CN110943877A (en) * | 2018-09-21 | 2020-03-31 | 华为技术有限公司 | Network state measuring method, equipment and system |
| CN111314023A (en) * | 2020-02-18 | 2020-06-19 | 中国电子科技集团公司第五十四研究所 | Synchronization method of tree network topology information |
| CN111767321A (en) * | 2020-06-30 | 2020-10-13 | 北京百度网讯科技有限公司 | Node relation network determining method and device, electronic equipment and storage medium |
| CN112202593A (en) * | 2020-09-03 | 2021-01-08 | 深圳前海微众银行股份有限公司 | Data acquisition method, device, network management system and computer storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7116643B2 (en) * | 2002-04-30 | 2006-10-03 | Motorola, Inc. | Method and system for data in a collection and route discovery communication network |
-
2021
- 2021-03-31 CN CN202110346967.5A patent/CN113517997B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102195683A (en) * | 2011-05-11 | 2011-09-21 | 深圳市金正方科技有限公司 | Power carrier communication method |
| CN102196481A (en) * | 2011-06-07 | 2011-09-21 | 中兴通讯股份有限公司 | Network status report method, detection method, device and system |
| WO2018095300A1 (en) * | 2016-11-23 | 2018-05-31 | 华为技术有限公司 | Network control method, apparatus and system, storage medium |
| CN106559345A (en) * | 2016-12-05 | 2017-04-05 | 深圳市国电科技通信有限公司 | Ranked data gathering algorithm based on network topology |
| CN107632924A (en) * | 2017-09-08 | 2018-01-26 | 携程旅游信息技术（上海）有限公司 | Visual presentation method, system, equipment and storage medium are applied in alarm |
| CN108712286A (en) * | 2018-05-22 | 2018-10-26 | 华为技术有限公司 | The determination method, apparatus and storage medium of network topology structure |
| CN110943877A (en) * | 2018-09-21 | 2020-03-31 | 华为技术有限公司 | Network state measuring method, equipment and system |
| CN111314023A (en) * | 2020-02-18 | 2020-06-19 | 中国电子科技集团公司第五十四研究所 | Synchronization method of tree network topology information |
| CN111767321A (en) * | 2020-06-30 | 2020-10-13 | 北京百度网讯科技有限公司 | Node relation network determining method and device, electronic equipment and storage medium |
| CN112202593A (en) * | 2020-09-03 | 2021-01-08 | 深圳前海微众银行股份有限公司 | Data acquisition method, device, network management system and computer storage medium |
Non-Patent Citations (2)
| Title |
|---|
| "Memory-efficient algorithms for spatial network queries";S Nutanong;《IEEE》;20131231;全文 * |
| "支持高吞吐量区块链的块结构研究";曾友露;《中国优秀硕士学位论文全文数据库》;20200716;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113517997A (en) | 2021-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3167571B1 (en) | Network topology estimation based on event correlation | |
| Wang et al. | Boundary recognition in sensor networks by topological methods | |
| US8948053B2 (en) | Apparatus and method for detecting critical nodes and critical links in a multi-hop network | |
| Jorgic et al. | Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks | |
| CN1306752C (en) | Using link state information to discover IP network topology | |
| US8842520B2 (en) | Apparatus and method for identifying optimal node placement to form redundant paths around critical nodes and critical links in a multi-hop network | |
| MXPA04002121A (en) | Topology discovery by partitioning multiple discovery techniques. | |
| CN110543728B (en) | Urban traffic network key intersection discovery method | |
| CN110430116B (en) | Data forwarding method and device, edge device and readable storage medium | |
| US20120239793A1 (en) | Detecting Changes Through SNMP Polling | |
| CN108463976A (en) | Reduce the flooding of link in network shape variation | |
| CN108173617B (en) | Method for acquiring full-network clock topology and clock path | |
| CN113347059A (en) | In-band network telemetering optimal detection path planning method based on fixed probe position | |
| CN113517997B (en) | Network state query method and device based on fragmentation and storage medium | |
| CN105282813A (en) | Routing method, device and system used in vehicle-mounted network environment | |
| CN109088756B (en) | Network topology completion method based on network equipment identification | |
| CN102136957B (en) | Label switched path monitoring realization method, device and system | |
| CN107995047B (en) | Topology networking method and device for data center | |
| CN109982327A (en) | A kind of ad hoc network communication method, device, equipment and readable storage medium storing program for executing | |
| Wang et al. | Cluster maintenance in mobile ad-hoc networks | |
| CN110881178B (en) | Data aggregation method for Internet of things based on branch migration | |
| Fraigniaud | Small worlds as navigable augmented networks: Model, analysis, and validation | |
| CN108011730B (en) | Method and device for automatically changing ring network resources in network management system | |
| KR101591595B1 (en) | Method for predicting link in big database | |
| US9621401B1 (en) | Performing dynamic data analysis within a dynamic network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 518000 2101, No. 100, Zhihe Road, Dakang community, Yuanshan street, Longgang District, Shenzhen, Guangdong Applicant after: BANGYAN TECHNOLOGY Co.,Ltd. Address before: 518000 room 901, block B, building 5, Shenzhen software industry base, Nanshan District, Shenzhen City, Guangdong Province Applicant before: BANGYAN TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |