公开(公告)号：US20130202299A1

公开(公告)日：2013-08-08

申请号：US13420717

申请日：2012-03-15

申请人： Anurag PRAKASH ,  Mohit CHHILLAR ,  Marian TRNKUS ,  Waseem Reyaz KHAN

发明人： Anurag PRAKASH ,  Mohit CHHILLAR ,  Marian TRNKUS ,  Waseem Reyaz KHAN

IPC分类号： H04J14/02

CPC分类号： H04J14/0257 ,  H04J14/0206 ,  H04J14/0215 ,  H04J14/0217 ,  H04J14/0258 ,  H04J14/0267 ,  H04J14/0269 ,  H04J14/0271 ,  H04J14/0284

摘要： A path computation method includes defining photonic constraints associated with a network, wherein the photonic constraints include wavelength capability constraints at each node in the network, wavelength availability constraints at each node in the network, and nodal connectivity constraints of each node in the network, and performing a constrained path computation in the network using Dijkstra's algorithm on a graph model of the network with the photonic constraints considered therein. An optical network includes a plurality of interconnected nodes each including wavelength capability constraints, wavelength availability constraints, and nodal connectivity constraints, and a path computation element associated with the plurality of interconnected photonic nodes, wherein the path computation element is configured to perform a constrained path computation through the plurality of interconnected nodes using Dijkstra's algorithm on a graph model with the photonic constraints considered therein.

摘要翻译： 路径计算方法包括定义与网络相关联的光子约束，其中光子约束包括网络中每个节点处的波长能力约束，网络中每个节点处的波长可用性约束以及网络中每个节点的节点连接约束，以及 使用Dijkstra算法对其中考虑的光子约束的网络的图形模型执行网络中的约束路径计算。 光网络包括多个互连节点，每个节点包括波长能力约束，波长可用性约束和节点连接性约束，以及与多个相互连接的光子节点相关联的路径计算元件，其中，路径计算元件被配置为执行约束路径 在其中考虑的光子约束的图形模型上使用Dijkstra算法通过多个互连节点进行计算。

公开(公告)号：US20130177305A1

公开(公告)日：2013-07-11

申请号：US13401969

申请日：2012-02-22

申请人： Anurag PRAKASH ,  Mohit CHHILLAR ,  Marian TRNKUS

发明人： Anurag PRAKASH ,  Mohit CHHILLAR ,  Marian TRNKUS

IPC分类号： H04B10/00

CPC分类号： H04J14/0269 ,  H04J14/0268

摘要： A method and system of determining a new path through an optical network from a source node to a destination node when a link in an original path fails are disclosed. When a fault on a link is detected, adjoint weights are assigned to each operational link for each node on the original path. A connection cost is determined for each node based on the adjoint weights of the links connected to the node. A new path through the optical network is determined based at least in part on the adjoint weights and the connection costs.

摘要翻译： 公开了当原始路径中的链路发生故障时，通过光网络确定从源节点到目的地节点的新路径的方法和系统。 当检测到链路故障时，将伴随权重分配给原始路径上每​​个节点的每个操作链路。 基于连接到节点的链路的伴随权重，确定每个节点的连接成本。 至少部分地基于伴随权重和连接成本确定通过光网络的新路径。

公开(公告)号：US20120226824A1

公开(公告)日：2012-09-06

申请号：US13242112

申请日：2011-09-23

申请人： Marian TRNKUS ,  Loudon BLAIR

发明人： Marian TRNKUS ,  Loudon BLAIR

IPC分类号： G06F15/16

CPC分类号： H04L45/02 ,  H04L41/12 ,  H04L45/125 ,  H04L45/22 ,  H04W16/18 ,  H04W92/02

摘要： The present disclosure provides distributed domain network planning systems and methods. The network planning systems and methods include a distributed domain network planning system that adapts planning concepts to networks operated by modern distributed control planes, such as ASON/ASTN, GMPLS, etc. The network planning systems and methods operate on a multi-domain network utilizing a control plane and local planning systems associated with each individual domain in the multi-domain network. The network planning systems and methods also operate on a single domain network utilizing a control plane and local planning systems associated with the single domain network. The network planning systems and methods build on a distributed control plane philosophy that the network is the database of record. There is significant operational value to distributing the planning function of a large network using the systems and methods disclosed herein.

摘要翻译： 本公开提供分布式域网络规划系统和方法。 网络规划系统和方法包括将规划概念适应于由现代分布式控制平面（如ASON / ASTN，GMPLS等）运行的网络的分布式域网规划系统。网络规划系统和方法在多域网络上运行 与多域网络中的每个域相关联的控制平面和本地规划系统。 网络规划系统和方法也使用与单域网相关联的控制平面和本地规划系统在单个域网上进行操作。 网络规划系统和方法建立在分布式控制平面的基础上，网络是记录数据库。 使用本文公开的系统和方法来分发大型网络的规划功能具有重要的操作价值。