专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07382738B2 Method and apparatus for computing metric information for abstracted network links 有权
标题翻译：用于计算抽象网络链路的度量信息的方法和装置
公开(公告)号：US07382738B2
公开(公告)日：2008-06-03
申请号：US10718681
申请日：2003-11-24
申请人： Ravi Ravindran , Peter Ashwood Smith , Guo Qiang Wang , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Guo Qiang Wang , Hong Zhang
IPC分类号： H04L12/28
CPC分类号： H04L45/123 , H04L45/12
摘要： 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.
摘要翻译：用于将度量信息与包括数据传输网络的某些网元（NE）的抽象网络映射的抽象链路相关联的方法和装置涉及通过抽象网络映射的NE之间的数据传输网络来计算路由。可以使用最短最宽路径算法计算路由。来自网元的路由与抽象网络图的其他网元交换，边缘网元在抽象网络图中收到网元对之间的所有最优路由的资源可用性信息。边缘NE然后将对应的最优路由的资源可用性转换为抽象链路的度量信息。将度量信息发送到与抽象网络映射关联的客户端，以允许客户端做出路由决定。

2. 发明授权

US07400589B2 Method and apparatus for deriving optimal paths through a network subject to a subset sequence constraint 有权
标题翻译：用于通过经受子集序列约束的网络导出最优路径的方法和装置
公开(公告)号：US07400589B2
公开(公告)日：2008-07-15
申请号：US10787107
申请日：2004-02-27
申请人： Hong Zhang , Ravi Ravindran , Peter Ashwood Smith , Guo Qiang Wang
发明人： Hong Zhang , Ravi Ravindran , Peter Ashwood Smith , Guo Qiang Wang
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/48
摘要： 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.
摘要翻译：跨越表示网络的图形的路由树通过迭代地扩展树以构成不包括在树中的图的节点来构造，该节点被选择，因为允许的路径从树的根延伸到节点与不在树中的其他节点的其他路径相比是最佳的。如果节点的路径不能扩展到串行限制组中的一个节点，则使用可以扩展到串行限制组中的节点的节点的辅助路径将节点重新包含在树中，如果辅助节点路径在树之外的节点的路径中是最佳的。

3. 发明授权

US07590067B2 Method and apparatus for deriving allowable paths through a network with intransitivity constraints 失效
标题翻译：通过具有不确定性限制的网络导出允许路径的方法和装置
公开(公告)号：US07590067B2
公开(公告)日：2009-09-15
申请号：US10691517
申请日：2003-10-24
申请人： Hong Zhang , Peter Ashwood Smith , Guo Qiang Wang
发明人： Hong Zhang , Peter Ashwood Smith , Guo Qiang Wang
IPC分类号： G01R31/08
CPC分类号： H04L45/48 , H04L45/02 , H04L45/12
摘要： A method of computing allowable routes through a data network that includes a subnetwork that introduces a subnet intransitivity constraint on allowable paths through the network involves using an abstracted network map to construct a directed graph that compensates for the subset intransitivity constraint by removing all unallowable paths. The abstracted network map may be used to compute least cost allowable paths through the network. The directed graph represents the same network, and is constructed by representing bi-directional links between the subnetwork elements with two directed edges, and representing the subnetwork elements as paired ingress and egress nodes. A method for constructing the directed graph representing an abstracted map of a network that exhibits subset intransitivity is also described.
摘要翻译：通过数据网络计算允许路由的方法，该数据网络包括通过网络在允许的路径上引入子网不可约束约束的子网络涉及使用抽象的网络映射来构造有向图，该有向图通过去除所有不允许的路径来补偿子集的传输约束。抽象网络图可以用于计算通过网络的最小成本允许路径。有向图表示相同的网络，并且通过在具有两个有向边缘的子网络元件之间表示双向链路并且将子网络元素表示为配对的入口和出口节点来构造。还描述了一种用于构建表示呈现子集不透明性的网络的抽象地图的有向图的方法。

4. 发明申请

US20120307625A1 Method and Apparatus For Selecting Between Available Neighbors in a RAPID Alternate Path Calculation 有权
标题翻译：用于在RAPID替代路径计算中的可用邻居之间选择的方法和装置
公开(公告)号：US20120307625A1
公开(公告)日：2012-12-06
申请号：US13588126
申请日：2012-08-17
申请人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
IPC分类号： H04L12/437 , H04L12/24 , H04L12/42
CPC分类号： H04L45/12 , H04L41/06 , H04L45/00 , H04L45/02 , H04L45/123 , H04L45/18 , H04L45/22 , H04L45/28
摘要： 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.
摘要翻译：可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用备用邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。在确定了一组可用的无环路交替邻居之后，可能会发生加权。或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。这可能使RAPID计算停止，而不考虑所有可用的邻居。

5. 发明授权

US09059920B2 Method and apparatus for selecting between available neighbors in a RAPID alternate path calculation 有权
标题翻译：用于在RAPID替代路径计算中的可用邻居之间进行选择的方法和装置
公开(公告)号：US09059920B2
公开(公告)日：2015-06-16
申请号：US13588126
申请日：2012-08-17
申请人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
IPC分类号： H04L12/721 , H04L12/701 , H04L12/751 , H04L12/705 , H04L12/707 , H04L12/703 , H04L12/24
CPC分类号： H04L45/12 , H04L41/06 , H04L45/00 , H04L45/02 , H04L45/123 , H04L45/18 , H04L45/22 , H04L45/28
摘要： 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.
摘要翻译：可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用替代邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。在确定了一组可用的无环路交替邻居之后，可能会发生加权。或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。这可能使RAPID计算停止，而不考虑所有可用的邻居。

6. 发明申请

