Patent US4804883A successfully refreshed from Google Patents.
Patent CA537181A successfully refreshed from Google Patents.
Patent US6766367B1 successfully refreshed from Google Patents.
US6766367B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for fetching sparsely indexed MIB tables in managed network systems
Assignee: HP Inc
•
Filing: 2000-02-08
•
Granted: 2004-07-20
•
Expires: 2020-02-08
Abstract
Abstract A method for fetching sparsely indexed MIB tables for a managed network device using an approximation operation, such as a GetNext SNMP operation, comprises sending a plurality of operations in a first data packet at least one of the plurality of approximation operations specifying a speculative approximation. By using speculative approximations of index values of data to be fetched, it is possible to retrieve MIB table data more quickly and efficiently.
Inventors
- 👤 David James Stevenson
- 👤 Andrew Hunter Gray
- 👤 Robert James Duncan
- 👤 Alastair Hugh Chisholm
- 👤 Vanessa Serra
- 👤 Colin Tinto
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 16:37
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/02; H04L41/0213
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
114 words
A method for fetching sparsely indexed data for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always greater than, the index value specified in the approximation operation, the method comprising: sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying a speculative index value.
Claim 2
Independent Claim
114 words
A method for fetching sparsely indexed data for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always greater than, the index value specified in the approximation operation, the method comprising: sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying a speculative index value.
Claim 3
Dependent Claim
56 words
A method as claimed in claim 1 , wherein a first of the plurality of approximation operations in the first data packet specifies the data object without an index value, for retrieval of a data object instance at a lowest index value, and the other ones of the plurality of approximation operations specify speculative index values.
Claim 4
Dependent Claim
41 words
A method as claimed in claim 1 , whereby the data packet format has a predetermined maximum size for operations and the plurality of approximation operations comprise up to the maximum number of approximation operations possible in the data packet size.
Claim 5
Dependent Claim
23 words
A method as claimed in claim 1 , whereby one or more speculative index values in the first data packet comprise calculated values.
Claim 6
Dependent Claim
65 words
A method as claimed in claim 4 , wherein the calculated values are determined using the equation: value n =( n −1) (max index/max varbind) where n is an integer greater than or equal to 2, max index is the maximum number for the index value for the data object, and max varbind is the maximum number of operations possible in the data packet size.
Claim 7
Dependent Claim
38 words
A method as claimed in claim 1 , whereby the speculative index values are determined based on index values of sparsely indexed data obtained during a previous retrieval of the data for said at least one data object.
Claim 8
Dependent Claim
70 words
A method as claimed in claim 1 , further comprising: receiving data in response to said plurality of approximation operations; determining whether all the indexed data for said at least one object are present in the received data, and if not, sending one or more approximation operations in a second data packet, at least one of the one or more approximation operations specifying an index value of said received data.
Claim 9
Dependent Claim
51 words
A method as claimed in claim 7 , in which a plurality of approximation operations are included in said second data packet, one or more of said approximation operations in said second data packet specifying index values of said received data and the other approximation operations specifying further speculative index values.
Claim 10
Dependent Claim
17 words
A method as claimed in claim 8 , whereby the further speculative index values comprise calculated values.
Claim 11
Dependent Claim
39 words
A method as claimed in claim 8 , whereby the further speculative index values are determined based on index values of sparsely indexed data obtained during a previous retrieval of the data for said at least one data object.
Claim 12
Dependent Claim
101 words
A method as claimed in claim 1 , further comprising: receiving data in response to said plurality of approximation operations; comparing index values of the received data with the index values of data obtained during a previous retrieval of the data for said at least one object; if the comparison determines a difference between the index values of the received data and the index values of data obtained during said previous retrieval, considering whether additional approximation operations are required to retrieve possible additional data, and if so including approximation operations to retrieve the possible additional data in a second data packet.
Claim 13
Dependent Claim
57 words
A method as claimed in claim 11 , in which said step of considering whether additional approximation operations are required comprises: considering whether the difference is due to deletion of data at an expected index value, which expected index value was present in said previous retrieval, and if so determining that no additional approximation operations are required.
Claim 14
Dependent Claim
92 words
A method as claimed in claim 12 , in which said step of considering whether additional approximation operations are required comprises: considering whether the difference is due to addition of data at a new index value, and if so considering if an expected index value greater than the new index value, which expected index value was present in said previous retrieval, is present in the index values of the received data values, and if not including an approximation operation to retrieve data at said expected index value in a second data packet.
Claim 15
Dependent Claim
31 words
A method as claimed in claim 13 , in which the approximation operation to retrieve data at the expected index value in a second data packet specifies the new index value.
Claim 16
Dependent Claim
92 words
A method as claimed in claim 11 , in which said step of considering whether additional approximation operations are required comprises: considering whether the difference is due to addition of data at a new index value, and if so considering if an expected index value greater than the new index value, which expected index value was present in said previous retrieval, is present in the index values of the received data values, and if not including an approximation operation to retrieve data at said expected index value in a second data packet.
Claim 17
Dependent Claim
31 words
A method as claimed in claim 15 , in which the approximation operation to retrieve data at the expected index value in a second data packet specifies the new index value.
Claim 18
Dependent Claim
37 words
A method as claimed in claim 1 , further comprising receiving a response to said plurality of approximation operations in said first data packet and storing the index values of data, received in said response, in memory.
Claim 19
Dependent Claim
125 words
A computer readable medium containing a computer program for carrying out a method for fetching sparsely indexed data for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always greater than, the index value specified in the approximation operation, the method comprising sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying a speculative index value.
Claim 20
Dependent Claim
125 words
A computer readable medium containing a computer program for carrying out a method for fetching sparsely indexed data for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always greater than, the index value specified in the approximation operation, the method comprising sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying a speculative index value.
Claim 21
Dependent Claim
138 words
A computer program on a computer readable medium for fetching sparsely indexed data, for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always greater than, the index value specified in the approximation operation, the program comprising: program means for creating a set of speculative index values; and program means for sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying one of said set of speculative index values.
Claim 22
Dependent Claim
138 words
A computer program on a computer readable medium for fetching sparsely indexed data, for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always greater than, the index value specified in the approximation operation, the program comprising: program means for creating a set of speculative index values; and program means for sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying one of said set of speculative index values.
Claim 23
Independent Claim
114 words
A method for fetching sparsely indexed data for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always less than, the index value specified in the approximation operation, the method comprising: sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying a speculative index value.
Claim 24
Independent Claim
114 words
A method for fetching sparsely indexed data for a data object in a data communications system using a communications protocol which defines a data packet format and an approximation operation, the approximation operation specifying a data object and an index value, whereby the approximation operation retrieves an instance of the specified data object at a closest available index value to, and which is always less than, the index value specified in the approximation operation, the method comprising: sending a plurality of approximation operations in a first data packet, each one of the plurality of approximation operations specifying the data object, at least one of the plurality of approximation operations specifying a speculative index value.
References Cited (Backward Citations)
EP0621705A2
Cited
US6032183A
Cited
EP0621706A2
Cited
US6439783B1
Cited
US6122626A
Cited
US5978850A
Cited
US6134541A
Cited
US6446079B2
Cited
US6009431A
Cited
US6519635B1
Cited
US6317748B1
Cited
US6484175B1
Cited
US6360258B1
Cited
US6539540B1
Cited
US6631406B1
Cited
US6671722B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-07-20 | 2008-01-19 | 2008-07-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-07-20 | 2012-01-19 | 2012-07-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-07-20 | 2016-01-19 | 2016-07-20 | $7700.00 | Window Closed / Lapsed |