公开(公告)号：US20120307625A1

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

申请号：US13588126

申请日：2012-08-17

Applicant: Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

Inventor： Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

IPC: H04L12/437 ,  H04L12/24 ,  H04L12/42

CPC classification number: H04L45/12 ,  H04L41/06 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28

Abstract: A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Abstract translation: 可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。 用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。 该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用备用邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。 在确定了一组可用的无环路交替邻居之后，可能会发生加权。 或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。 这可能使RAPID计算停止，而不考虑所有可用的邻居。

公开(公告)号：US07382738B2

公开(公告)日：2008-06-03

申请号：US10718681

申请日：2003-11-24

Applicant: Ravi Ravindran ,  Peter Ashwood Smith ,  Guo Qiang Wang ,  Hong Zhang

Inventor： Ravi Ravindran ,  Peter Ashwood Smith ,  Guo Qiang Wang ,  Hong Zhang

IPC: H04L12/28

CPC classification number: H04L45/123 ,  H04L45/12

Abstract: A method and apparatus for associating metric information with an abstracted link of an abstracted network map that includes certain network elements (NEs) of a data transport network involves computing routes through the data transport network between the NEs of the abstracted network map. The routes may be computed using the shortest widest path algorithm. The routes from an NE are exchanged with the other NEs of the abstracted network map, so that an edge NE receives the resource availability information of all optimal routes between pairs of NEs in the abstracted network map. The edge NE then transforms the resource availability of a corresponding optimal route into metric information of an abstracted link. The metric information is sent to a client associated with the abstracted network map to permit the client to make routing decisions.

Abstract translation: 用于将度量信息与包括数据传输网络的某些网元（NE）的抽象网络映射的抽象链路相关联的方法和装置涉及通过抽象网络映射的NE之间的数据传输网络来计算路由。 可以使用最短最宽路径算法计算路由。 来自网元的路由与抽象网络图的其他网元交换，边缘网元在抽象网络图中收到网元对之间的所有最优路由的资源可用性信息。 边缘NE然后将对应的最优路由的资源可用性转换为抽象链路的度量信息。 将度量信息发送到与抽象网络映射关联的客户端，以允许客户端做出路由决定。

公开(公告)号：US08264949B2

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

申请号：US11512671

申请日：2006-08-30

Applicant: Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

Inventor： Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

IPC: G01R31/08

CPC classification number: H04L45/12 ,  H04L41/06 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28

Abstract: A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Abstract translation: 可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。 用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。 该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用备用邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。 在确定了一组可用的无环路交替邻居之后，可能会发生加权。 或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。 这可能使RAPID计算停止，而不考虑所有可用的邻居。

公开(公告)号：US20050111375A1

公开(公告)日：2005-05-26

申请号：US10718681

申请日：2003-11-24

Applicant: Ravi Ravindran ,  Peter Ashwood Smith ,  Guo Wang ,  Hong Zhang

Inventor： Ravi Ravindran ,  Peter Ashwood Smith ,  Guo Wang ,  Hong Zhang

IPC: H04L12/56 ,  H04L12/66

CPC classification number: H04L45/123 ,  H04L45/12

Abstract: A method and apparatus for associating metric information with an abstracted link of an abstracted network map that includes certain network elements (NEs) of a data transport network involves computing routes through the data transport network between the NEs of the abstracted network map. The routes may be computed using the shortest widest path algorithm. The routes from an NE are exchanged with the other NEs of the abstracted network map, so that an edge NE receives the resource availability information of all optimal routes between pairs of NEs in the abstracted network map. The edge NE then transforms the resource availability of a corresponding optimal route into metric information of an abstracted link. The metric information is sent to a client associated with the abstracted network map to permit the client to make routing decisions.

Abstract translation: 用于将度量信息与包括数据传输网络的某些网元（NE）的抽象网络映射的抽象链路相关联的方法和装置涉及通过抽象网络映射的NE之间的数据传输网络来计算路由。 可以使用最短最宽路径算法计算路由。 来自网元的路由与抽象网络图的其他网元交换，边缘网元在抽象网络图中收到网元对之间的所有最优路由的资源可用性信息。 边缘NE然后将对应的最优路由的资源可用性转换为抽象链路的度量信息。 将度量信息发送到与抽象网络映射关联的客户端，以允许客户端做出路由决定。

公开(公告)号：US09059920B2

公开(公告)日：2015-06-16

申请号：US13588126

申请日：2012-08-17

Applicant: Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

Inventor： Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

IPC: H04L12/721 ,  H04L12/701 ,  H04L12/751 ,  H04L12/705 ,  H04L12/707 ,  H04L12/703 ,  H04L12/24

CPC classification number: H04L45/12 ,  H04L41/06 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28

Abstract: A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Abstract translation: 可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。 用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。 该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用替代邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。 在确定了一组可用的无环路交替邻居之后，可能会发生加权。 或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。 这可能使RAPID计算停止，而不考虑所有可用的邻居。

公开(公告)号：US07400589B2

公开(公告)日：2008-07-15

申请号：US10787107

申请日：2004-02-27

Applicant: Hong Zhang ,  Ravi Ravindran ,  Peter Ashwood Smith ,  Guo Qiang Wang

Inventor： Hong Zhang ,  Ravi Ravindran ,  Peter Ashwood Smith ,  Guo Qiang Wang

IPC: H04L12/28

CPC classification number: H04L45/00 ,  H04L45/48

