Network planning and optimization of equipment deployment

• US 8,031,704 B2
• Filed: 10/22/2007
• Issued: 10/04/2011
• Est. Priority Date: 10/22/2007
• Status: Active Grant

• Current Assignee: Infinera Corp.
• Original Assignee: Infinera Corp.
• Inventors: Jain, Maneesh, Saxena, Atul, Hanumanthappa, Jayaram, Misra, Mohit, Hand, Steven Joseph, Venkatesan, Rajasekar
• Primary Examiner(s): Sheikh; Ayaz
• Assistant Examiner(s): CHAU, PETER P
• Application Number:
  US11/876,705
• Publication Number:
  US 20090103453A1
• Time in Patent Office: 1,443 Days
• Field of Search: None
• US Class Current: 370/359
• CPC Class Codes: H04J 14/0227 Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
• CPC Class Codes: H04J 14/0278 WDM optical network architectures
• CPC Class Codes: H04J 14/0284 WDM mesh architectures
• CPC Class Codes: H04L 12/4625 Single bridge functionality, e.g. connection of two networks over a single bridge
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/62 Wavelength based optical switching H04Q11/0062
• CPC Class Codes: H04L 49/40 Constructional details, e.g. power supply, mechanical construction or backplane

Abstract

Embodiments of the present invention provide systems, devices and methods for improving the efficient deployment and configuration of networking equipment within a network build-out. In certain embodiments of the invention, an iterative analysis of inter-node equipment placement and connectivity, and inter- and intra-node traffic flow is performed to identify a preferred deployment solution. This analysis of deployment optimization takes into account both configurations from a network node perspective as well as from a network system perspective. Deployment solutions are iteratively progressed and analyzed to determine a preferred solution based on both the cost of deployment and satisfaction of the network demands. In various embodiments of the invention, a baseline marker is generated from which the accuracy of the solution may be approximated that suggests to an engineer whether the deployment is approaching an optimal solution.

Claims

1. A method for optimizing a network node having a plurality of transport-side line cards and a backplane, the method comprising:

identifying a first group of transport-side line cards that connect a plurality of traffic circuits through the network node; and

identifying a second group of transport-side line cards that connect said plurality of traffic circuits through the network node, said identifying the second plurality of transport-side line cards including ordering nodal flows across the backplane, said identifying the second plurality of transport-side line cards being based on one or more of a set of constraints selected from a group consisting of shortest path calculations associated with the plurality of traffic circuits, protected path diversity associated with the plurality of traffic circuits, connectivity between each of the first group of transport-side line cards, topology of the backplane, and routing restrictions within a chassis,

wherein a number of the first plurality of transport-side line cards is larger than a number of the second plurality of transport-side line cards.

2. The method of claim 1 wherein ordering nodal flows includes the steps of:

unrouting the plurality of traffic circuits from the first group of transport-side line cards;

categorizing the unrouted traffic circuits into a plurality of nodal flows to form a plurality of categorized nodal flows; and

routing the plurality of categorized nodal flows through the network node.

3. The method of claim 2 wherein the plurality of categorized nodal flows are categorized according to flow rates.

4. The method of claim 2 further comprising the step of using nodal flow information to route the plurality of categorized nodal flows through the network node to preserve a highest number of chassis degrees of freedom for future demands.

5. The method of claim 2 further comprising the step of grouping a first plurality of categorized node flows, all having a same direction through the network node, and routing the first plurality of categorized node flows in the network node.

6. The method of claim 1 further comprising the step of determining whether identifying the second group of transport-side line cards resulted in a reduction of transport-side line cards used to satisfy network demands in a network.

7. The method of claim 6 wherein identifying the second group of transport-side line cards defines one of a plurality of network node configurations, the method further comprising the step of iteratively progressing through the plurality of network node configurations to select a preferred one of the plurality of node configurations based on a total cost of equipment deployed within a network.

8. The method of claim 1 wherein the backplane includes a topology selected from a group consisting of a full mesh topology and a partial mesh topology.

9. The method of claim 8 wherein the partial mesh topology is a ring topology.