CN108616385B - Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree - Google Patents
Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree Download PDFInfo
- Publication number
- CN108616385B CN108616385B CN201810273481.1A CN201810273481A CN108616385B CN 108616385 B CN108616385 B CN 108616385B CN 201810273481 A CN201810273481 A CN 201810273481A CN 108616385 B CN108616385 B CN 108616385B
- Authority
- CN
- China
- Prior art keywords
- mib
- current
- mib table
- instance
- network management
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/02—Standardisation; Integration
- H04L41/0213—Standardised network management protocols, e.g. simple network management protocol [SNMP]
-
- 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/04—Network management architectures or arrangements
- H04L41/046—Network management architectures or arrangements comprising network management agents or mobile agents therefor
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a query method of a simple network management protocol agent, a traversal method of an MIB tree and a system, relating to the technical field of communication. The query method comprises the following steps: a Simple Network Management Protocol (SNMP) agent receives a request message of a Network Management System (NMS) for GetNext or GetBulk of a managed object in a Management Information Base (MIB); and when the current MIB table searched by the SNMP agent does not have an instance, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes. The invention can reduce the processing algorithm overhead of the SNMP agent to GetNext and GetBulk requests, bring optimization effect and improve the response speed of the network equipment to GetNext and GetBulk requests.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a query method of a simple network management protocol agent, a traversal method of an MIB tree and a system.
Background
Simple Network Management Protocol (SNMP) is an application layer Protocol based on TCP/IP and is mainly used for Management of Network devices. The SNMP protocol provides a uniform cross-platform device Management method, and a Network Management System (NMS) can implement operations such as collecting device information, modifying device parameter values, monitoring device states, and the like through the SNMP protocol. The software modules on the managed devices for maintaining various Information data and responding to NMS operation requests are called SNMP agents (SNMP agents), each SNMP Agent having its own Management Information Base (MIB) which is a hierarchical tree structure with nodes of the tree representing managed objects, the MIB giving a data structure of a set of managed objects, each managed Object having an Object Identifier (OID).
Currently, the commonly used version of SNMPv2 defines 7 operation types of Get, GetNext, Response, Set, Trap, getblock and Inform, wherein the GetNext operation is used for realizing that the NMS acquires the next parameter value of one or more parameter values from the SNMP agent; the GetBulk operation is an extension of the GetNext operation in the SNMPv2 version, and can be considered as performing N iterations of GetNext in one operation, so that the NMS can acquire batch data from the SNMP agent more efficiently. The request messages of the two operation types can designate an MIB node instance, when the SNMP agent needs to search whether the next instance of the designated instance exists in the current table of the MIB tree, if so, the instance is returned; if not, the first instance of the next leaf node is looked up. And when all leaf nodes of the current table are traversed and no effective instance can be found, continuously traversing the next table in the MIB tree until an effective instance is found. Therefore, for these two operation types, the SNMP agent usually needs to traverse the MIB tree frequently, and the traversal method of MIB tree can greatly affect the speed of SNMP agent responding to NMS request, which causes a large algorithm overhead when the number of leaf nodes in a table is extremely large.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a query method of a simple network management protocol agent, a traversal method of an MIB tree and a system, which can reduce the processing algorithm overhead of an SNMP agent on GetNext and GetBulk requests and improve the response speed of network equipment on GetNext and GetBulk requests.
The invention provides a query method of a simple network management protocol agent, which comprises the following steps:
a Simple Network Management Protocol (SNMP) agent receives a request message of a Network Management System (NMS) for GetNext or GetBulk of a managed object in a Management Information Base (MIB);
and when no instance exists in the current MIB table searched by the SNMP agent, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes.
On the basis of the technical scheme, an instance corresponding to an object identifier carried by the request message of the GetNext is a last instance of the current MIB table;
the corresponding instance of the object identifier carried by the GetBulk request message is any one of continuous N instances before the current MIB table, and N is more than or equal to 2.
On the basis of the above technical solution, the instance corresponding to the object identifier carried by the request packet is a scalar node of the MIB tree.
On the basis of the technical scheme, an instance corresponding to an object identifier carried by the request message of the GetNext is the last instance of a first MIB table of the MIB tree, and the last instance of the first MIB table is the last instance of the current MIB table;
any one of the continuous N instances after the instance specified by the GetBulk request message corresponds to the first instance of the first node of the current MIB table, and N is more than or equal to 2.
On the basis of the above technical solution, the object identifier carried by the request packet corresponds to a leaf node of the MIB tree, the leaf node belongs to the second MIB table, and no instance exists in the leaf node.
On the basis of the above technical solution, the object identifier carried by the request packet corresponds to an intermediate node of the MIB tree, the intermediate node includes at least one third MIB table, and the first third MIB table of the intermediate node is the current MIB table.
On the basis of the technical scheme, when the SNMP agent is based on a Net-SNMP framework, the current MIB table is a subtree structure which comprises at least one fourth MIB table, and all leaf nodes of each fourth MIB table are bound with the same findVar callback function;
if there is no instance for the current leaf node and the findVar callback function for the current leaf node is the same as the findVar callback function for the last leaf node, the SNMP agent skips the current MIB table.
The invention also provides a traversal method of the MIB tree, which comprises the following steps:
the SNMP agent receives a request message of GetNext or GetBulk of a managed object in the MIB from the NMS;
the SNMP agent uses the simple network management protocol agent query method of claim 1 to search and returns the search result;
and repeating the steps until the MIB tree is traversed.
The invention also provides a query system of the simple network management protocol agent, which is arranged in the SNMP agent, and the system comprises:
a receiving module, which is used for receiving a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS;
and the query module is used for searching according to the request message, skipping the current MIB table when no instance exists in the current MIB table searched by the SNMP agent, starting searching from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes.
On the basis of the technical scheme, when the SNMP agent is implemented based on a Net-SNMP framework, the current MIB table is a subtree structure which comprises at least one fourth MIB table, and all leaf nodes of each fourth MIB table are bound with the same findVar callback function;
and the query module is used for skipping the current MIB table under the condition that no instance exists in the current leaf node and the findVar callback function of the current leaf node is the same as the findVar callback function of the last leaf node.
Compared with the prior art, the invention has the advantages that: the method can reduce the processing algorithm overhead of the SNMP agent to GetNext and GetBulk requests, and improve the response speed of the network equipment to GetNext and GetBulk requests.
Drawings
Fig. 1 is a flowchart of a query method of a simple network management protocol proxy according to a first embodiment of the present invention;
fig. 2 is a schematic diagram of an inquiry system of a simple network management protocol proxy according to an eighth embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the figures and the embodiments.
Referring to fig. 1, a first embodiment of the present invention provides a method for querying a simple network management protocol proxy, where the method includes the following steps:
s110, the SNMP agent receives a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS.
And S120, when the current MIB table searched by the SNMP agent does not have an instance, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes.
Some MIB nodes include MIB tables, one corresponding to a class of objects, which may contain instances of the object, and columns (leaf nodes) of the MIB tables corresponding to attributes of such objects. That is, the MIB table is described by rows and columns, where the head of a column is the object identifier of a leaf node and the head of a row is an index. The object identifier and index value of the leaf node uniquely identify an instance in the MIB table. The OIDs for this example are: the column OID + index. For example, referring to table 1, a certain MIB node includes the following 3 MIB tables, where MIB table 2 is the next MIB table of MIB table 1 and MIB table 3 is the next MIB table of MIB table 2 in the MIB tree. MIB table 1 includes leaf node 1 and leaf node 2, and leaf node 1 and leaf node 2 each include 3 indexes, i.e., leaf node 1 and leaf node 2 each include 3 instances. MIB table 2 includes leaf node 3 and leaf node 4, but without any index and corresponding instance. MIB table 3 includes leaf node 5, and leaf node 5 includes 1 index, corresponding to 1 instance.
Table 1:
when the SNMP agent receives the GetNext request message, the object identifier of the request message is firstly analyzed, then the appointed instance is found in the MIB database according to the object identifier, and finally the value of the next instance of the instance corresponding to the object identifier is obtained and returned to the NMS. The instance corresponding to the object identifier carried by the request message of GetNext is the last instance of the current MIB table.
When the SNMP agent receives the request message of GetBulk, the object identifier of the request message is firstly analyzed, then the appointed instance is found in the MIB database according to the object identifier, and finally the numerical values of N next instances of the appointed instance are obtained and returned to the NMS. Since the getbull operation is an extension of the GetNext operation in the SNMPv2 version, it can be considered to perform N iterations of GetNext in one operation. In any iteration process, the corresponding instance of the object identifier carried by the request message of the GetBulk is any one of the continuous N instances before the current MIB table, and N is more than or equal to 2.
If there are no instances in the current MIB table, there will be no valid instances for each node of this table. That is, when the first instance of a certain leaf node of a certain MIB table fails to be searched, all subsequent leaf nodes of the MIB table can be skipped to directly process the first leaf node of the next MIB table, so that the aim of saving algorithm overhead is achieved, processing algorithm overhead of the SNMP agent for GetNext and getblock requests can be reduced, and response speed of the network device for GetNext and getblock requests is improved.
Taking the GetNext request message and table 1 as an example to specifically illustrate, if the MIB table 2 in table 1 is the current MIB table, and the first instance of the leaf node 3 in the MIB table 2 fails to be searched, the leaf node 4 in the MIB table 2 may be skipped, the leaf node 5 in the MIB table 3 may be directly processed, and the 1 st instance of the leaf node 5 in the MIB table 3 is returned.
The second embodiment of the present invention provides a query method for a simple network management protocol agent, which comprises the following steps:
s210, the SNMP agent receives a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS.
S220, when the SNMP agent receives a GetNext or GetBulk request message, analyzing an object identifier of the request message, judging that an instance corresponding to the object identifier carried by the request message is a scalar node of the MIB tree, and if the scalar node is adjacent to the current MIB table, searching in the current MIB table by the SNMP agent.
And S230, when the current MIB table searched by the SNMP agent does not have an instance, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes.
The third embodiment of the present invention provides a query method for a simple network management protocol agent, which comprises the following steps:
s310, the SNMP agent receives a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS.
S320, when the SNMP agent receives a GetNext or GetBulk request message, analyzing an object identifier of the request message, judging that the corresponding example of the object identifier carried by the request message is the last example of a first MIB table of the MIB tree, and the last example of the first MIB table is the last example of the current MIB table, and searching in the current MIB table by the SNMP agent.
S330, when the current MIB table searched by the SNMP agent does not have an instance, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes.
The fourth embodiment of the present invention provides a query method for a simple network management protocol agent, which comprises the following steps:
s410, the SNMP agent receives a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS.
S420, when the SNMP agent receives a request message of GetNext or GetBulk, analyzing an object identifier of the request message, and judging that the object identifier carried by the request message corresponds to a leaf node of the MIB tree, wherein the leaf node belongs to a second MIB table, no instance exists in the leaf node, and the next instance of the second MIB table corresponds to the first instance of the first node of the current MIB table.
Also taking table 1 as an example, if the second leaf node is the leaf node 3 of the MIB table 2, and the index of the first instance of the leaf node 3 of the MIB table 2 fails to be searched, the leaf node 4 of the MIB table 2 may be skipped, the leaf node 5 of the MIB table 3 may be directly processed, and the 1 st instance of the leaf node 5 of the MIB table 3 may be returned.
And S430, when the current MIB table searched by the SNMP agent does not have an instance, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table, and returning a search result, wherein the current MIB table comprises at least two leaf nodes.
A fifth embodiment of the present invention provides a method for querying a simple network management protocol proxy, where the method includes the following steps:
s510, the SNMP agent receives a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS.
S520, when the SNMP agent receives a request message of GetNext or GetBulk, the object identifier of the request message is analyzed, the object identifier carried by the request message is judged to correspond to an intermediate node of the MIB tree, the intermediate node comprises at least one third MIB table, and the first third MIB table of the intermediate node is the current MIB table.
S530, when the current MIB table searched by the SNMP agent does not have an instance, skipping the current MIB table, starting to search from the first node of the next MIB table of the current MIB table until the MIB tree is traversed, wherein the current MIB table comprises at least two leaf nodes.
A sixth embodiment of the present invention provides a method for querying a simple network management protocol agent, where when an SNMP agent is based on a Net-SNMP framework, a current MIB table is a subtree structure, the subtree structure includes at least one fourth MIB table, and all leaf nodes of each fourth MIB table are bound with the same findVar callback function.
If there is no instance for the current leaf node and the findVar callback function for the current leaf node is the same as the findVar callback function for the last leaf node, then the SNMP agent skips the current MIB table.
Specifically, the subtree structure may include a plurality of MIB tables, and all leaf nodes of each MIB table may be bound to the same findVar callback function, and all MIB tables of the subtree structure may be bound to the same findVar callback function, and the findVar callback functions of all MIB tables may be different.
The UCD-SNMP software package was derived from the SNMP software package CMU SNMP 2.1.2.1 of the University of kangsi melong, developed and maintained by the University of california at Davis, the UCD-SNMP project was shifted to be managed by SourceForge (www.sourceforge.net) in month 11 of 2000 and is more commonly known as Net-SNMP, a SNMP code framework that is now very popular. In the code framework, each node will bind a findVar callback, according to different input parameters, the function of the first/next valid instance of the node is realized, and the return of NULL indicates that the search fails. The specific process comprises the following steps:
(1) by comparing the input parameter and the return value of the last call findVar in the cycle, whether the failure of searching the first instance index of the leaf node occurs can be judged.
(2) The Net-SNMP code framework is realized without the concept of MIB tables, and adjacent MIB tables are combined into a subtree structure according to a certain rule, so that the first leaf node of the next table cannot be directly searched. Usually, all nodes in the same MIB table will bind the same findVar callback, and when traversing the MIB tree, comparing whether the findVar callback of the current leaf node and the findVar callback of the last leaf node are the same, it can be determined whether the two leaf nodes belong to the same table, if so, the two leaf nodes are skipped over directly.
On the basis of the above embodiments, a seventh embodiment of the present invention further provides a traversal method for an MIB tree, where the traversal method includes the following steps:
the SNMP agent receives a request message of GetNext or GetBulk of the managed object in the MIB from the NMS.
The SNMP agent performs a lookup using the simple network management protocol agent's lookup method of claim 1 and returns a lookup result. For the GetNext request message, the finder specifies the next instance of the instance, and for the GetBulk request message, the finder specifies N consecutive instances behind the instance, wherein N is more than or equal to 2.
And repeating the steps until the MIB tree is traversed.
An eighth embodiment of the present invention provides a query system for a simple network management protocol agent, which is disposed in an SNMP agent, and as shown in fig. 2, the system includes a receiving module and a query module.
The receiving module is used for receiving a request message of GetNext or GetBulk of a managed object in the management information base MIB from the network management system NMS.
And the query module is used for searching according to the request message, wherein when the current MIB table searched by the SNMP agent does not have an instance, the current MIB table is skipped over, searching is started from the first node of the next MIB table of the current MIB table, and a search result is returned, wherein the current MIB table comprises at least two leaf nodes.
When receiving GetNext or GetBulk request message, the receiving module analyzes the object identifier of the request message, and the query module finds the appointed instance in the MIB database according to the object identifier, obtains the value of the next instance of the appointed instance, and returns the value to the NMS.
An example corresponding to an object identifier carried by a GetNext request message is a last example of a current MIB table; the corresponding instance of the object identifier carried by the request message of the GetBulk is any one of continuous N instances before the current MIB table, and N is more than or equal to 2. For example, the instance corresponding to the object identifier carried in the request packet of GetNext is a scalar node of the MIB tree. Or, the instance corresponding to the object identifier carried by the request message is the last instance of the first MIB table of the MIB tree, and the last instance of the first MIB table is the last instance of the current MIB table. Or the object identifier carried by the request message corresponds to a leaf node of the MIB tree, the leaf node belongs to the second MIB table, and no instance exists in the leaf node. Or, the object identifier carried by the request packet corresponds to an intermediate node of the MIB tree, where the intermediate node includes at least one MIB table, and a first MIB table of the intermediate node is a current MIB table.
On the basis of the eighth embodiment of the present invention, a ninth embodiment of the present invention provides a query system for a simple network management protocol agent, wherein when an SNMP agent is implemented based on a Net-SNMP framework, a current MIB table is a subtree structure, the subtree structure includes at least one fourth MIB table, and all leaf nodes of each fourth MIB table are bound with the same findVar callback function.
The query module is used for skipping the current MIB table under the condition that no instance exists in the current leaf node and the findVar callback function of the current leaf node is the same as the findVar callback function of the last leaf node.
The present invention is not limited to the above-described embodiments, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements are also considered to be within the scope of the present invention. Those not described in detail in this specification are within the skill of the art.
Claims (8)
1. A query method of a simple network management protocol agent is characterized by comprising the following steps:
a Simple Network Management Protocol (SNMP) agent receives a request message of a Network Management System (NMS) for GetNext or GetBulk of a managed object in a Management Information Base (MIB);
when the SNMP agent is implemented based on a Net-SNMP framework, a current MIB table searched by the SNMP agent is a subtree structure, the current MIB table comprises at least two leaf nodes, the subtree structure comprises at least one fourth MIB table, and all the leaf nodes of each fourth MIB table are bound with the same findVar callback function;
if the current leaf node has no instance and the findVar callback function of the current leaf node is the same as the findVar callback function of the previous leaf node, the SNMP agent skips the current MIB table, starts searching from the first leaf node of the next MIB table of the current MIB table, and returns the search result.
2. The query method of the simple network management protocol proxy of claim 1, wherein: an instance corresponding to the object identifier carried by the request message of the GetNext is a last instance of the current MIB table;
the corresponding instance of the object identifier carried by the GetBulk request message is any one of continuous N instances before the current MIB table, and N is more than or equal to 2.
3. The query method of the simple network management protocol proxy of claim 2, wherein: the corresponding instance of the object identifier carried by the request message is a scalar node of the MIB tree.
4. The query method of the simple network management protocol proxy of claim 2, wherein: the instance corresponding to the object identifier carried by the request message is the last instance of the first MIB table of the MIB tree, and the last instance of the first MIB table is the last instance of the current MIB table.
5. The query method of the simple network management protocol proxy of claim 1, wherein: the object identifier carried by the request message corresponds to a leaf node of the MIB tree, the leaf node belongs to the second MIB table, and no instance exists in the leaf node.
6. The query method of the simple network management protocol proxy of claim 1, wherein: the object identifier carried by the request message corresponds to an intermediate node of the MIB tree, the intermediate node includes at least one third MIB table, and the first third MIB table of the intermediate node is the current MIB table.
7. A method for traversing MIB tree is characterized by comprising the following steps:
the SNMP agent receives a request message of GetNext or GetBulk of a managed object in the MIB from the NMS;
the SNMP agent uses the simple network management protocol agent query method of claim 1 to search and returns the search result;
and repeating the steps until the MIB tree is traversed.
8. A query system of a simple network management protocol agent, which is arranged in an SNMP agent, is characterized in that the system comprises:
a receiving module, which is used for receiving a request message of GetNext or GetBulk of a managed object in a management information base MIB from a network management system NMS;
a query module, configured to perform a lookup according to the request packet, and configured to:
when the SNMP agent is implemented based on a Net-SNMP framework, a current MIB table searched by the SNMP agent is a subtree structure, the current MIB table comprises at least two leaf nodes, the subtree structure comprises at least one fourth MIB table, and all the leaf nodes of each fourth MIB table are bound with the same findVar callback function;
and if the current leaf node has no instance and the findVar callback function of the current leaf node is the same as the findVar callback function of the previous leaf node, skipping the current MIB table, starting searching from the first leaf node of the next MIB table of the current MIB table, and returning the searching result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810273481.1A CN108616385B (en) | 2018-03-29 | 2018-03-29 | Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810273481.1A CN108616385B (en) | 2018-03-29 | 2018-03-29 | Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108616385A CN108616385A (en) | 2018-10-02 |
| CN108616385B true CN108616385B (en) | 2021-03-16 |
Family
ID=63659216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810273481.1A Active CN108616385B (en) | 2018-03-29 | 2018-03-29 | Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108616385B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112069221A (en) * | 2020-09-01 | 2020-12-11 | 上海华讯网络系统有限公司 | SNMP structured query method, system and medium |
| CN115442201B (en) * | 2022-08-09 | 2023-06-23 | 武汉烽火技术服务有限公司 | Method and equipment for dynamically collecting EMS data based on SNMP agent |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1753402A (en) * | 2004-09-22 | 2006-03-29 | 中兴通讯股份有限公司 | Method of using simple network management protocol to act multirariant block inquiry |
| CN102014407A (en) * | 2010-12-10 | 2011-04-13 | 北京交通大学 | Simple network management protocol (SNMP)-based wireless sensor network domain authorized proxy management mechanism |
| WO2015043666A1 (en) * | 2013-09-27 | 2015-04-02 | Telefonaktiebolaget L M Ericsson (Publ) | Providing network management information in a communications network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2584774A2 (en) * | 2011-10-20 | 2013-04-24 | Samsung Electronics Co., Ltd. | Image forming apparatus, management system for managing the image forming apparatus, and information providing method of the image forming apparatus |
| CN105512134A (en) * | 2014-09-25 | 2016-04-20 | 中兴通讯股份有限公司 | Method and system for querying data based on SNMP protocol |
-
2018
- 2018-03-29 CN CN201810273481.1A patent/CN108616385B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1753402A (en) * | 2004-09-22 | 2006-03-29 | 中兴通讯股份有限公司 | Method of using simple network management protocol to act multirariant block inquiry |
| CN102014407A (en) * | 2010-12-10 | 2011-04-13 | 北京交通大学 | Simple network management protocol (SNMP)-based wireless sensor network domain authorized proxy management mechanism |
| WO2015043666A1 (en) * | 2013-09-27 | 2015-04-02 | Telefonaktiebolaget L M Ericsson (Publ) | Providing network management information in a communications network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108616385A (en) | 2018-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20060085532A1 (en) | Remote management of communication devices | |
| CN102480759B (en) | Network-management realizing method and system on basis of fit wireless access point architecture | |
| US8667113B2 (en) | Bitmap network management object change detection approach | |
| JPH06309257A (en) | System and method for monitoring and maintaining snmp table | |
| US8589589B2 (en) | Method and system for creating an overlay structure for management information bases | |
| CN101133412A (en) | Maintaining and distributing relevant routing information base updates to subscribing clients in a device | |
| US20160127197A1 (en) | Network discovery optimization using supplemental information published by devices | |
| CN108616385B (en) | Query method of Simple Network Management Protocol (SNMP) agent, traversal method and system of Management Information Base (MIB) tree | |
| CN102945249A (en) | Policy rule matching query tree generating method, matching method and device | |
| CN101035133B (en) | Network management method, system and device | |
| US10826750B2 (en) | Patricia trie for simple network management protocol management information base operations | |
| CN107679107B (en) | Graph database-based power grid equipment reachability query method and system | |
| US20130046888A1 (en) | Method and device for managing devices in device management system | |
| Breitgand et al. | SNMP GetPrev: An efficient way to browse large MIB tables | |
| US8190723B2 (en) | Method and system for automatically determining commands for a network element | |
| CN115314419B (en) | Cloud network-oriented self-adaptive connectivity analysis method, system, equipment and storage medium | |
| CA2987316A1 (en) | Local object instance discovery for metric collection on network elements | |
| RU2569573C1 (en) | Method and apparatus for forming peer-to-peer service | |
| CN106254122B (en) | Simple network management protocol agent implementation method based on EOC equipment | |
| CN109510728B (en) | Method for automatically converting MIB file of network management information base into XML file | |
| CN110855803B (en) | Data acquisition method and device | |
| EP3793171B1 (en) | Message processing method, apparatus, and system | |
| CN103577560B (en) | Method and device for inputting data base operating instructions | |
| CN113286013B (en) | Subnet matching method and device | |
| Uddin et al. | A bottom-Up approach to real-time search in large networks and clouds |
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 |