IP Library Granted Patent US 9,083,484
Granted Patent B2
US 9,083,484 · App. 13/945,310 · Granted Jul 14, 2015

Software defined networking photonic routing systems and methods

Inventors: David Weldon Boertjes (Nepean, CA); Stephen Daniel Shew (Ottawa, CA)
Assignee: Ciena Corporation
H04J14/02H04J14/0204H04J14/0212H04J14/0227H04J14/0238H04J14/0267H04J14/0268H04L41/12H04L45/18H04L45/62H04L45/64H04Q11/0005H04J14/022H04J14/0206H04J14/0213H04J14/0275H04J14/0286H04J14/0297H04L45/28H04Q2011/0015H04Q2011/0016H04Q2011/0018
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 9,083,484
App. No.
13/945,310
Filed
Jul 18, 2013
Granted
Jul 14, 2015
Kind
B2
Examiner
PARK, KINAM
Art Unit
2828
USPC
398/49
Abstract

A network includes a plurality of interconnected nodes utilizing an all-broadcast architecture for a plurality of wavelengths therebetween; a routing protocol configured to compute a loop-free path through the plurality of interconnected nodes, wherein the loop-free path is computed for at least one wavelength of the plurality of wavelengths using routing constructs adapted to a photonic domain; and at least one blocking element configured to selectively block the at least one wavelength based on the computed loop-free path. A routing method photonic node are also disclosed.

Claims (36)

1. A network, comprising:

a plurality of interconnected nodes utilizing an all-broadcast architecture for a plurality of wavelengths there between;

wherein the plurality of interconnected nodes utilize a routing protocol configured to compute a loop-free path through the plurality of interconnected nodes, wherein the loop-free path utilizes at least one wavelength of the plurality of wavelengths using routing constructs adapted to a photonic domain; and

at least one blocking element configured to selectively block the at least one wavelength based on the computed loop-free path.

2. The network of claim 1 , further comprising:

a path computation element configured to determine locations of the at least one blocking element at the plurality of interconnected nodes based on the computed loop-free path and to communicate the determined locations to the network.

3. The network of claim 2 , further comprising:

a Software Defined Networking controller comprising the path computation element.

4. The network of claim 1 , wherein each of the nodes of the plurality of interconnected nodes utilizes a broadcast and select architecture.

5. The network of claim 4 , wherein the loop-free path is computed using a Shortest Path Bridging computation.

6. The network of claim 1 , wherein, responsive to a failed link between the plurality of interconnected nodes, the routing protocol is configured to compute an updated loop-free path through the plurality of interconnected nodes with the failed link excluded.

7. The network of claim 6 , wherein the at least one blocking element is reconfigured to selectively block and unblock the at least one wavelength based on the updated loop-free path.

8. The network of claim 1 , wherein the routing constructs comprise Layer 2 or Layer 3 constructs adapted for the photonic domain.

9. A processor-implemented routing method, comprising:

determining a topology of an optical network including a plurality of nodes, wherein the optical network utilizes an all-broadcast architecture for a plurality of wavelengths;

determining a loop-free path for at least one wavelength of the plurality of wavelengths through the optical network utilizing a routing protocol that uses routing constructs adapted to a photonic domain; and

directing at least one blocking element to selectively block the at least one wavelength based on the determined loop-free path.

10. The method of claim 9 , further comprising:

performing the determining steps and the directing step using an application; and

communicating locations of the at least one blocking element to the plurality of nodes.

11. The method of claim 9 , further comprising:

computing a spanning tree through the optical network for the loop-free path; and

assigning a cost to each of a plurality of links, with a bias in selection based on optical characteristics of each of the plurality of links.

12. The method of claim 11 , further comprising:

responsive to a failed link in the optical network, recomputing an updated loop-free path through the plurality of nodes on the plurality of links, with the failed link excluded from the recomputation; and

adjusting blocking behavior of the at least one blocking element based on the updated loop-free path.

13. The method of claim 9 , wherein the routing constructs comprise Layer 2 or Layer 3 constructs adapted for the photonic domain.

14. A node, comprising:

a plurality of degrees;

optical devices configured to broadcast a plurality of wavelengths through the plurality of degrees in an all-broadcast architecture;

at least one blocking element located at one of the plurality of degrees; and

a processor configured to selectively enable the at least one blocking element responsive to a loop-free path computed in a network in which node participates, wherein a routing protocol computes the loop-free path for at least one wavelength of the plurality of wavelengths using routing constructs adapted to a photonic domain.

15. The node of claim 14 , further comprising:

at least one optical transceiver communicatively coupled to the plurality of degrees, wherein the optical transceiver is operable for adding a wavelength of the plurality of wavelengths and dropping a wavelength of the plurality of wavelengths, wherein a receiver of the at least one optical transceiver is a coherent receiver configured to receive all wavelengths from a connected degree and selectively tune to a wavelength of interest.

16. The node of claim 14 , wherein the processor operates as a path computation element that performs a loop-free computation to determine the loop-free path.

17. The node of claim 14 , wherein the processor operates as a Software Defined Networking controller that performs a loop-free computation to determine the loop-free path.

Assignments (6)
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 Aug 6, 2013
From: BOERTJES, DAVID WELDON; SHEW, STEPHEN DANIEL
To: CIENA CORPORATION
Reel/Frame 030949/0340 →
Continuity (3)
Continuation In Part 13452322 · Apr 20, 2012
Continuation In Part 13371920 · Feb 13, 2012
Related Publication 20130315580A1 · Nov 28, 2013