Canonical Name Data Retrieval for Hierarchical Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data retrieval methods in broadband networks, such as those using SNMP, rely on Management Information Bases (MIBs) which can be cumbersome and require constant updates, limiting their effectiveness in retrieving data without a pre-defined structure.
Innovation Solution
A data retrieval method utilizing a canonical name-based approach with a hierarchical tree structure, allowing for generic requests and real-time or statistical data retrieval, independent of MIBs, by defining a data exchange interface and implementing a data retrieval routine that generates commands to retrieve data from network elements, with time-stamping for accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If SNMP with MIBs is used for data retrieval, then structured management data can be obtained, but the system requires constant MIB updates and has limited effectiveness for data without pre-defined structures
Solution Approach 1:
The patent extracts the rigid MIB structure requirement from the data retrieval process. Instead of requiring data to conform to pre-defined MIB structures, the system retrieves raw data directly from network elements and applies flexible parsing rules, eliminating the constraint that limited effectiveness for undefined data structures
Solution Approach 2:
The patent introduces dynamic adaptability to the data retrieval process. The system can dynamically adjust parsing rules and data structures based on the actual data received from network elements, rather than being constrained by static MIB definitions. This allows the system to handle various data formats and structures without requiring constant MIB updates
2Adaptability or versatility
If MIB-based SNMP retrieval is used, then standardized data access is achieved, but dependency on specific operating system versions and MIB structures increases maintenance requirements
Solution Approach 1:
The patent creates a universal data retrieval interface that can access multiple data sources (network elements, databases, files) using a common protocol. The system uses operating system-independent APIs and standardized data formats, allowing the same retrieval mechanism to work across different platforms without version-specific dependencies
Solution Approach 2:
The patent uses template-based parsing rules that can be copied and adapted for different data types and sources. Instead of maintaining separate MIB structures for each data type, the system uses reusable parsing templates that can be instantiated and modified as needed, reducing maintenance overhead
3Productivity
If hierarchical MIB structures are used, then organized data access is enabled, but real-time and statistical data retrieval becomes less efficient
Solution Approach 1:
The patent performs preliminary data organization at the source. Network elements pre-format data according to standardized schemas before transmission, and the retrieval system pre-compiler parsing rules for anticipated data types. This eliminates the need for complex hierarchical navigation and post-retrieval processing, significantly improving retrieval efficiency
Solution Approach 2:
The patent segments the data retrieval process into independent, parallelizable operations. Instead of traversing hierarchical MIB structures sequentially, the system divides data collection into separate requests for different data types (real-time, statistical, configuration), allowing concurrent retrieval and reducing total processing time
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for retrieving data from a network comprising network elements organised as a multi-level hierarchical tree, each level comprising a set of nodes, the method comprising providing a data exchange interface defining formats for requesting and delivery of types of data to be retrieved; generating a request at the data exchange interface to define the data to be retrieved; using the request to define a canonical name that comprises a series of element names corresponding to at least part of the hierarchical tree containing the network element or elements from which the data is to be retrieved; and a depth indicator indicating the number of levels below the lowest level element name; implementing, at one or more levels in the network, a data retrieval routine that uses the canonical name to generate a command that is issued to the element or elements from which data are to be retrieved to cause the element or elements to return data comprising a description and a value; and communicating the returned data to the data exchange interface in the defined data format.