US20080056137A1 Method and apparatus for selecting between available neighbors in a rapid alternate path calculation 失效
标题翻译：用于在快速替代路径计算中在可用邻居之间进行选择的方法和装置
公开(公告)号：US20080056137A1
公开(公告)日：2008-03-06
申请号：US11512671
申请日：2006-08-30
申请人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
IPC分类号： H04J3/14 , G06F15/173 , H04J1/16 , H04L12/28
CPC分类号： H04L45/12 , H04L41/06 , H04L45/00 , H04L45/02 , H04L45/123 , H04L45/18 , H04L45/22 , H04L45/28
摘要： 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.
摘要翻译：可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用替代邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。在确定了一组可用的无环路交替邻居之后，可能会发生加权。或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。这可能使RAPID计算停止，而不考虑所有可用的邻居。

7. 发明授权

US08264949B2 Method and apparatus for selecting between available neighbors in a rapid alternate path calculation 失效
标题翻译：用于在快速替代路径计算中在可用邻居之间进行选择的方法和装置
公开(公告)号：US08264949B2
公开(公告)日：2012-09-11
申请号：US11512671
申请日：2006-08-30
申请人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L41/06 , H04L45/00 , H04L45/02 , H04L45/123 , H04L45/18 , H04L45/22 , H04L45/28
摘要： 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.
摘要翻译：可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用备用邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。在确定了一组可用的无环路交替邻居之后，可能会发生加权。或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。这可能使RAPID计算停止，而不考虑所有可用的邻居。

8. 发明申请

US20050111375A1 Method and apparatus for computing metric information for abstracted network links 有权
标题翻译：用于计算抽象网络链路的度量信息的方法和装置
公开(公告)号：US20050111375A1
公开(公告)日：2005-05-26
申请号：US10718681
申请日：2003-11-24
申请人： Ravi Ravindran , Peter Ashwood Smith , Guo Wang , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Guo Wang , Hong Zhang
IPC分类号： H04L12/56 , H04L12/66
CPC分类号： H04L45/123 , H04L45/12
摘要： 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.
摘要翻译：用于将度量信息与包括数据传输网络的某些网元（NE）的抽象网络映射的抽象链路相关联的方法和装置涉及通过抽象网络映射的NE之间的数据传输网络来计算路由。可以使用最短最宽路径算法计算路由。来自网元的路由与抽象网络图的其他网元交换，边缘网元在抽象网络图中收到网元对之间的所有最优路由的资源可用性信息。边缘NE然后将对应的最优路由的资源可用性转换为抽象链路的度量信息。将度量信息发送到与抽象网络映射关联的客户端，以允许客户端做出路由决定。

9. 发明授权

US08254263B2 Method and apparatus for simplifying the computation of alternate network paths 失效
标题翻译：用于简化备用网络路径计算的方法和装置
公开(公告)号：US08254263B2
公开(公告)日：2012-08-28
申请号：US11410747
申请日：2006-04-25
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04L12/26
CPC分类号： H04L45/22 , H04J3/14 , H04L12/66 , H04L45/02
摘要： An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.
摘要翻译：替代路径计算过程可以在考虑了源节点的邻居中的一些并且不考虑其每个邻居的情况下终止，以减少执行备用路径计算所需的处理量。可以根据邻居历史上能够在网络上提供的备用路径的数量来排列邻居。历史成功或失败的影响可能随着时间的推移而降低，以便调整排名以反映网络地形的变化。给定的源节点在计算通过网络的备用路径时，可以优先选择邻居，以便在历史上较高的得分节点执行计算之前对历史上较高的评分节点执行备用路径计算。在考虑所有邻居之前，可以使用几种不同的标准来停止备用路径计算过程。邻居可以是无循环的邻居或U形圈邻居。

10. 发明申请

US20080107018A1 Method and apparatus for computing alternate multicast/broadcast paths in a routed network 失效
标题翻译：用于在路由网络中计算备用多播/广播路径的方法和装置
公开(公告)号：US20080107018A1
公开(公告)日：2008-05-08
申请号：US11713499
申请日：2007-03-02
申请人： Hong Zhang , Guoli Yin , Peter Ashwood-Smith
发明人： Hong Zhang , Guoli Yin , Peter Ashwood-Smith
IPC分类号： G01R31/08
CPC分类号： H04L12/1877 , H04L45/16 , H04L45/18 , H04L45/22 , H04L45/28 , H04L69/40 , H04L2212/00
摘要： Alternate multicast/broadcast paths may be calculated in a routed network to enable broadcast/multicast traffic to be transmitted around a local failure in the routed network until the routing system reconverges on a new network topography. According to an embodiment of the invention, the nodes on a multicast tree or a broadcast tree may compute alternate paths for each of the downstream nodes in the multicast/broadcast tree or for select nodes in the multicast/broadcast tree. The select nodes may be those nodes that have advertised membership in the multicast or a set number of hops downstream on the branch affected by the failure. The alternate paths may be unicast paths from the node to the other nodes on the multicast/broadcast tree. U-turn nodes may be used where there is no regular loop-free alternate network path to a node on the downstream multicast/broadcast tree.
摘要翻译：可以在路由网络中计算备用组播/广播路径，以使广播/多播业务能够围绕路由网络中的本地故障进行传输，直到路由系统重新构建新的网络地形。根据本发明的实施例，多播树或广播树上的节点可以计算多播/广播树中的每个下游节点或多播/广播树中的选择节点的替代路径。选择节点可以是已经通告多播中的成员身份的那些节点，或者受到故障影响的分支下游的一组跳数。备用路径可以是从节点到组播/广播树上的其他节点的单播路径。可以在下游组播/广播树上的节点没有常规无环路由替代网络路径的情况下使用U形转弯节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式