CN115361296B - Network topology calculation method based on manual intervention in operation and maintenance system - Google Patents

Network topology calculation method based on manual intervention in operation and maintenance system Download PDF

Info

Publication number
CN115361296B
CN115361296B CN202211276501.3A CN202211276501A CN115361296B CN 115361296 B CN115361296 B CN 115361296B CN 202211276501 A CN202211276501 A CN 202211276501A CN 115361296 B CN115361296 B CN 115361296B
Authority
CN
China
Prior art keywords
node
data
connection
degree
pointing 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.)
Active
Application number
CN202211276501.3A
Other languages
Chinese (zh)
Other versions
CN115361296A (en
Inventor
刘东海
徐育毅
庞辉富
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Youyun Software Co ltd
Beijing Guangtong Youyun Technology Co ltd
Original Assignee
Hangzhou Youyun Software Co ltd
Beijing Guangtong Youyun Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Youyun Software Co ltd, Beijing Guangtong Youyun Technology Co ltd filed Critical Hangzhou Youyun Software Co ltd
Priority to CN202211276501.3A priority Critical patent/CN115361296B/en
Publication of CN115361296A publication Critical patent/CN115361296A/en
Application granted granted Critical
Publication of CN115361296B publication Critical patent/CN115361296B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • 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/142—Network analysis or design using statistical or mathematical methods
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a network topology calculation method based on manual intervention in an operation and maintenance system, which comprises the following specific steps: (1) The device pointing data Point is put into a table, wherein the device pointing data refers to information of opposite terminal devices corresponding to a source port of one device; (2) Extracting equipment connection data index from the PointTable according to a set rule and putting the equipment connection data index into a table; (3) Carrying out manual intervention on the equipment connection data, finding out the overload node and deleting the redundant connection; (4) And rejecting indirect connection in the network topological graph to generate the network topological graph. The invention has the beneficial effects that: the redundant node (overload node) is subjected to timed and quantitative manual intervention according to the connection condition of the current node equipment, so that misjudgment caused by service change is avoided. The misjudgment can be greatly reduced, and the monitoring coverage and the accuracy are improved.

Description

Network topology calculation method based on manual intervention in operation and maintenance system
Technical Field
The invention relates to the field of intelligent operation and maintenance, in particular to a network topology calculation method based on manual intervention in an operation and maintenance system.
Background
In the field of IT operation and maintenance, a great deal of market demands exist for discovering network nodes and calculating network topology. Through network management software, network nodes are scanned, a network topology is generated, technicians can rapidly and comprehensively master a network structure firstly, and then common operation and maintenance work of the network such as flow monitoring, on-off management, fault positioning and path analysis can be further carried out based on the network topology.
The current topology drawing method mainly draws a static network topology map according to the experience of engineering personnel deployment, however, the change of network communication service usually changes the IP addresses of both network traffic communication parties, and further causes the structure change of the static network topology map. When the traffic of a certain node suddenly becomes concentrated, the node is connected with a plurality of nodes, so that the node is overloaded (defined as an overloaded node in the invention), and thus, a network topology graph contains more redundant information, so that it is necessary to perform timed and quantitative manual intervention on the network topology graph of the operation and maintenance system.
The prior art has the defects that a static network topological graph is drawn only according to the experience of a network deployment person, the interactive behavior of manual intervention communication flow is not considered, and the method is easy to misjudge the change of system configuration, communication volume and the like caused by service change.
In addition, in the process of drawing the static network topology map, because the network structure is complex and the scale is huge, a large number of devices of manufacturers of different brands exist, and the network discovery information standards supported by the devices are inconsistent, for example, cisco manufacturers mainly support CDP, hua manufacturers mainly support LLDP, and some manufacturers support FDB, which brings great difficulty to network topology discovery. The invention integrates network information such as CDP, LLDP, FDB and the like, and draws a static network topological graph by combining static experience of engineers.
Disclosure of Invention
Aiming at the construction process of a network topological graph in the existing operation and maintenance system, the static network topological graph is drawn according to the experience of network deployment personnel, and the problem of redundant connection in the manual intervention communication flow interaction behavior is not considered.
The purpose of the invention is achieved by the following technical scheme. A network topology calculation method based on manual intervention in an operation and maintenance system comprises the following specific steps:
(1) The device pointing data Point is put into a table and is recorded as a device pointing data table PointTable, wherein the device pointing data refers to information of opposite terminal devices corresponding to a source port of one device;
(2) Extracting equipment connection data index from the PointTable according to a set rule, and putting the index into a table to be marked as index Table;
(3) Carrying out manual intervention on the equipment connection data, finding out an overload node and deleting redundant connection;
(4) And rejecting indirect connection in the network topological graph to generate the network topological graph.
Furthermore, the device pointing data module is packaged to package connection information in different devices into device pointing data, and a PointTable is constructed.
Further, the rule in step (2) is:
rule 1: if the Point already has an explicit peer port, the Point is an index;
rule 2: if the Point of the source device points to a peer device, and the peer device also has a Point pointing to the source device, the two points are merged into an index.
Further, the step (3) specifically includes the following steps:
(1) calculating the average In of each node ave And the average Out ave ；
Figure GDA0003966404700000031
Wherein, in sum Represents the sum of the incomes, out, of all nodes sum Represents the sum of the out-degrees of all nodes, num v Representing the number of all nodes;
(2) determining an overload node:
calculating the in-degree and out-degree of each node, and recording the in-degree of the ith node as in i Out of the ith node i When in i +out i >1.5*(In ave +Out ave ) If yes, the node is marked as an overload node;
(3) and deleting redundant connection with the overloaded node:
calculating the in-degree and out-degree of the neighbor nodes of the overloaded node, and recording the in-degree of the jth neighbor node of the ith overloaded node as
Figure GDA0003966404700000032
The out-degree of the jth neighbor node of the ith overloaded node is recorded as
Figure GDA0003966404700000033
If it is not
Figure GDA0003966404700000034
And is provided with
Figure GDA0003966404700000035
The connection of the overloaded node with the corresponding neighboring node is deleted.
Further, in the step (4), the rule of rejecting indirect connections in the network topology map is as follows: an Inject source port and an opposite end port, wherein the source port corresponds to a Point set, the opposite end port corresponds to a Point set, and if the two Point sets have an intersection, the Inject is indirectly connected and needs to be removed; after the elimination, the remaining Direct is the real physical connection in the network, and the network topological graph is formed by drawing the Direct on the topology.
The beneficial effects of the invention are as follows: aiming at the problem that the redundant connection cannot be simplified according to the centralized service change mainly according to the deployment experience of engineering personnel in the conventional network topological graph drawing method, the redundant node (overload node) is subjected to timed and quantitative manual intervention according to the connection condition of the current node equipment, so that misjudgment caused by service change is avoided. Because the invention does not need a large amount of manual operation, has small calculated amount and accurate analysis, the invention can greatly reduce the misjudgment and improve the monitoring coverage and the accuracy.
Drawings
FIG. 1 is a schematic flow chart of a network topology calculation algorithm based on manual intervention according to the present invention;
fig. 2 is a schematic flow chart of deleting redundant connections by manual intervention.
Detailed Description
The invention will be described in detail with reference to the following figures and examples:
as shown in fig. 1, a network topology calculation method based on manual intervention in an operation and maintenance system is implemented by running a total of 4 modules: the device comprises a packaging device pointing data module, a refining device connecting data module, a manual intervention module and a rejection indirect connecting module. Wherein: (1) And the encapsulation device pointing data module encapsulates the connection information in different devices into device pointing data, which indicates the information of the corresponding opposite terminal device on the network port of one device. (2) And the equipment connection data extracting module calculates and extracts equipment connection data from the equipment pointing data according to a set rule, and indicates the connection relation between the equipment. (3) The manual intervention module is used for performing manual intervention on the equipment connection data, finding out an overload node and deleting redundant connection; (4) And an indirect connection module is eliminated, and the topology requires only displaying a direct connection, so that the indirect connection needs to be eliminated.
The method comprises the following specific steps:
(1) The device pointing data Point is put into a table and is recorded as a device pointing data table PointTable, wherein the device pointing data refers to information of opposite terminal devices corresponding to a source port (network port) of one device; device pointing data does not indicate direct connection between devices, but only indicates that there is a possibility. The format is as follows:
Figure GDA0003966404700000041
because the network discovery information standards supported by the devices of different brands of manufacturers are inconsistent, for example, cisco manufacturers mainly support CDP, warrior manufacturers mainly support LLDP, and some manufacturers support FDB, great difficulty is brought to the discovery of the network topology architecture. The method integrates network information such as CDP, LLDP, FDB and the like, converts connection information in different devices into device pointing data by packaging a device pointing data module, constructs PointTable, and draws a static network topological graph by combining static experience of engineers.
(1) Cisco vendor supported CDP information
Since the CDP protocol is itself an algorithm invented for topology calculation, its structure is consistent with the pointed data structure.
The structure is as follows:
Figure GDA0003966404700000051
(2) Huawei vendor supported LLDP information
The LLDP protocol adds flexible field support for more compatible devices, and therefore requires some translation with the discovered data.
The structure is as follows:
Figure GDA0003966404700000052
Figure GDA0003966404700000061
(3) FDB information universally supported by switches
The FDB information is an address forwarding table, and only one MAC address can be retained, and it cannot be determined that the peer is a device, possibly only a host.
When the FDB is converted to Point, if the port of the port device can be uniquely identified by the MAC address of the peer device, the peer port can be generated, otherwise, the peer port is marked as unknown. At present, a large number of network devices exist, and in order to save MAC addresses, all ports often use the same MAC address, so that effective determination cannot be carried out.
The structure is as follows:
Figure GDA0003966404700000062
(2) After the device pointing data table, namely the PointTable, is obtained, the algorithm enters the second stage, and mainly extracts useful Point information in the device pointing data table to generate device connection data (note that the connection is also likely to be Indirect connection, so the connection is not a final topological line yet), and the device connection data is recorded as Indirect.
Extracting equipment connection data index from the PointTable according to a set rule, and putting the index into a table, and marking the index as index Table; the rule is as follows:
rule 1: if the Point already has an explicit peer port, the Point is an index;
rule 2: if the Point of the source device points to a peer device, and the peer device also has a Point pointing to the source device, the two points are merged into an index.
(3) And performing manual intervention on the equipment connection data, finding out the overload node and deleting the redundant connection, as shown in fig. 2, specifically comprising the following steps:
(1) calculating the average In of each node of the topological graph ave And the average Out ave ；
Figure GDA0003966404700000071
Wherein, in sum Represents the sum of the incomes, out, of all nodes sum Represents the sum of the out-degrees of all nodes, num v Representing the number of all nodes in the topological graph; the in-degree of a node refers to the number of edges entering the node, and the out-degree of the node refers to the number of edges starting from the node;
(2) determining an overload node:
calculating the in-degree and out-degree of each node, and recording the in-degree of the ith node as in i The out degree of the ith node is recorded as out i When in i +out i >1.5*(In ave +Out ave ) If yes, the node is marked as an overload node; i.e. nodes with a value (sum of in-degree and out-degree) greater than 1.5 times the average value are marked as overloaded nodes.
(3) Deleting redundant connections with overloaded nodes:
calculating the in-degree and out-degree of the neighbor nodes of the overloaded node, and recording the in-degree of the jth neighbor node of the ith overloaded node as
Figure GDA0003966404700000072
The out-degree of the jth neighbor node of the ith overloaded node is recorded as
Figure GDA0003966404700000073
If it is used
Figure GDA0003966404700000074
And is
Figure GDA0003966404700000075
The connection of the overloaded node with the corresponding neighboring nodes is deleted.
(4) And rejecting indirect connection in the network topological graph to generate the network topological graph. For each index, it only indicates that there is a connection between two ports of the device, but it cannot be determined whether there is a direct connection or an Indirect connection, and the topology requires that only the direct connection is displayed, so that the Indirect connection needs to be eliminated.
The rule for rejecting indirect connections in a network topology is as follows: an induect source port and an opposite terminal port, wherein the source port corresponds to a Point set, the opposite terminal port corresponds to a Point set, and if the two Point sets have an intersection (intersection operation has a value), the induect is indirectly connected and needs to be removed; after the elimination, the remaining Direct is the real physical connection in the network, and the network topological graph is formed by drawing the Direct on the topology.
It should be understood that equivalent substitutions and changes to the technical solution and the inventive concept of the present invention should be made by those skilled in the art to the protection scope of the appended claims.

Claims (4)

1. A network topology calculation method based on manual intervention in an operation and maintenance system is characterized in that: the method comprises the following specific steps:
(1) The device pointing data is put into a table and is recorded as a device pointing data table, wherein the device pointing data refers to information of opposite terminal devices corresponding to a source port of one device;
(2) Extracting equipment connection data from the equipment pointing data table according to a set rule, putting the equipment connection data into a table, and recording the table as an equipment connection data table;
(3) Carrying out manual intervention on the equipment connection data, finding out the overload node and deleting the redundant connection, and specifically comprising the following steps:
(1) calculating the average In of each node ave And the average Out ave ；
Figure FDA0003966404690000011
Wherein, in sum Represents the sum of the incomes, out, of all nodes sum Represents the sum of the out-degrees of all nodes, num v Representing the number of all nodes;
(2) determining an overload node:
calculating the in-degree and out-degree of each node, and recording the in-degree of the ith node as in i The out degree of the ith node is recorded as out i When in i +out i >1.5*(In ave +Out ave ) If the node is the overload node, the node is marked as the overload node;
(3) deleting redundant connections with overloaded nodes:
calculating the in-degree and out-degree of the neighbor nodes of the overloaded node, and recording the in-degree of the jth neighbor node of the ith overloaded node as
Figure FDA0003966404690000012
The out-degree of the jth neighbor node of the ith overloaded node is recorded as
Figure FDA0003966404690000013
If it is not
Figure FDA0003966404690000014
And is provided with
Figure FDA0003966404690000015
The connection of the overloaded node with the corresponding neighboring node is deleted；
(4) And rejecting indirect connection in the network topological graph to generate the network topological graph.
2. The method for computing network topology based on human intervention in operation and maintenance system according to claim 1, wherein: and packaging the connection information in different devices into device pointing data through a device pointing data packaging module, and constructing a device pointing data table.
3. The method for computing network topology based on human intervention in operation and maintenance system according to claim 2, wherein: the rule in the step (2) is as follows:
rule 1: if the device pointing data has an explicit opposite end port, the device pointing data is device connection data;
rule 2: if the device pointing data of the source device points to a peer device, and the peer device also has a device pointing data pointing to the source device, the two device pointing data are merged into a device connection data.
4. The method for computing the network topology based on manual intervention in the operation and maintenance system according to claim 3, wherein: in the step (4), the rule of removing indirect connections in the network topology map is as follows: a device connects a source port of data with an opposite port, wherein the source port corresponds to a device pointing data set, the opposite port corresponds to a device pointing data set, and if the two device pointing data sets have intersection, the device connecting data is indirectly connected and needs to be removed; after the elimination, the remaining device connection data is the real physical connection in the network, and the network topology map is formed by drawing the data on the topology.
CN202211276501.3A 2022-10-19 2022-10-19 Network topology calculation method based on manual intervention in operation and maintenance system Active CN115361296B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211276501.3A CN115361296B (en) 2022-10-19 2022-10-19 Network topology calculation method based on manual intervention in operation and maintenance system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211276501.3A CN115361296B (en) 2022-10-19 2022-10-19 Network topology calculation method based on manual intervention in operation and maintenance system

Publications (2)

Publication Number Publication Date
CN115361296A CN115361296A (en) 2022-11-18
CN115361296B true CN115361296B (en) 2023-01-24

Family

ID=84007640

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211276501.3A Active CN115361296B (en) 2022-10-19 2022-10-19 Network topology calculation method based on manual intervention in operation and maintenance system

Country Status (1)

Country Link
CN (1) CN115361296B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115550193B (en) * 2022-12-01 2023-03-17 北京广通优云科技股份有限公司 Network topology calculation method combining static structure chart and dynamic flow analysis data

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106452827A (en) * 2016-07-29 2017-02-22 杭州优云软件有限公司 Network topology calculation method for mixing CDP, LLDP and FDB data
CN108768691A (en) * 2018-04-16 2018-11-06 复旦大学 Ethernet automated topology based on snmp protocol is found and cyclic position detecting system
EP3565181A1 (en) * 2016-12-29 2019-11-06 Ping An Technology (Shenzhen) Co., Ltd. Network topology adaptive data visualization method, device, apparatus and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7948922B2 (en) * 2006-04-18 2011-05-24 Cisco Technology, Inc. Blocked redundant link-aware spanning tree protocol enhancement

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106452827A (en) * 2016-07-29 2017-02-22 杭州优云软件有限公司 Network topology calculation method for mixing CDP, LLDP and FDB data
EP3565181A1 (en) * 2016-12-29 2019-11-06 Ping An Technology (Shenzhen) Co., Ltd. Network topology adaptive data visualization method, device, apparatus and storage medium
CN108768691A (en) * 2018-04-16 2018-11-06 复旦大学 Ethernet automated topology based on snmp protocol is found and cyclic position detecting system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于全互连立方体的Ad Hoc网络自适应路由算法;王曙毅等;《电路与系统学报》;20071015(第05期);全文 *

Also Published As

Publication number Publication date
CN115361296A (en) 2022-11-18

Similar Documents

Publication Publication Date Title
CN109150640A (en) A kind of method for discovering network topology and system based on double layer network agreement
CN112564964B (en) Fault link detection and recovery method based on software defined network
CN108282362B (en) Network topology generation method, device and equipment
US9276853B2 (en) Hashing of network packet flows for efficient searching
CN111786857B (en) Network asset active detection method and system based on distribution
CN115361296B (en) Network topology calculation method based on manual intervention in operation and maintenance system
CN112738791A (en) User information correlation backfill method, device, equipment and medium based on 5G core network
CN107733713B (en) Method, system, device and storage medium for acquiring network topology in hybrid network
WO2021147320A1 (en) Routing abnormity detection method, apparatus and system, and computer storage medium
CN113452561A (en) Topology generation method, device and equipment and readable storage medium
CN112751733A (en) Link detection method, device, equipment, system and switch
CN112822053B (en) SNMP-based link layer network topology structure discovery method and system
CN104579978B (en) A kind of dynamic network Datalink Layer Topology Discovery method
US20130042020A1 (en) Quick Network Path Discovery
CN101945110B (en) Configuration method and device of address resolution protocol entry
US20040158780A1 (en) Method and system for presenting neighbors of a device in a network via a graphical user interface
CN114024859A (en) Network topology generation method based on equipment and link discovery, storage medium and terminal
CN110730093B (en) Metropolitan area network topology mapping method and device
US8743736B2 (en) Inferring connectivity in the presence of conflicting network data
CN111985569A (en) Anonymous node positioning method based on multi-source point clustering idea
JP7056207B2 (en) Topology determination device, topology determination method, topology determination program and communication system
CN110572278A (en) Method and device for positioning information of three-layer gateway of metropolitan area network
CN115550193B (en) Network topology calculation method combining static structure chart and dynamic flow analysis data
CN107547282B (en) Information and communication service influence analysis model establishing method and system
CN112527453B (en) Virtualization information simulation system, method and computer-readable storage medium

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