IP Library Granted Patent US 8,619,785
Granted Patent B2
US 8,619,785 · App. 12/431,493 · Granted Dec 31, 2013

Pre-computing alternate forwarding state in a routed ethernet mesh network

Inventors: David Allan (Ottawa, CA); Peter Ashwood Smith (Hull, CA)
Assignee: Ciena Corporation
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,619,785
App. No.
12/431,493
Granted
Dec 31, 2013
Kind
B2
Abstract

A set of critical nodes or links is identified on the network and alternate forwarding state is pre-computed and disseminated within a node such that, upon failure of one of the critical nodes/links, a minimal trigger will cause the alternate forwarding state to be used to forward traffic on the routed Ethernet mesh network. In one embodiment rather than storing full tables of alternate forwarding state, only the changes to the forwarding state required by an identified failure is stored by the network nodes. Upon occurrence of a failure on the network, the identified failure is used to select the alternate forwarding state.

Claims (32)

1. A method of pre-computing an alternate forwarding state in a routed Ethernet mesh network, the method comprising:

calculating, by a node, a forwarding state for the routed Ethernet mesh network based on a current topology of the routed Ethernet mesh network;

pre-computing, by the node, the alternate forwarding state for the routed Ethernet mesh network assuming failure of a first critical component of the routed Ethernet mesh network; and

pre-computing and storing, by the node, only differences between the forwarding state and the alternate forwarding state.

2. The method of claim 1 , further comprising disseminating the differences to all required subsystems in a node in advance of any failure.

3. The method of claim 2 , further comprising performing failure recovery with reduced intra nodal synchronization to invoke an appropriate sequence of state modifications to recover from the failure while incorporating loop avoidance.

4. The method of claim 1 , further comprising identifying a set of critical components on the routed Ethernet mesh network, the set of critical components including a first critical component.

5. The method of claim 4 , further comprising iterating the pre-computing the alternate forwarding state for the routed Ethernet mesh network assuming individual failure of each of the critical components of the set of critical components.

6. The method of claim 4 , wherein the critical components of the set of critical components are selected on a network-wide basis.

7. The method of claim 6 , wherein the critical components of the set of critical components are selected by nodes on the routed Ethernet mesh network based on a set of criteria and a synchronized view of the current network topology.

8. The method of claim 6 , wherein the critical components of the set of critical components are selected via a management system on the routed Ethernet mesh network.

9. The method of claim 8 , wherein the critical components of the set of critical components are communicated to nodes on the routed Ethernet mesh network in a link state advertisement.

10. The method of claim 8 , wherein the critical components of the set of critical components are selected via the management system based on a failure history or nodes and links on the routed Ethernet network.

11. The method of claim 4 , wherein the critical components of the set of critical components are selected individually by each node on the routed Ethernet mesh network to be unique to that node on the routed Ethernet mesh network.

12. A non-transitory computer program product stored on a computer-readable memory, the computer program product including data and instructions which, when loaded on a computer processor, enables one or more processors to implement a method of pre-computing an alternate forwarding state to be used by a node in a routed Ethernet mesh network upon failure of a critical component of the routed Ethernet mesh network, the critical component being selected from a set of critical components on the routed Ethernet mesh network, the method comprising:

calculating a forwarding state for the routed Ethernet mesh network based on a current topology of the routed Ethernet mesh network;

pre-computing the alternate forwarding state for the routed Ethernet mesh network assuming failure of a first critical component of the routed Ethernet mesh network; and

pre-computing and storing only differences between the forwarding state and the alternate forwarding state.

13. The computer program product of claim 12 , the method further comprising iterating the pre-computing the alternate forwarding state for the routed Ethernet mesh network assuming individual failure of each of the critical components of the set or critical components.

14. The computer program product of claim 12 , wherein the critical components of the set of critical components are selected on a network-wide basis.

15. The computer program product of claim 14 , wherein the critical components of the set of critical components are selected by nodes on the routed Ethernet mesh network based on a set of criteria and a synchronized view of the current network topology.

16. The computer program product of claim 14 , wherein the critical components of the set or critical components are selected via a management system on the routed Ethernet mesh network.

17. The computer program product of claim 16 , wherein the critical components of the set of critical components are communicated to nodes on the routed Ethernet mesh network in a link state advertisement.

18. The method of claim 1 , further comprising:

pre-computing a plurality of alternate forwarding states, each alternate forwarding state corresponding to failure of a different critical component; and

pre-computing and storing differences between the forwarding state and each of the plurality of alternate forwarding states.

19. The method of claim 1 , wherein a critical component is a node with a largest number of shortest paths passing through the node.

20. A method of pre-computing an alternate forwarding state in a routed Ethernet mesh network, the method comprising:

establishing, by a node, a set of critical components in the routed Ethernet mesh network;

calculating, by the node, a forwarding state for the routed Ethernet mesh network based on a current topology of the routed Ethernet mesh network;

pre-computing, by the node, the alternate forwarding state for the routed Ethernet mesh network assuming failure of a critical component from the set of critical components in the routed Ethernet mesh network; and

pre-computing and storing only differences between the forwarding state and the alternate forwarding state.

Assignments (8)
RELEASE OF SECURITY INTEREST Recorded Nov 20, 2023
From: BANK OF AMERICA, N.A.
To: CIENA CORPORATION
Reel/Frame 065630/0232 →
PATENT SECURITY AGREEMENT Recorded Nov 8, 2019
From: CIENA CORPORATION
To: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Reel/Frame 050969/0001 →
RELEASE OF SECURITY INTEREST Recorded Oct 30, 2019
From: DEUTSCHE BANK AG NEW YORK BRANCH
To: CIENA CORPORATION
Reel/Frame 050938/0389 →
PATENT SECURITY AGREEMENT Recorded Jul 16, 2014
From: CIENA CORPORATION
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 033347/0260 →
SECURITY INTEREST Recorded Jul 15, 2014
From: CIENA CORPORATION
To: DEUTSCHE BANK AG NEW YORK BRANCH
Reel/Frame 033329/0417 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 1, 2011
From: NORTEL NETWORKS LIMITED
To: CIENA LUXEMBOURG S.A.R.L.
Reel/Frame 026368/0477 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 1, 2011
From: CIENA LUXEMBOURG S.A.R.L.
To: CIENA CORPORATION
Reel/Frame 026368/0715 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 22, 2009
From: ALLAN, DAVID; ASHWOOD SMITH, PETER
To: NORTEL NETWORKS LIMITED
Reel/Frame 023266/0134 →
Continuity (1)
Related Publication 20100271936A1 · Oct 28, 2010