IP Library › Granted Patent US 12,323,231
Granted Patent B2
US 12,323,231 · App. 18/091,302 · Granted Jun 3, 2025

Routing and regenerator planning in a carrier's core reconfigurable optical network

Inventors: Balagangadhar Bathula (Lawrenceville, NJ); Angela Chiu (Holmdel, NJ); Rakesh Sinha (Edison, NJ); Sheryl Leigh Woodward (Holmdel, NJ)
Assignee: AT&T Intellectual Property I, L.P.
H04J14/0284H04J14/02122H04J14/0257H04J14/0267H04L41/122H04L41/40H04L45/125H04Q11/0062H04W16/18
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 12,323,231
App. No.
18/091,302
Filed
Dec 29, 2022
Granted
Jun 3, 2025
Kind
B2
Art Unit
2634
USPC
398/62
Abstract

A multi-layer network planning system can determine a set of regenerator sites (“RSs”) that have been found to cover all paths among a set of nodes of an optical layer of a multi-layer network and can determine a set of candidate RSs in the optical layer for use by the links between a set of nodes of an upper layer, wherein each RS can be selected as a candidate RS for the links. The system can determine a binary path matrix for the links between the set of nodes of the upper layer. The system can determine a min-cost matrix that includes a plurality of min-cost paths. The system can determine a best RS from the set of candidate RSs and can move the best RS from the set of candidate RSs into the set of RSs for the links. The system can then update the binary path matrix.

Claims (41)

1. A method comprising:

determining, by a network planning system comprising a processor, a set of regenerator sites in a multi-layer network, wherein the multi-layer network comprises an optical layer and an upper layer, wherein the upper layer utilizes the optical layer to create links between a set of nodes of the upper layer, and wherein the set of regenerator sites have previously been found to cover at least a portion of paths among a set of optical nodes of the optical layer;

determining, by the network planning system, a set of candidate regenerator sites in the optical layer for use by the links between the set of nodes of the upper layer, wherein each regenerator site of the optical layer can be selected as a candidate regenerate site for the links;

selecting, by the network planning system, from the set of candidate regenerator sites, a best regenerator site;

moving, by the network planning system, the best regenerator site from the set of candidate regenerator sites into the set of regenerator sites for the links; and

in response to a failure, adding, by the network planning system, capacity to a subset of surviving links of the upper layer using the optical layer.

2. The method of claim 1 , wherein selecting, by the network planning system, from the set of candidate regenerator sites, the best regenerator site comprises selecting, by the network planning system, from the set of candidate regenerator sites, the best regenerator site based upon a rank function.

3. The method of claim 2 , wherein the upper layer comprises an IP layer; and

wherein selecting, by the network planning system, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises selecting, from the set of optical nodes operating in the optical layer, a specific optical node as the best regenerator site, wherein the specific optical node belongs to a minimum cost path of a highest number of node pairs that do not have a valid path.

4. The method of claim 2 , wherein the upper layer comprises an IP layer; and

wherein selecting, by the network planning system, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises counting node pairs that provide a valid path as a result of placing a regenerator at a specific optical node of the set of optical nodes operating in the optical layer, wherein the specific optical node has a highest number of node pairs.

5. The method of claim 2 , wherein selecting, by the network planning system, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises selecting, by the network planning system, from the set of candidate regenerator sites, the best regenerator site based upon a weighted combination of two rank functions.

6. The method of claim 5 , wherein a first rank function of the two rank functions selects, from the set of optical nodes operating in the optical layer of the multi-layer network, a first specific optical node as the best regenerator site, wherein the first specific optical node belongs to a minimum cost path of a highest number of node pairs that do not have a valid path; and wherein a second rank function of the two rank functions counts node pairs that provide a valid path as a result of placing a regenerator at a second specific optical node of the set of optical nodes operating in the optical layer, wherein the second specific optical node has a highest number of node pairs.

7. The method of claim 6 , wherein the weighted combination is biased towards the second rank function.

8. The method of claim 1 , wherein the failure comprises:

a router failure of a router operating within the upper layer of the multi-layer network; or

an optical fiber failure of an optical fiber operating within the optical layer of the multi-layer network.

9. A network planning system comprising:

a processor; and

a memory comprising instructions that, when executed by the processor, cause the processor to perform operations comprising

determining a set of regenerator sites in a multi-layer network, wherein the multi-layer network comprises an optical layer and an upper layer, wherein the upper layer utilizes the optical layer to create links between a set of nodes of the upper layer, and wherein the set of regenerator sites have previously been found to cover at least a portion of paths among a set of optical nodes of the optical layer,

determining a set of candidate regenerator sites in the optical layer for use by the links between the set of nodes of the upper layer, wherein each regenerator site of the optical layer can be selected as a candidate regenerate site for the links,