Abstract: A routing tree that spans a graph representing a network is constructed by iteratively expanding the tree to include a node of the graph that is not in the tree, the node being chosen because an allowable path extends from a root of the tree to the node that is optimal in comparison with the other paths to the other nodes not in the tree. If the path to the node cannot be extended to a node in the serial restriction group, the node is re-included in the tree using a secondary path to the node that can be extended to a node in the serial restriction group, if the secondary path is most optimal among the paths to nodes outside of the tree.

Abstract translation: 跨越表示网络的图形的路由树通过迭代地扩展树以构成不包括在树中的图的节点来构造，该节点被选择，因为允许的路径从树的根延伸到节点 与不在树中的其他节点的其他路径相比是最佳的。 如果节点的路径不能扩展到串行限制组中的一个节点，则使用可以扩展到串行限制组中的节点的节点的辅助路径将节点重新包含在树中，如果辅助节点 路径在树之外的节点的路径中是最佳的。

公开(公告)号：US20080056137A1

公开(公告)日：2008-03-06

申请号：US11512671

申请日：2006-08-30

Applicant: Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

Inventor： Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

IPC: H04J3/14 ,  G06F15/173 ,  H04J1/16 ,  H04L12/28

CPC classification number: H04L45/12 ,  H04L41/06 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28

Abstract: A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Abstract translation: 可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。 用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。 该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用替代邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。 在确定了一组可用的无环路交替邻居之后，可能会发生加权。 或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。 这可能使RAPID计算停止，而不考虑所有可用的邻居。

公开(公告)号：US20140140243A1

公开(公告)日：2014-05-22

申请号：US13678719

申请日：2012-11-16

Applicant: Peter Ashwood-Smith ,  Guoli Yin ,  Ravi Ravindran

Inventor： Peter Ashwood-Smith ,  Guoli Yin ,  Ravi Ravindran

IPC: H04L12/24

CPC classification number: H04L49/65 ,  H04L45/66

Abstract: A method and apparatus in provided which enables fast layer 2 reconfiguration in a network that includes Routing Bridges. Each Routing Bridge stores, for each forwarding target, identifiers of a primary next Rbridge and an alternate next Rbridge. The forwarding target may be a network end node, or an Egress Rbridge associated with the network end node. In response to a trigger condition, layer 2 communications are selectively switched from a path that includes the primary next Rbridge device to a path that includes the alternate next Rbridge device.

Abstract translation: 一种提供的方法和装置，其能够在包括路由桥的网络中实现快速层2重新配置。 每个路由桥为每个转发目标存储主要下一个Rbridge和另一个下一个R桥的标识符。 转发目标可以是与网络端节点相关联的网络端节点或出口R桥。 响应于触发条件，层2通信被选择性地从包括主下一个R桥设备的路径切换到包括备用的下一个R桥设备的路径。

公开(公告)号：US08331360B1

公开(公告)日：2012-12-11

申请号：US11262665

申请日：2005-10-31

Applicant: Peter Ashwood-Smith ,  Guoll Yin ,  Ravi Ravindran

Inventor： Peter Ashwood-Smith ,  Guoll Yin ,  Ravi Ravindran

IPC: H04L12/28

CPC classification number: H04L12/1868 ,  H04L12/1881

Abstract: A method and apparatus in provided which enables fast layer 2 reconfiguration in a network that includes Routing Bridges. Each Routing Bridge stores, for each forwarding target, identifiers of a primary next Rbridge and an alternate next Rbridge. The forwarding target may be a network end node, or an Egress Rbridge associated with the network end node. In response to a trigger condition, layer 2 communications are selectively switched from a path that includes the primary next Rbridge device to a path that includes the alternate next Rbridge device.

Abstract translation: 一种提供的方法和装置，其能够在包括路由桥的网络中实现快速层2重新配置。 每个路由桥为每个转发目标存储主要下一个Rbridge和另一个下一个Rbridge的标识符。 转发目标可以是与网络端节点相关联的网络端节点或出口R桥。 响应于触发条件，层2通信被选择性地从包括主下一个R桥设备的路径切换到包括备用的下一个R桥设备的路径。

公开(公告)号：US20050190704A1

公开(公告)日：2005-09-01

申请号：US10787107

申请日：2004-02-27

Applicant: Hong Zhang ,  Ravi Ravindran ,  Peter Smith ,  Guo Wang

Inventor： Hong Zhang ,  Ravi Ravindran ,  Peter Smith ,  Guo Wang

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L45/00 ,  H04L45/48

Abstract: A routing tree that spans a graph representing a network is constructed by iteratively expanding the tree to include a node of the graph that is not in the tree, the node being chosen because an allowable path extends from a root of the tree to the node that is optimal in comparison with the other paths to the other nodes not in the tree. If the path to the node cannot be extended to a node in the serial restriction group, the node is re-included in the tree using a secondary path to the node that can be extended to a node in the serial restriction group, if the secondary path is most optimal among the paths to nodes outside of the tree.

Abstract translation: 跨越表示网络的图形的路由树通过迭代地扩展树以构成不包括在树中的图的节点来构造，该节点被选择，因为允许的路径从树的根延伸到节点 与不在树中的其他节点的其他路径相比是最佳的。 如果节点的路径不能扩展到串行限制组中的一个节点，则使用可以扩展到串行限制组中的节点的节点的辅助路径将节点重新包含在树中，如果辅助节点 路径在树之外的节点的路径中是最佳的。