CN111654413B - Method, equipment and storage medium for selecting effective measurement points of network flow - Google Patents
Method, equipment and storage medium for selecting effective measurement points of network flow Download PDFInfo
- Publication number
- CN111654413B CN111654413B CN202010421328.6A CN202010421328A CN111654413B CN 111654413 B CN111654413 B CN 111654413B CN 202010421328 A CN202010421328 A CN 202010421328A CN 111654413 B CN111654413 B CN 111654413B
- Authority
- CN
- China
- Prior art keywords
- network
- selecting
- points
- measuring points
- effective
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/04—Processing captured monitoring data, e.g. for logfile generation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/50—Testing arrangements
Abstract
The invention discloses a method, a device and a storage medium for selecting effective measurement points of network flow, which are applied to a network with the number of the measurement points less than or equal to 10000 and comprise the following steps: acquiring all measurement points and network links in a network to generate a network topology model; and selecting a plurality of least effective measuring points from the network topology model based on a 0-1 integer linear programming method, wherein the effective measuring points can cover all network links in the network topology model. Compared with the currently used heuristic algorithm, the method has higher accuracy in obtaining the optimal solution. The method can be suitable for selecting effective measuring points in internal local area networks of general large and medium-sized enterprises and schools, meets the requirements of most scenes in life, is practical, and is convenient to popularize and use.
Description
Technical Field
The invention relates to the technical field of network flow measurement, in particular to a method and equipment for selecting effective measurement points of network flow and a storage medium.
Background
With the increasing importance of the Internet and the increasing complexity of network architecture, network management becomes the focus of attention. Modern network management systems focus on service level and application level management, such as active and passive resource management, traffic engineering, end-to-end quality of service guarantees, etc. All these network management services are based on knowing network operation parameters such as network traffic. For this reason, it is necessary to measure and analyze network traffic to facilitate discovering network bottlenecks, optimizing network configuration, and further discovering potential hazards that may exist in the network.
At present, 3 methods commonly used in network traffic monitoring are respectively: 1. monitoring techniques based on hardware probes; 2. a flow mirror protocol based analysis method; 3. SNMP-based traffic monitoring technology.
The hardware probe is a hardware device for acquiring network traffic, and is connected in series in a traffic link to be captured when in use, and acquires information by shunting digital signals on the link. A hardware probe monitors traffic information for a subnet (typically a link). A distributed distribution scheme is adopted for monitoring the whole network flow, a probe is deployed on each link, and then the whole network flow analysis and long-term report are carried out through data of all the probes of the background server, the database and the mobile phone. Compared with the other two modes, the biggest characteristic of the hardware-based probe is that abundant detailed information from a physical layer to an application layer can be provided. However, the monitoring mode of the hardware probe is limited by the interface rate of the probe, and generally only aims at the rate below 1000M. And the mode of the probe mainly focuses on the flow analysis of a single link, and obviously, the method is high in cost and not easy to expand when the flow of the whole network needs to be monitored.
The protocol analysis mode of the flow mirror (on-line TAP) is to mirror the flow of a certain port (link) of the network equipment to a protocol analyzer and monitor the network flow by decoding a 7-layer protocol. Compared with two modes, the protocol analysis is the most basic means of network test and is particularly suitable for network fault analysis. The defect is that the analysis mode of the flow mirror image (on-line TAP) protocol only aims at a single link, and is not suitable for monitoring the whole network.
In essence, the SNMP-based traffic information collection is that a test instrument collects some specific device and traffic information related variables by extracting MIB (management object information base) provided by a network device Agent. The network traffic information collected based on SNMP includes: input byte number, input non-broadcast packet number, input packet error number, input position protocol packet number, output byte number, output non-broadcast packet number, output packet discard number, output packet error number, output queue length, and the like. Similar methods also include RMON. Compared with other modes, the SNMP-based flow monitoring technology is widely supported by equipment manufacturers, is convenient to use and is easy to expand. But the disadvantage is that the information is not rich enough and accurate, and the analysis focuses on the information and messages of the devices at the 2, 3 layers of the network. The SNMP approach is often integrated in other 3 schemes, and if SNMP is used alone for long-term and large-scale network traffic monitoring, a background database needs to be used on the basis of a test instrument.
Networks are now widely varied and continue to expand in size, with campus networks and corporate intranets being the most common. When monitoring a local network, the selected method not only ensures accurate and comprehensive acquisition of network traffic parameters, but also minimizes the extra load of data collection on actual network data transmission, and controls the cost of traffic monitoring. Based on these three points, it is unreasonable to achieve a method for monitoring the whole network by monitoring each link in the network in real life, because a general local area network has no high security requirement, so that it does not need too detailed network information, and meanwhile, a maintainer of the local area network also needs to balance maintenance cost and management efficiency, after all, the network is stable in most of time, and therefore, it needs to select to use an effective monitoring node to perform, wherein each monitoring node can monitor traffic on the links connected to the monitoring node, and the method has the advantages that: 1. the cost is saved, and only a part of nodes are needed to monitor the whole network; 2. the expansibility is high, and when nodes of the nodes in the network are deleted or added, the monitoring points are conveniently replanned; 3. causing a low load on the network itself. Therefore, the method becomes the first choice in the network traffic monitoring method, and the problem of selecting effective traffic monitoring points becomes the focus of research.
In the existing research, the network traffic effective measurement point selection problem is generally converted into the minimum vertex coverage problem in a given undirected graph, and the problem is a classic NP-hard problem. Heuristic algorithms (algorithms based on intuitive or empirical construction) are generally used in solving the problem of minimum vertex coverage in undirected graphs, and are proposed relative to optimization algorithms, which are characterized by generally giving a feasible solution to each instance of the combinatorial optimization problem to be solved at an acceptable cost (in terms of computation time and space), and the deviation degree of the feasible solution from the optimal solution cannot be generally predicted. That is, a feasible solution can be found within a reasonable time, but the optimal solution cannot be found.
Disclosure of Invention
The present invention is directed to solving at least one of the problems of the prior art. Therefore, the invention provides a method, equipment and a storage medium for selecting effective measurement points of network traffic.
The embodiment of the invention provides a method for selecting effective measuring points of network flow, which is applied to a network with the number of the measuring points less than or equal to 10000 and comprises the following steps:
acquiring all measurement points and network links in a network to generate a network topology model;
and selecting a plurality of effective measuring points with the minimum quantity from the network topology model based on a 0-1 integer linear programming method, wherein the effective measuring points can cover all network links in the network topology model.
According to the embodiment of the invention, at least the following technical effects are achieved:
compared with the currently used heuristic algorithm, the method has higher accuracy in obtaining the optimal solution. The method is applied to the network with the number of the measuring points less than or equal to 10000, can be suitable for selecting the effective measuring points in the internal local area networks of the general middle and large-sized enterprises and schools, meets the requirements of most scenes in life, is practical, and is convenient to popularize and use.
According to some embodiments of the present invention, the 0-1 integer-based linear programming method specifically uses a simplex method.
Some embodiments of the present invention, said selecting a minimum number of valid measurement points from the network topology model, includes the steps of:
the network topology model is a undirected network topology graph, and G is (E, V), wherein E represents a set of network links, and V represents a set of measurement points;
for any measuring point V epsilon V, constructing variable x v And x v ∈{0,1}；
Constructing a constraint condition:
x u +x v not less than 1, whereinu∈V，x u E {0,1}, a network link exists between a measuring point u and a measuring point v, and an objective function is set as follows: min sigma v∈V x v ；
Solving the objective function, and outputting a set C ═ V ∈ V | x v 1 and I ═ V ∈ V | x v 0, in the set C ═ V ∈ V | x v 1 as a result of the selection of valid measurement points.
The embodiment of the invention provides a device for selecting effective measurement points of network flow, which comprises: at least one control processor and a memory for communicative connection with the at least one control processor; the memory stores instructions executable by the at least one control processor to enable the at least one control processor to perform a method for network traffic efficient measurement point selection as described above.
Embodiments of the present invention provide a computer-readable storage medium storing computer-executable instructions for causing a computer to perform a method for selecting an effective measurement point of network traffic as described above.
The beneficial effects achieved by the selection device and the readable storage medium for providing the effective network flow measuring point provided by the invention are the same as those of the method, and are not repeated herein.
Additional aspects and advantages of the invention 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 invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flowchart of a method for selecting an effective measurement point of network traffic according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of test results provided by an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a device for selecting an effective measurement point of network traffic according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention and are not to be construed as limiting the present invention.
The first embodiment:
referring to fig. 1, a method for selecting an effective measurement point of network traffic is provided, which includes the following steps:
s100, acquiring all measuring points and network links in a network, and generating a undirected network topological graph;
s200, selecting a plurality of least effective measuring points from the undirected network topological graph based on a 0-1 integer linear programming method, wherein the effective measuring points can cover all network links in the undirected network topological graph.
Specifically, the simplex method is specifically used based on the 0-1 integer linear programming method. When the linear programming problem with the decision variable number of less than 10000 is processed, the processing process of the simplex method is more convenient, and the result is more visual.
Specifically, the method for selecting a plurality of effective measurement points with the minimum number from the network topology model comprises the following steps:
setting the undirected network topology map as G ═ E, V, wherein E represents a set of network links, and V represents a set of measurement points;
for any measurement point V epsilon V, constructing variable x v And x v ∈{0,1}；
Constructing a constraint condition:
x u +x v ≧ 1, where u ∈ V, x u E {0,1}, a link exists between the measuring point u and the measuring point v, and an objective function is set as follows: min sigma v∈V x v ；
Solving the objective function, and outputting C ═ V ∈ V | x v 1 and I ═ V ∈ V | x v 0, in the set C ═ V ∈ V | x v 1 as a result of the selection of valid measurement points.
The embodiment is applied to the network with the number of the measuring points being less than or equal to 10000, can be suitable for selecting effective measuring points in internal local area networks of large and medium enterprises and schools, meets the requirements of most scenes in life, is fit for reality, and is convenient to popularize and use.
The second embodiment:
the testing is carried out on MATLAB, 23 example graphs with the number of nodes less than 10000 are selected from a Network Data reproducibility website for testing, the testing result is compared with the preprocessing stage in heuristic algorithm FastVC, and the testing result is shown in figure 2.
Wherein, | V | and | E | respectively represent the number of points and the number of edges of the example graph, | V '| and | E' | respectively represent the number of points and the number of edges left after preprocessing the example graph, and minVC represents the minimum vertex coverage size found in the example graph. As can be seen from fig. 2, in the test of 23 small and medium-sized sparse network topologies, the optimal solution was found in all 23 case diagrams using the 0-1 integer linear programming, while FastVC found the optimal solution in 22 case diagrams, and one case diagram (bio-dmela) found the suboptimal solution. Comparing the preprocessed results, FastVC finds the optimal solution in 13 case diagrams directly in the preprocessing stage, while the rest 10 case diagrams still need to be solved by an algorithm through a heuristic process, and the optimal solution is directly obtained on all 23 case diagrams by using 0-1 integer linear programming. In the embodiment, the network topological graph with the number of the plurality of measuring points being less than or equal to 10000 is tested, and the test result proves that compared with the scheme of solving the effective measuring points by the existing heuristic algorithm, the accuracy of obtaining the optimal solution by the method is higher.
The third embodiment:
referring to fig. 3, an embodiment of the present invention further provides a device for selecting an effective measurement point of network traffic, where the device for selecting an effective measurement point of network traffic may be any type of intelligent terminal, such as a mobile phone, a tablet computer, a personal computer, and the like.
Specifically, the device for selecting the effective measurement point of the network traffic comprises: one or more control processors and memory, one control processor being illustrated in fig. 3. The control processor and the memory may be connected by a bus or other means, as exemplified by the bus connection in fig. 3.
The memory is used as a non-transitory computer readable storage medium, and may be used to store a non-transitory software program, a non-transitory computer executable program, and a module, such as a program instruction/module corresponding to the device for selecting an effective measurement point of network traffic in the embodiment of the present invention, and the control processor implements the method for selecting an effective measurement point of network traffic in the embodiment of the method by operating the non-transitory software program, the non-transitory computer executable program, and the non-transitory computer executable module stored in the memory.
The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store the generated data. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory remotely located from the control processor, and the remote memory may be connected to the selected device of the network traffic valid measurement point via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
One or more modules are stored in the memory and, when executed by the one or more control processors, perform the method for selecting a network traffic valid measurement point in the above-described method embodiments, e.g., performing the above-described method steps S100 to S200 in fig. 1.
Embodiments of the present invention further provide a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, which are executed by one or more control processors, for example, by one of the control processors in fig. 3, and may cause the one or more control processors to perform the method for selecting the network traffic valid measurement point in the above method embodiment, for example, perform the above-described method steps S100 to S200 in fig. 1.
Through the above description of the embodiments, those skilled in the art can clearly understand that the embodiments can be implemented by software plus a general hardware platform. Those skilled in the art will appreciate that all or part of the processes of the methods of the above embodiments may be implemented by hardware related to instructions of a computer program, and the computer program may be stored in a computer readable storage medium, and when executed, may include the processes of the embodiments of the methods. The storage medium may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
Claims (3)
1. A method for selecting effective measuring points of network flow is characterized in that the method is applied to a network with the number of measuring points less than or equal to 10000, and comprises the following steps:
acquiring all measuring points and network links in a network to generate a network topology model;
selecting a plurality of effective measuring points with the minimum quantity from the network topology model by adopting a simplex method, wherein the effective measuring points can cover all network links in the network topology model, and the process of selecting the effective measuring points is as follows:
the network topology model is a undirected network topology map, and the undirected network topology map is G-E, V, wherein E represents a set of network links, and V represents a set of measurement points;
for any measurement point V epsilon V, constructing variable x v And x v ∈{0，1}；
Constructing a constraint condition:
x u +x v more than or equal to 1, wherein u is epsilon V and x u E {0,1}, a network link exists between a measuring point u and a measuring point v, and an objective function is set as follows: min sigma v∈V x v ；
Solving the objective function, and outputting a set C ═ V ∈ V | x v 1 and I ═ V ∈ V | x v 0, in the set C ═ V ∈ V | x v 1 as a result of the selection of valid measurement points.
2. A device for selecting effective measurement points of network traffic is characterized by comprising: at least one control processor and a memory for communicative connection with the at least one control processor; the memory stores instructions executable by the at least one control processor to enable the at least one control processor to perform a method of network traffic efficient measurement point selection as claimed in claim 1.
3. A computer-readable storage medium having computer-executable instructions stored thereon for causing a computer to perform the method of selecting the efficient measurement point of network traffic as claimed in claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010421328.6A CN111654413B (en) | 2020-05-18 | 2020-05-18 | Method, equipment and storage medium for selecting effective measurement points of network flow |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010421328.6A CN111654413B (en) | 2020-05-18 | 2020-05-18 | Method, equipment and storage medium for selecting effective measurement points of network flow |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111654413A CN111654413A (en) | 2020-09-11 |
| CN111654413B true CN111654413B (en) | 2022-07-26 |
Family
ID=72352304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010421328.6A Active CN111654413B (en) | 2020-05-18 | 2020-05-18 | Method, equipment and storage medium for selecting effective measurement points of network flow |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111654413B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112636998B (en) * | 2020-11-24 | 2022-03-08 | 鹏城实验室 | Intra-domain fault detection method based on machine learning, terminal and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101784058A (en) * | 2009-12-30 | 2010-07-21 | 北京市天元网络技术股份有限公司 | Method and device for selecting network performance measuring points |
| CN102523170A (en) * | 2011-12-31 | 2012-06-27 | 北京航空航天大学 | Method for configuring regenerators in wavelength division multiplexing optical network |
| WO2012135521A1 (en) * | 2011-03-29 | 2012-10-04 | Huawei Technologies Co., Ltd. | Apparatus and method for spare capacity allocation on dual link failures |
| CN102752395A (en) * | 2012-07-13 | 2012-10-24 | 浙江大学 | On-line scheduling method for real-time service distribution of distributed type data center |
| CN103871246A (en) * | 2014-02-10 | 2014-06-18 | 南京大学 | Short-term traffic flow forecasting method based on road network space relation constraint Lasso |
| CN104156508A (en) * | 2014-07-23 | 2014-11-19 | 国家电网公司 | Solving method of mixed integer linear programming model |
| CN106817739A (en) * | 2015-12-02 | 2017-06-09 | 扬州大学 | A kind of wireless sensor and actor networks based on mobile sink node Energy Efficient are by agreement |
| CN108809707A (en) * | 2018-05-30 | 2018-11-13 | 浙江理工大学 | A kind of TSN dispatching methods towards real-time application demand |
| CN108989133A (en) * | 2018-08-27 | 2018-12-11 | 山东大学 | Network detection optimization method based on ant group algorithm |
| CN110022230A (en) * | 2019-03-14 | 2019-07-16 | 北京邮电大学 | The parallel dispositions method of service chaining and device based on deeply study |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7889641B2 (en) * | 2006-07-18 | 2011-02-15 | Opnet Technologies, Inc. | Path flow formulation for fast reroute bypass tunnels in MPLS networks |
| JP4491491B2 (en) * | 2008-03-21 | 2010-06-30 | 本田技研工業株式会社 | Equipment for optimizing measurement points for measuring the controlled object |
| EP2797257A1 (en) * | 2013-04-22 | 2014-10-29 | Alcatel Lucent | Method for providing network topology information in a communication network |
| US10305747B2 (en) * | 2016-06-23 | 2019-05-28 | Sap Se | Container-based multi-tenant computing infrastructure |
| CN108462643B (en) * | 2016-12-11 | 2021-02-02 | 苏州大学 | Integer transmission rate-oriented weak security multicast transmission topology construction method based on network coding |
| US10805382B2 (en) * | 2018-01-29 | 2020-10-13 | International Business Machines Corporation | Resource position planning for distributed demand satisfaction |
-
2020
- 2020-05-18 CN CN202010421328.6A patent/CN111654413B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101784058A (en) * | 2009-12-30 | 2010-07-21 | 北京市天元网络技术股份有限公司 | Method and device for selecting network performance measuring points |
| WO2012135521A1 (en) * | 2011-03-29 | 2012-10-04 | Huawei Technologies Co., Ltd. | Apparatus and method for spare capacity allocation on dual link failures |
| CN102523170A (en) * | 2011-12-31 | 2012-06-27 | 北京航空航天大学 | Method for configuring regenerators in wavelength division multiplexing optical network |
| CN102752395A (en) * | 2012-07-13 | 2012-10-24 | 浙江大学 | On-line scheduling method for real-time service distribution of distributed type data center |
| CN103871246A (en) * | 2014-02-10 | 2014-06-18 | 南京大学 | Short-term traffic flow forecasting method based on road network space relation constraint Lasso |
| CN104156508A (en) * | 2014-07-23 | 2014-11-19 | 国家电网公司 | Solving method of mixed integer linear programming model |
| CN106817739A (en) * | 2015-12-02 | 2017-06-09 | 扬州大学 | A kind of wireless sensor and actor networks based on mobile sink node Energy Efficient are by agreement |
| CN108809707A (en) * | 2018-05-30 | 2018-11-13 | 浙江理工大学 | A kind of TSN dispatching methods towards real-time application demand |
| CN108989133A (en) * | 2018-08-27 | 2018-12-11 | 山东大学 | Network detection optimization method based on ant group algorithm |
| CN110022230A (en) * | 2019-03-14 | 2019-07-16 | 北京邮电大学 | The parallel dispositions method of service chaining and device based on deeply study |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111654413A (en) | 2020-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3510658B2 (en) | Network analysis method | |
| Huo et al. | A SDN‐based fine‐grained measurement and modeling approach to vehicular communication network traffic | |
| CN104270268B (en) | A kind of distributed system network performance evaluation and method for diagnosing faults | |
| US20200287814A1 (en) | Training method and apparatus for service quality assessment model | |
| CN107204894B (en) | Method and device for monitoring network service quality | |
| CN102868553B (en) | Fault Locating Method and relevant device | |
| KR20180120558A (en) | System and method for predicting communication apparatuses failure based on deep learning | |
| CN102158360A (en) | Network fault self-diagnosis method based on causal relationship positioning of time factors | |
| KR20060044844A (en) | High-speed traffic measurement and analysis methodologies and protocols | |
| Qiao et al. | Characterizing flow, application, and user behavior in mobile networks: A framework for mobile big data | |
| US20230140836A9 (en) | Anomaly detection method and device, terminal and storage medium | |
| CN111934936B (en) | Network state detection method and device, electronic equipment and storage medium | |
| CN114629802A (en) | Power communication backbone network quality evaluation method based on service perception | |
| Prieto et al. | Toward decentralized probabilistic management | |
| CN111654321A (en) | Satellite network management method and device and electronic equipment | |
| Liu et al. | A SDN-based active measurement method to traffic QoS sensing for smart network access | |
| CN111654413B (en) | Method, equipment and storage medium for selecting effective measurement points of network flow | |
| Qian et al. | Characterization of 3g data-plane traffic and application towards centralized control and management for software defined networking | |
| CN114301818A (en) | Service flow detection method, device, system, terminal and storage medium | |
| CN112235154A (en) | Data processing method, system, device and medium based on Internet of things | |
| CN114978976B (en) | Data anomaly detection method and device for SRv6 converged network | |
| Huo et al. | A software‐defined networks‐based measurement method of network traffic for 6G technologies | |
| CN113364652B (en) | Network card flow testing method, device, network equipment, system and readable medium | |
| Shahraeini et al. | Towards an unified dependency analysis methodology for wide area measurement systems in smart grids | |
| CN113114480A (en) | Data reporting method and related equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |