Alarm reordering to handle alarm storms in large networks

• US 7,902,973 B2
• Filed: 11/17/2008
• Issued: 03/08/2011
• Est. Priority Date: 11/17/2008
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Ribiere, Vincent Jean, Vasseur, Jean-Philippe, Thubert, Pascal, Wetterwald, Patrick
• Primary Examiner(s): Nguyen; Tai T
• Application Number:
  US12/272,476
• Publication Number:
  US 20100123572A1
• Time in Patent Office: 841 Days
• Field of Search: 340/506, 340/521, 340/522, 340/527, 340/540, 340/541, 370/238, 370/392, 370/395.52, 370/400, 370/401
• US Class Current: 340/506
• CPC Class Codes: H04L 41/0681 Configuration of triggering conditions
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/34 Signalling channels for network management communication
• CPC Class Codes: H04L 43/0858 One way delays
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04W 4/90 Services for handling of emergency or hazardous situations, e.g. earthquake and tsunami warning systems [ETWS]
• CPC Class Codes: H04W 76/50 for emergency connections

Abstract

In one embodiment, one or more routing trees may be determined based on corresponding root nodes to reach a particular receiving node in a computer network. A delay value may be calculated at each node of the routing tree, the delay value inversely proportional to a distance between each respective node and the root node of the tree. Upon detecting a trigger at a particular node of the tree to transmit a stormed message to the particular receiving node (e.g., an alarm), the particular node may initiate a timer to count down the delay value in order to receive any upstream node stormed messages prior to expiration of the timer. The particular node may then coalesce the upstream node stormed messages with the stormed message of the particular node, and may transmit the coalesced stormed message downstream along the tree toward the particular receiving node upon expiration of the timer.

Claims

1. A method, comprising:

determining a routing tree based on a root node to reach a particular receiving node in a computer network;

calculating a delay value at each node of the routing tree, the delay value inversely proportional to a distance between each respective node and the root node of the tree;

detecting a trigger at a particular node of the tree to transmit a stormed message to the particular receiving node; and

in response, at the particular node;

initiating a timer to count down the delay value;

receiving all upstream node stormed messages prior to expiration of the timer;

coalescing the upstream node stormed messages with the stormed message of the particular node; and

transmitting the coalesced stormed message downstream along the tree toward the particular receiving node upon expiration of the timer.

2. The method as in claim 1, wherein coalescing further comprises:

correlating similar upstream node stormed messages and the stormed message of the particular node; and

concatenating the similar stormed messages into a single coalesced stormed message of the particular node.

3. The method as in claim 2, further comprising:

transmitting dissimilar stormed messages from upstream nodes downstream along the tree toward the particular receiving node.

4. The method as in claim 2, further comprising:

determining that an upstream node stormed message is reporting the same content as a previous upstream node stormed message; and

, in response,

suppressing the same content from the coalesced stormed message.

5. The method as in claim 4, further comprising:

maintaining any specific content from upstream node stormed messages within the coalesced stormed message.

6. The method as in claim 1, further comprising:

determining a plurality of diverse routing trees based on a plurality of corresponding root nodes to reach the particular receiving node;

calculating the delay value at each node for each routing tree; and

in response to detecting the trigger;

initiating the timer, receiving all upstream node stormed messages, coalescing the upstream node stormed messages, and transmitting the coalesced stormed message for each of the plurality of routing trees.

7. The method as in claim 6, further comprising:

electing the corresponding root nodes of each of the diverse trees.

8. The method as in claim 7, wherein root election is based on a factor selected from a group consisting of:

wireless signal strength between root nodes, policy, manual configuration, and history.

9. The method as in claim 6, further comprising:

determining the diverse trees at a centralized location; and

distributing the diverse trees to each of the nodes of the network.

10. The method as in claim 6, wherein each of the nodes of the network locally determines the diverse trees using a same computational algorithm.

11. The method as in claim 1, wherein the stormed message is an alarm message.

12. The method as in claim 11, wherein the trigger is an event triggering an alarm condition.

13. The method as in claim 1, wherein the stormed message is a response to a network-wide query, and the trigger is receipt of the query.

14. The method as in claim 1, further comprising:

adding a jitter to the delay value.

15. The method as in claim 1, further comprising:

inserting a timestamp into the stormed message corresponding to detection of the trigger.

16. The method as in claim 1, wherein the particular receiving node is an administration node.

17. The method as in claim 1, further comprising:

transmitting stormed messages at a high priority.

18. An apparatus, comprising:

one or more network interfaces adapted to communicate with nodes in a network;

a processor coupled to the network interfaces and adapted to execute one or more processes; and

a memory adapted to store a stormed response process executable by the processor, the stormed response process when executed operable to;

determine a routing tree based on a root node to reach a particular receiving node;

calculate a delay value inversely proportional to a distance between the apparatus and the root node of the tree;

detect a trigger to transmit a stormed message to the particular receiving node; and

in response;

initiate a timer to count down the delay value;

receive all upstream node stormed messages prior to expiration of the timer;

coalesce the upstream node stormed messages with the stormed message of the apparatus; and

transmit the coalesced stormed message downstream along the tree toward the particular receiving node upon expiration of the timer.

19. The apparatus as in claim 18, wherein the stormed response process when executed further operable to:

determine a plurality of diverse routing trees based on a plurality of corresponding root nodes to reach the particular receiving node;

calculate the delay value for each routing tree; and

in response to detecting the trigger;

initiate the timer, receive all upstream node stormed messages, coalesce the upstream node stormed messages, and transmit the coalesced stormed message for each of the plurality of routing trees.