← Back to Patent Explorer
US6061723A Expired / Lapsed US ⏱️ 0.0 years remaining

Network management event correlation in environments containing inoperative network elements

Assignee: Hewlett Packard Enterprise Development LP
•
Filing: 1997-10-08
•
Granted: 2000-05-09
•
Expires: 2017-10-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A network monitor for distinguishing between broken and inaccessible network elements. The network monitor includes one or more computer readable storage mediums, and computer readable program code stored in the one or more computer readable storage mediums. The computer readable program code includes code for discovering the topology of a plurality of network elements, code for periodically polling a plurality of network interfaces associated with the plurality of network elements, code for computing or validating a criticalRoute attribute for each of the plurality of network interfaces, and code for analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll or ping. The computer readable program code may also include code for establishing a slowPingList and placing in-memory representations of broken or failed network interfaces thereon, thereby reducing the amount of information which is presented to a network administrator from inaccessible elements not responding to a network interface poll. A means for correlating and/or suppressing events in response to the determination of whether a network interface is failed or broken is also provided. Information which is not critical to a network administrator may be suppressed, and then viewed in a "drill down" of a particular network interface.

Inventors

  • 👤 Anthony Walker
  • 👤 Eric A. Pulsipher
  • 👤 Darren D. Smith

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 02:25
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/06; H04L41/0631; H04L41/12; H04L41/22; H04L43/00; H04L43/08; H04L43/0805; H04L43/0811; H04L43/0817; H04L43/10

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 116 words
A network monitor for distinguishing between broken and inaccessible network elements, comprising: a) one or more computer readable storage mediums; and b) computer readable program code stored in the one or more computer readable storage mediums, the computer readable program code comprising: i) code for discovering the topology of a plurality of network elements; ii) code for periodically polling a plurality of network interfaces associated with the plurality of network elements; iii) code for computing or validating a criticalRoute attribute for each of the plurality of network interfaces; and iv) code for analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll.
Claim 2
Dependent Claim 116 words
A network monitor for distinguishing between broken and inaccessible network elements, comprising: a) one or more computer readable storage mediums; and b) computer readable program code stored in the one or more computer readable storage mediums, the computer readable program code comprising: i) code for discovering the topology of a plurality of network elements; ii) code for periodically polling a plurality of network interfaces associated with the plurality of network elements; iii) code for computing or validating a criticalRoute attribute for each of the plurality of network interfaces; and iv) code for analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll.
Claim 3
Dependent Claim 40 words
A network monitor as in claim 1, wherein the code for computing a criticalRoute attribute for a particular network interface of a network element comprises code for identifying a route taken by a packet used to poll the particular interface.
Claim 4
Dependent Claim 25 words
A network monitor as in claim 1, further comprising code for establishing a slowPingList and placing in-memory representations of broken or failed network interfaces thereon.
Claim 5
Dependent Claim 129 words
Network management apparatus for distinguishing between broken and inaccessible network elements, and for presenting this information to a network administrator in an easy to comprehend format, comprising: a) a display process; and b) a network monitor comprising: i) means for discovering the topology of a plurality of network elements connected thereto; ii) means for periodically polling a plurality of network interfaces associated with the plurality of network elements; iii) means for computing or validating a criticalRoute attribute for each of the plurality of network interfaces; and iv) means for analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll; wherein the display process and network monitor communicate by way of one or more event buses.
Claim 6
Dependent Claim 129 words
Network management apparatus for distinguishing between broken and inaccessible network elements, and for presenting this information to a network administrator in an easy to comprehend format, comprising: a) a display process; and b) a network monitor comprising: i) means for discovering the topology of a plurality of network elements connected thereto; ii) means for periodically polling a plurality of network interfaces associated with the plurality of network elements; iii) means for computing or validating a criticalRoute attribute for each of the plurality of network interfaces; and iv) means for analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll; wherein the display process and network monitor communicate by way of one or more event buses.
Claim 7
Dependent Claim 38 words
Network management apparatus as in claim 4, further comprising: an event correlation system; wherein the one or more event buses comprise a correlated event bus; and wherein the display process receives event data over the correlated event bus.
Claim 8
Dependent Claim 41 words
Network management apparatus as in claim 5, wherein: a) the system further comprises an annotation server; b) the event correlation system comprises an annotation node; and c) the annotation server and the annotation node communicate by way of a communication channel.
Claim 9
Dependent Claim 63 words
Network management apparatus as in claim 6, wherein the annotation server is configured to process the following annotation information: a) an annotation providing for critical node recognition; b) an annotation indicating how critical node secondaryFailures should be processed and displayed; c) an annotation indicating how regular node secondaryFailures should be processed and displayed; and d) an annotation providing for regular node secondaryFailure suppression.
Claim 10
Dependent Claim 18 words
Network management apparatus as in claim 6, wherein the annotation server comprises a portion of the network monitor.
Claim 11
Dependent Claim 50 words
Network management apparatus as in claim 5, wherein: a) the event correlation system comprises a means for suppressing events so they do not appear on the correlated events bus; and b) the display process comprises a drill down interface through which various suppressed events may be called up for viewing.
Claim 12
Dependent Claim 97 words
A computer implemented method of distinguishing between broken and inaccessible network elements, and for presenting this information to a network administrator in an easy to comprehend format, comprising the steps of: a) discovering the topology of a plurality of network elements; b) periodically polling a plurality of network interfaces associated with the plurality of network elements; c) computing or validating a criticalRoute attribute for each of the plurality of network interfaces; and d) analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll.
Claim 13
Dependent Claim 97 words
A computer implemented method of distinguishing between broken and inaccessible network elements, and for presenting this information to a network administrator in an easy to comprehend format, comprising the steps of: a) discovering the topology of a plurality of network elements; b) periodically polling a plurality of network interfaces associated with the plurality of network elements; c) computing or validating a criticalRoute attribute for each of the plurality of network interfaces; and d) analyzing a status of network interfaces identified by the criticalRoute attribute of an interface in question (IIQ) which is not responding to a poll.
Claim 14
Dependent Claim 152 words
A method as in claim 10, wherein the step of analyzing the status of network interfaces identified by the criticalRoute attribute of an IIQ which is not responding to a poll comprises the steps of: a) first examining in-memory statuses of one or more network interfaces to determine whether a network interface identified by the criticalRoute attribute for the IIQ is Down, and if so, identifying that network interface as a primaryFailure interface; b) second, if a network interface identified by the criticalRoute attribute for the IIQ has not been identified as a primaryFailure interface, verifying the statuses of one or more network interfaces identified by the criticalRoute attribute for the IIQ to determine if one of them is a primaryFailure interface; and c) third, if a network interface identified by the criticalRoute attribute for the IIQ has not been identified as a primaryFailure interface, identifying the IIQ as a primaryFailure interface.
Claim 15
Dependent Claim 65 words
A method as in claim 11, wherein the steps of examining in-memory statuses of one or more network interfaces, and verifying the statuses of one or more network interfaces, each comprise the step of examining or verifying network interfaces identified by the criticalRoute attribute for the IIQ: a) one at a time; and b) beginning with a network interface closest to a network monitor's interface.
Claim 16
Dependent Claim 99 words
A method as in claim 10, further comprising the step of maintaining a criticalRouteWaitList, wherein a pre-criticalRouteWaitList algorithm comprises the steps of: a) examining in-memory statuses of one or more network interfaces to determine whether a network interface identified by the criticalRoute attribute for the IIQ is Down, and if so, identifying that network interface as a primaryFailure interface; and b) if the above step successfully identifies a network interface as a primaryFailure interface, i) identifying the IIQ as a secondaryFailure interface; ii) emitting a secondaryFailurelnterfaceDown event; and iii) placing an in-memory representation of the IIQ on a slowPingList.
Claim 17
Dependent Claim 45 words
A method as in claim 13, further comprising the step of, if the step of examining in-memory statuses of one or more network interfaces successfully identifies a network interface as a primaryFailure interface, changing the status of the IIQ to Unknown in a topology database.
Claim 18
Dependent Claim 148 words
A method as in claim 13, wherein a criticalRouteWaitList algorithm comprises the steps of: a) if none of the network interfaces identified by the criticalRoute attribute for the IIQ have been identified as a primaryFailure interface, verifying the statuses of one or more network interfaces identified by the criticalRoute attribute for the IIQ by, i) moving an in-memory representation of the IIQ, and all network interfaces identified by the criticalRoute attribute for the IIQ, to a criticalRouteWaitList, and removing these network interfaces from all other lists accessible to a network monitor executing this method; ii) sequentially walking the criticalRouteWaitList, polling each network interface to determine if it is a primaryFailure interface; and b) if a network interface identified by the criticalRoute attribute for the IIQ has not been identified as a primaryFailure interface, identifying the IIQ as a primaryFailure interface, otherwise identifying the IIQ as a secondaryFailure interface.
Claim 19
Dependent Claim 53 words
A method as in claim 15, further comprising the steps of, after a primaryFailure interface has been identified: a) changing the status of the primaryFailure interface to Critical in a topology database; b) emitting a primaryFailurelnterfaceDown event; and c) moving the in-memory representation of the primaryFailure interface from the criticalRouteWaitList to the slowPingList.
Claim 20
Dependent Claim 57 words
A method as in claim 15, further comprising the steps of, if the step of verifying statuses of one or more network interfaces successfully identifies a network interface as a primaryFailure interface, a) identifying the IIQ as a secondaryFailure interface; b) emitting a secondaryFailurelnterfaceDown event; and c) moving the in-memory representation of the IIQ to the slowPingList.
Claim 21
Dependent Claim 31 words
A method as in claim 10, wherein the step of computing a criticalRoute attribute for a particular interface of a network node comprises giving preference to a route comprising router nodes.
Claim 22
Dependent Claim 28 words
A method as in claim 10, further comprising the step of using an IIQ's criticalRoute attribute to identify an IIQ as a primaryFailure interface or a secondaryFailure interface.
Claim 23
Dependent Claim 21 words
A method as in claim 19, further comprising the step of assigning a UUID var-bind to primaryFailure interfaces and secondaryFailure interfaces.
Claim 24
Dependent Claim 50 words
A method as in claim 20, wherein the step of assigning a UUID var-bind to a particular secondaryFailure interface comprises the steps of: a) looking up a corresponding primaryFailure interface UUID var-bind; and b) including the corresponding primaryFailure interface UUID var-bind in a UUID var-bind for the particular secondaryFailure interface.

References Cited (Backward Citations)

US5027269A Cited
US5027342A Cited
US5185860A Cited
US5276789A Cited
US5511108A Cited
US5533093A Cited
US5805578A Cited
US5848243A Cited
US5872911A Cited
US5751965A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-05-09 2003-11-08 2004-05-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-05-09 2007-11-08 2008-05-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-05-09 2011-11-08 2012-05-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag