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

1. 发明授权

US09008088B2 Multicast implementation in a link state protocol controlled ethernet network 有权
标题翻译：链路状态协议控制的以太网网络中的组播实现
公开(公告)号：US09008088B2
公开(公告)日：2015-04-14
申请号：US13302704
申请日：2011-11-22
申请人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
发明人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
IPC分类号： H04L12/28 , H04L12/18 , H04L12/46 , H04L12/701 , H04L12/751 , H04L12/721 , H04L12/761 , H04L12/705 , H04L12/753 , H04L12/931 , H04L12/24 , H04L12/935
CPC分类号： H04L12/18 , H04L12/462 , H04L12/4625 , H04L12/4641 , H04L12/4675 , H04L41/0816 , H04L45/00 , H04L45/02 , H04L45/12 , H04L45/16 , H04L45/18 , H04L45/48 , H04L45/66 , H04L49/3009 , H04L49/354
摘要： Forwarding state is installed for sparse multicast trees in a link state protocol controlled Ethernet network by enabling intermediate nodes to install state for one or more physical multicast trees, each of which may have multiple logical multicast trees mapped to it. By mapping multiple logical multicasts to a particular physical multicast, and installing state for the physical multicast, fewer FIB entries are required to implement the multiple multicasts. Mapping may be performed by destination nodes before advertising membership in the physical multicast, or may be performed by the intermediate nodes before installing state when a destination node advertises membership in a logical multicast. Intermediate nodes will install state for the physical multicast tree if they are on a shortest path between a source and at least one destination of one of the logical multicasts that has been mapped to the physical multicast.
摘要翻译：通过使中间节点能够为一个或多个物理组播树安装状态，每个可能具有映射到其上的多个逻辑组播树，为链路状态协议控制的以太网中的稀疏组播树安装转发状态。通过将多个逻辑组播映射到特定的物理组播，并为物理组播的安装状态，需要较少的FIB表项来实现多个组播。映射可以在广播成员身份的物理组播之前由目的地节点执行，或者可以在目的地节点在逻辑多播中通告成员资格之前由中间节点执行安装状态。如果物理组播树处于源映射到物理多播的逻辑多播中的一个源和至少一个目的地之间的最短路径上，则中间节点将为物理多播树安装状态。

2. 发明授权

US09124512B2 Method and apparatus for simplifying the computation of alternate network paths 有权
标题翻译：用于简化备用网络路径计算的方法和装置
公开(公告)号：US09124512B2
公开(公告)日：2015-09-01
申请号：US13595011
申请日：2012-08-27
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04L12/26 , H04L12/707 , H04L12/66 , H04L12/751 , H04J3/14
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形圈邻居。

3. 发明申请

US20120314582A1 METHOD AND APPARATUS FOR SIMPLIFYING THE COMPUTATION OF ALTERNATE NETWORK PATHS 有权
标题翻译：用于简化备用网络计算的方法和装置
公开(公告)号：US20120314582A1
公开(公告)日：2012-12-13
申请号：US13595011
申请日：2012-08-27
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04L12/28 , 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形圈邻居。

4. 发明授权

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形圈邻居。

5. 发明申请

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形转弯节点。

6. 发明申请

US20070248016A1 Method and apparatus for simplifying the computation of alternate network paths 失效
标题翻译：用于简化备用网络路径计算的方法和装置
公开(公告)号：US20070248016A1
公开(公告)日：2007-10-25
申请号：US11410747
申请日：2006-04-25
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04J3/14
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形圈邻居。

7. 发明授权

US08867366B2 Multicast implementation in a link state protocol controlled Ethernet network 有权
标题翻译：链路状态协议控制的以太网网络中的组播实现
公开(公告)号：US08867366B2
公开(公告)日：2014-10-21
申请号：US12910477
申请日：2010-10-22
申请人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
发明人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
IPC分类号： G01R31/08 , H04L12/46 , H04L12/721 , H04L12/733
CPC分类号： H04L12/462 , H04L12/18 , H04L12/4675 , H04L41/0816 , H04L45/00 , H04L45/12 , H04L45/122 , H04L45/16 , H04L45/18 , H04L45/48
摘要： Forwarding state may be installed for sparse multicast trees in a link state protocol controlled Ethernet network by enabling intermediate nodes to install state for one or more physical multicast trees, each of which may have multiple logical multicast trees mapped to it. By mapping multiple logical multicasts to a particular physical multicast, and installing state for the physical multicast, fewer FIB entries are required to implement the multiple multicasts to reduce the amount of forwarding state in forwarding tables at the intermediate nodes. Mapping may be performed by destination nodes before advertising membership in the physical multicast, or may be performed by the intermediate nodes before installing state when a destination node advertises membership in a logical multicast. Intermediate nodes will install state for the physical multicast tree if they are on a shortest path between a source and at least one destination of one of the logical multicasts that has been mapped to the physical multicast.
摘要翻译：可以通过使中间节点为一个或多个物理多播树安装状态来安装链路状态协议控制的以太网中的稀疏组播树的转发状态，每个物理多播树可以具有映射到它的多个逻辑多播树。通过将多个逻辑组播映射到特定物理组播，并为物理组播安装状态，需要较少的FIB表项来实现多个组播，以减少中间节点转发表中转发状态的数量。映射可以在广播成员身份的物理组播之前由目的地节点执行，或者可以在目的地节点在逻辑多播中通告成员资格之前由中间节点执行安装状态。如果物理组播树处于源映射到物理多播的逻辑多播中的一个源和至少一个目的地之间的最短路径上，则中间节点将为物理多播树安装状态。

8. 发明授权

US08059647B2 Multicast implementation in a link state protocol controlled ethernet network 有权
标题翻译：链路状态协议控制的以太网网络中的组播实现
公开(公告)号：US08059647B2
公开(公告)日：2011-11-15
申请号：US11702263
申请日：2007-02-05
申请人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
发明人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
IPC分类号： H04L12/28
CPC分类号： H04L12/462 , H04L12/18 , H04L12/4675 , H04L41/0816 , H04L45/00 , H04L45/12 , H04L45/122 , H04L45/16 , H04L45/18 , H04L45/48
摘要： Forwarding state may be installed for sparse multicast trees in a link state protocol controlled Ethernet network by enabling intermediate nodes to install state for one or more physical multicast trees, each of which may have multiple logical multicast trees mapped to it. By mapping multiple logical multicasts to a particular physical multicast, and installing state for the physical multicast, fewer FIB entries are required to implement the multiple multicasts to reduce the amount of forwarding state in forwarding tables at the intermediate nodes. Mapping may be performed by destination nodes before advertising membership in the physical multicast, or may be performed by the intermediate nodes before installing state when a destination node advertises membership in a logical multicast. Intermediate nodes will install state for the physical multicast tree if they are on a shortest path between a source and at least one destination of one of the logical multicasts that has been mapped to the physical multicast.
摘要翻译：可以通过使中间节点为一个或多个物理多播树安装状态来安装链路状态协议控制的以太网中的稀疏组播树的转发状态，每个物理多播树可以具有映射到它的多个逻辑多播树。通过将多个逻辑组播映射到特定物理组播，并为物理组播安装状态，需要较少的FIB表项来实现多个组播，以减少中间节点转发表中转发状态的数量。映射可以在广播成员身份的物理组播之前由目的地节点执行，或者可以在目的地节点在逻辑多播中通告成员资格之前由中间节点执行安装状态。如果物理组播树处于源映射到物理多播的逻辑多播中的一个源和至少一个目的地之间的最短路径上，则中间节点将为物理多播树安装状态。

9. 发明申请

US20110032936A1 MULTICAST IMPLEMENTATION IN A LINK STATE PROTOCOL CONTROLLED ETHERNET NETWORK 有权
标题翻译：链路状态协议控制以太网网络中的多播实现
公开(公告)号：US20110032936A1
公开(公告)日：2011-02-10
申请号：US12910477
申请日：2010-10-22
申请人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
发明人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
IPC分类号： H04L12/56
CPC分类号： H04L12/462 , H04L12/18 , H04L12/4675 , H04L41/0816 , H04L45/00 , H04L45/12 , H04L45/122 , H04L45/16 , H04L45/18 , H04L45/48
摘要： Forwarding state may be installed for sparse multicast trees in a link state protocol controlled Ethernet network by enabling intermediate nodes to install state for one or more physical multicast trees, each of which may have multiple logical multicast trees mapped to it. By mapping multiple logical multicasts to a particular physical multicast, and installing state for the physical multicast, fewer FIB entries are required to implement the multiple multicasts to reduce the amount of forwarding state in forwarding tables at the intermediate nodes. Mapping may be performed by destination nodes before advertising membership in the physical multicast, or may be performed by the intermediate nodes before installing state when a destination node advertises membership in a logical multicast. Intermediate nodes will install state for the physical multicast tree if they are on a shortest path between a source and at least one destination of one of the logical multicasts that has been mapped to the physical multicast.
摘要翻译：可以通过使中间节点为一个或多个物理多播树安装状态来安装链路状态协议控制的以太网中的稀疏组播树的转发状态，每个物理多播树可以具有映射到它的多个逻辑多播树。通过将多个逻辑组播映射到特定物理组播，并为物理组播安装状态，需要较少的FIB表项来实现多个组播，以减少中间节点转发表中转发状态的数量。映射可以在广播成员身份的物理组播之前由目的地节点执行，或者可以在目的地节点在逻辑多播中通告成员资格之前由中间节点执行安装状态。如果物理组播树处于源映射到物理多播的逻辑多播中的一个源和至少一个目的地之间的最短路径上，则中间节点将为物理多播树安装状态。

10. 发明授权

US07822031B2 Multicast implementation in a link state protocol controlled ethernet network 有权
公开(公告)号：US07822031B2
公开(公告)日：2010-10-26
申请号：US11702263
申请日：2007-02-05
申请人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
发明人： Peter Ashwood-Smith , Guoli Yin , Hong Zhang , Nigel Bragg , David Allan
IPC分类号： H04L12/28
摘要： Forwarding state may be installed for sparse multicast trees in a link state protocol controlled Ethernet network by enabling intermediate nodes to install state for one or more physical multicast trees, each of which may have multiple logical multicast trees mapped to it. By mapping multiple logical multicasts to a particular physical multicast, and installing state for the physical multicast, fewer FIB entries are required to implement the multiple multicasts to reduce the amount of forwarding state in forwarding tables at the intermediate nodes. Mapping may be performed by destination nodes before advertising membership in the physical multicast, or may be performed by the intermediate nodes before installing state when a destination node advertises membership in a logical multicast. Intermediate nodes will install state for the physical multicast tree if they are on a shortest path between a source and at least one destination of one of the logical multicasts that has been mapped to the physical multicast.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式