selecting, from the set of candidate regenerator sites, a best regenerator site,

moving the best regenerator site from the set of candidate regenerator sites into the set of regenerator sites for the links, and

in response to a failure, adding capacity to a subset of surviving links of the upper layer using the optical layer.

10. The network planning system of claim 9 , wherein selecting, from the set of candidate regenerator sites, the best regenerator site comprises selecting, from the set of candidate regenerator sites, the best regenerator site based upon a rank function.

11. The network planning system of claim 10 , wherein the upper layer comprises an IP layer; and wherein selecting, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises selecting, from the set of optical nodes operating in the optical layer, a specific optical node as the best regenerator site, wherein the specific optical node belongs to a minimum cost path of a highest number of node pairs that do not have a valid path.

12. The network planning system of claim 10 , wherein the upper layer comprises an IP layer; and wherein selecting, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises counting node pairs that provide a valid path as a result of placing a regenerator at a specific optical node of the set of optical nodes operating in the optical layer, wherein the specific optical node has a highest number of node pairs.

13. The network planning system of claim 10 , wherein selecting, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises selecting, from the set of candidate regenerator sites, the best regenerator site based upon a weighted combination of two rank functions.

14. The network planning system of claim 13 , wherein a first rank function of the two rank functions selects, from the set of optical nodes operating in the optical layer of the multi-layer network, a first specific optical node as the best regenerator site, wherein the first specific optical node belongs to a minimum cost path of a highest number of node pairs that do not have a valid path; and wherein a second rank function of the two rank functions counts node pairs that provide a valid path as a result of placing a regenerator at a second specific optical node of the set of optical nodes operating in the optical layer, wherein the second specific optical node has a highest number of node pairs.

15. The network planning system of claim 14 , wherein the weighted combination is biased towards the second rank function.

16. A computer-readable storage medium comprising computer-executable instructions that, when executed by a processor of a network planning system, cause the processor to perform operations comprising:

determining a set of regenerator sites in a multi-layer network, wherein the multi-layer network comprises an optical layer and an upper layer, wherein the upper layer utilizes the optical layer to create links between a set of nodes of the upper layer, and wherein the set of regenerator sites have previously been found to cover at least a portion of paths among a set of optical nodes of the optical layer;

determining a set of candidate regenerator sites in the optical layer for use by the links between the set of nodes of the upper layer, wherein each regenerator site of the optical layer can be selected as a candidate regenerate site for the links;

selecting, from the set of candidate regenerator sites, a best regenerator site;

moving the best regenerator site from the set of candidate regenerator sites into the set of regenerator sites for the links; and

in response to a failure, adding capacity to a subset of surviving links of the upper layer using the optical layer.

17. The computer-readable storage medium of claim 16 , wherein selecting, from the set of candidate regenerator sites, the best regenerator site comprises selecting, from the set of candidate regenerator sites, the best regenerator site based upon a rank function.

18. The computer-readable storage medium of claim 17 , wherein the upper layer comprises an IP layer; and wherein selecting, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises selecting, from the set of optical nodes operating in the optical layer, a specific optical node as the best regenerator site, wherein the specific optical node belongs to a minimum cost path of a highest number of node pairs that do not have a valid path.

19. The computer-readable storage medium of claim 17 , wherein the upper layer comprises an IP layer; and wherein selecting, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises counting node pairs that provide a valid path as a result of placing a regenerator at a specific optical node of the set of optical nodes operating in the optical layer, wherein the specific optical node has a highest number of node pairs.

20. The computer-readable storage medium of claim 17 , wherein selecting, from the set of candidate regenerator sites, the best regenerator site based upon the rank function comprises selecting, from the set of candidate regenerator sites, the best regenerator site based upon a weighted combination of two rank functions; wherein a first rank function of the two rank functions selects, from the set of optical nodes operating in the optical layer of the multi-layer network, a first specific optical node as the best regenerator site, wherein the first specific optical node belongs to a minimum cost path of a highest number of node pairs that do not have a valid path; and wherein a second rank function of the two rank functions counts node pairs that provide a valid path as a result of placing a regenerator at a second specific optical node of the set of optical nodes operating in the optical layer, wherein the second specific optical node has a highest number of node pairs.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 29, 2022
From: BATHULA, BALAGANGADHAR; CHIU, ANGELA; SINHA, RAKESH; WOODWARD, SHERYL LEIGH
To: AT&T INTELLECTUAL PROPERTY I, L.P.
Reel/Frame 062240/0379 →
Continuity (3)
Continuation 16587627 · Sep 30, 2019
Continuation 15956121 · Apr 18, 2018
Related Publication 20230134574A1 · May 4, 2023
References Cited (50)
US 7454138B2 · Nozu · 2008 [cited by applicant]
US 7769296B1 · Chiu et al. · 2010 [cited by applicant]
US 7925163B2 · Segal · 2011 [cited by applicant]
US 8144626B2 · Zhang et al. · 2012 [cited by applicant]
US 8150257B1 · Choudhury · 2012 [cited by examiner]
US 8452176B2 · Doverspike et al. · 2013 [cited by applicant]
US 8565598B2 · Gerstel et al. · 2013 [cited by applicant]
US 8768167B2 · Tanna et al. · 2014 [cited by applicant]
US 8879906B2 · Patel et al. · 2014 [cited by applicant]
US 9014022B2 · Peterson et al. · 2015 [cited by applicant]
US 9350481B2 · Wei et al. · 2016 [cited by applicant]
US 9392466B2 · Peterson et al. · 2016 [cited by applicant]
US 9628879B2 · Bouda · 2017 [cited by applicant]
US 9647759B2 · Bruckman · 2017 [cited by applicant]
US 9699074B2 · Zhang et al. · 2017 [cited by applicant]
US 9780907B2 · Bouda · 2017 [cited by applicant]
US 10432342B1 · Bathula · 2019 [cited by applicant]
US 11552723B2 · Bathula · 2023 [cited by examiner]
US 20040107382A1 · Doverspike · 2004 [cited by applicant]
US 20040218525A1 · Elie-Dit-Cosaque · 2004 [cited by applicant]
US 20050063299A1 · Atkinson · 2005 [cited by applicant]
US 20050265255A1 · Kodialam · 2005 [cited by applicant]
US 20050270979A1 · Pauluhn et al. · 2005 [cited by applicant]
US 20070058607A1 · Mack-Crane · 2007 [cited by examiner]
US 20080144993A1 · Bottari et al. · 2008 [cited by applicant]
US 20110229122A1 · Castoldi · 2011 [cited by examiner]
US 20120301143A1 · Shimizu · 2012 [cited by applicant]
US 20130022353A1 · Shimizu · 2013 [cited by applicant]
US 20130089317A1 · Zhang · 2013 [cited by examiner]
US 20130216216A1 · Bottari · 2013 [cited by examiner]
US 20140207967A1 · Bryskin · 2014 [cited by applicant]
US 20140233956A1 · Zami · 2014 [cited by examiner]
US 20140308040A1 · Sekiya · 2014 [cited by examiner]
US 20140376404A1 · Bryskin · 2014 [cited by applicant]
US 20150229535A1 · Peterson et al. · 2015 [cited by applicant]
US 20170346593A1 · Kim et al. · 2017 [cited by applicant]
US 20180288774A1 · Karjee · 2018 [cited by applicant]
WO 2006048414 · 2006 [cited by applicant]
Gringeri et al., “Flexible Architectures for Optical Transport Nodes and Networks,” IEEE Communications Magazine, Jul. 2010, pp. 40-50. [cited by applicant]
Shen et al., “Impairment-Aware Lightpath Routing and Regenerator Placement in Optical Transport Networks With Physical-Layer Heterogeneity,” Journal of Lightwave Technology, Sep. 15, 2011, vol. 29, No. 18, pp. 2853-2860. [cited by applicant]
Chiu et al., “Restoration Design in IP over Reconfigurable All-Optical Networks,” Network and Parallel Computing, Sep. 2007, pp. 315-333. [cited by applicant]
Chowdhury et al., “On the Design of Energy-Efficient Mixed-Line-Rate (MLR) Optical Networks,” Journal of Lightwave Technology, Jan. 1, 2012, vol. 30, No. 1, pp. 130-139. [cited by applicant]
Klinkowski et al., “On the Advantages of Elastic Optical Networks for Provisioning of Cloud Computing Traffic,” IEEE Network, Nov./Dec. 2013, pp. 44-51. [cited by applicant]
Aibin et al., “Adaptive Modulation and Regenerator-Aware Dynamic Routing Algorithm in Elastic Optical Networks,” IEEE International Conference on Communications, Jun. 2015. [cited by applicant]
Kuipers et al., “Impairment-aware Path Selection and Regenerator Placement in Translucent Optical Networks,” 18th IEEE International Conference on Network Protocols, Oct. 5, 2010. [cited by applicant]
U.S. Office Action dated Nov. 7, 2018 in U.S. Appl. No. 15/956,121. [cited by applicant]
U.S. Notice of Allowance dated May 6, 2019 in U.S. Appl. No. 15/956,121. [cited by applicant]
U.S. Notice of Allowance dated Aug. 21, 2019 in U.S. Appl. No. 15/956,121. [cited by applicant]
U.S. Office Action dated Mar. 11, 2022 in U.S. Appl. No. 16/587,627. [cited by applicant]
U.S. Notice of Allowance dated Aug. 24, 2022 in U.S. Appl. No. 16/587,627. [cited by applicant]