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

1. 发明授权

US07911944B2 Tie-breaking in shortest path determination 有权
标题翻译：在最短路径确定中断断
公开(公告)号：US07911944B2
公开(公告)日：2011-03-22
申请号：US11964478
申请日：2007-12-26
申请人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood Smith
发明人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood Smith
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L45/00 , H04L45/22 , H04L45/24
摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.
摘要翻译：通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的打破决定。或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

2. 发明申请

US20110128857A1 TIE-BREAKING IN SHORTEST PATH DETERMINATION 失效
标题翻译：在最短路径确定中进行切割
公开(公告)号：US20110128857A1
公开(公告)日：2011-06-02
申请号：US13023823
申请日：2011-02-09
申请人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood Smith
发明人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood Smith
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/00 , H04L45/22 , H04L45/24
摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.
摘要翻译：通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的断开决定。或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

3. 发明授权

US08699329B2 Tie-breaking in shortest path determination 失效
标题翻译：在最短路径确定中断断
公开(公告)号：US08699329B2
公开(公告)日：2014-04-15
申请号：US13023823
申请日：2011-02-09
申请人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood Smith
发明人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood Smith
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L45/00 , H04L45/22 , H04L45/24
摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.
摘要翻译：通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的打破决定。或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

4. 发明申请

US20090168768A1 Tie-Breaking in Shortest Path Determination 有权
标题翻译：在最短路径确定中的打破
公开(公告)号：US20090168768A1
公开(公告)日：2009-07-02
申请号：US11964478
申请日：2007-12-26
申请人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood-Smith
发明人： Jerome Chiabaut , David Allan , Nigel Bragg , Peter Ashwood-Smith
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/00 , H04L45/22 , H04L45/24
摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.
摘要翻译：通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的打破决定。或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

5. 发明申请

US20080259784A1 Failure notification in a network having serially connected nodes 失效
标题翻译：具有串行连接节点的网络中的故障通知
公开(公告)号：US20080259784A1
公开(公告)日：2008-10-23
申请号：US12148418
申请日：2008-04-18
申请人： David Allan , Malcolm Betts , Nigel Bragg , Peter Ashwood Smith , Paul Unbehagen
发明人： David Allan , Malcolm Betts , Nigel Bragg , Peter Ashwood Smith , Paul Unbehagen
IPC分类号： G01R31/08
CPC分类号： H04L45/16 , H04L41/06 , H04L45/02 , H04L45/28 , H04L45/32
摘要： Multicast capabilities of a link state protocol controlled network are used to accelerate the flooding advertisement of topology change notifications within portions of the network. This flooding mechanism may be particularly efficient in a network with a large number of two-connected nodes such as a ring network architecture. A control plane specific multicast group address is used when flooding topology change notifications, and a process such as reverse path forwarding check is used as an additional control on forwarding of the notification to prevent looping of control plane packets. Two-connected nodes insert a forwarding entry into their FIB to enable frames containing the control message to be forwarded via the data plane on to the downstream node so that propagation of the control message along a chain of two-connected nodes may occur at data plane speeds.
摘要翻译：链路状态协议控制网络的组播功能用于加速网络部分内的拓扑变化通知的泛洪广告。这种洪泛机制在具有大量双连接节点（例如环网架构）的网络中可能是特别有效的。泛洪拓扑变化通知时使用控制平面特定的组播组地址，并且使用诸如反向路径转发检查之类的过程作为通知转发的附加控制，以防止控制平面分组的循环。双连接节点将转发条目插入到其FIB中，以使包含控制消息的帧能够经由数据平面转发到下游节点，使得控制消息沿双连接节点链的传播可能发生在数据平面速度。

6. 发明申请

US20080107027A1 Engineered paths in a link state protocol controlled Ethernet network 审中-公开
标题翻译：链路状态协议控制的以太网网络中的工程路径
公开(公告)号：US20080107027A1
公开(公告)日：2008-05-08
申请号：US11732381
申请日：2007-04-03
申请人： David Allan , Nigel Bragg , Peter Ashwood Smith
发明人： David Allan , Nigel Bragg , Peter Ashwood Smith
IPC分类号： H04L12/56
CPC分类号： H04L45/50 , H04L45/02 , H04L45/16 , H04L45/22 , H04L45/24 , H04L45/66
摘要： Traffic Engineered (TE) paths may be created over a link state protocol controlled Ethernet network by causing explicit paths to be installed by network elements on the link state protocol controlled Ethernet network and used to forward traffic on the network. The network elements exchange routing information using link state advertisements to enable each node on the network to build a link state database that may be used to determine shortest paths through the network. The shortest paths are used as a default forwarding state for traffic that is not associated with one of the traffic engineered paths. The link state advertisements may also be used to carry the TE path definitions. Where the TE paths are to be used exclusive of other routes, forwarding state for particular service instances may be removed to prevent traffic from traversing the network other than over the TE path.
摘要翻译：可以通过在链路状态协议控制的以太网上的网络元件安装明确的路径，并且用于在网络上转发流量来在链路状态协议控制的以太网上创建流量工程（TE）路径。网络元件使用链路状态通告来交换路由信息，以使网络上的每个节点建立可用于确定通过网络的最短路径的链路状态数据库。最短路径用作与未与某个交通工程路径相关联的流量的默认转发状态。链路状态通告也可以用于承载TE路径定义。在TE路径被排除在其他路由之外的情况下，可以去除特定服务实例的转发状态，以防止流经过TE路径以外的网络。

7. 发明申请

US20120263075A1 Method and Apparatus for Exchanging Routing Information and the Establishment of Connectivity Across Multiple Network Areas 有权
标题翻译：交换路由信息的方法和装置以及跨多个网络区域的连接建立
公开(公告)号：US20120263075A1
公开(公告)日：2012-10-18
申请号：US13526907
申请日：2012-06-19
申请人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Guoli Yin
发明人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Guoli Yin
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L12/462 , H04L45/02 , H04L45/04 , H04L45/66
摘要： Routes may be installed across multiple link state protocol controlled Ethernet network areas by causing ABBs to leak I-SID information advertised by BEBs in a L1 network area into an L2 network area. ABBs will only leak I-SIDs for BEBs where it is the closest ABB for that BEB. Where another ABB on the L2 network also leaks the same I-SID into the L2 network area from another L1 network area, the I-SID is of multi-area interest. ABBs will advertise I-SIDs that are common to the L1 and L2 networks back into their respective L1 network. Within each L1 and L2 network area, forwarding state will be installed between network elements advertising common interest in an ISID, so that multi-area paths may be created to span the L1/L2/L1 network areas. The L1/L2/L1 network structure may recurse an arbitrary number of times.
摘要翻译：可以通过使ABB将L1网络区域中的BEB发布的I-SID信息泄漏到L2网络区域中，将路由安装在多个链路状态协议控制的以太网网络区域。 ABB只会泄漏BEB的I-SID，而该BEB是该BEB最接近的ABB。在L2网络上的另一个ABB也从另一个L1网络区域将相同的I-SID泄漏到L2网络区域中，I-SID具有多方面的兴趣。 ABB将通过将L1和L2网络通用的I-SID广播回各自的L1网络。在每个L1和L2网络区域内，转发状态将被安装在对ISID广播共同兴趣的网元之间，从而可以创建多区域路径来跨越L1 / L2 / L1网络区域。 L1 / L2 / L1网络结构可能会递归任意次数。

8. 发明授权

US08194668B2 Differential forwarding in address-based carrier networks 有权
标题翻译：基于地址的运营商网络中的差分转发
公开(公告)号：US08194668B2
公开(公告)日：2012-06-05
申请号：US12196909
申请日：2008-08-22
申请人： Robert Friskney , Nigel Bragg , Simon Parry , Peter Ashwood Smith , David Allan , Simon Brueckheimer
发明人： Robert Friskney , Nigel Bragg , Simon Parry , Peter Ashwood Smith , David Allan , Simon Brueckheimer
IPC分类号： H04L12/28
CPC分类号： H04L41/0823 , H04L12/4645 , H04L45/00 , H04L45/16 , H04L45/54 , H04L45/64 , H04L45/66 , H04L45/72 , H04L49/205 , H04L49/253 , H04L49/254 , H04L49/351 , H04L49/354
摘要： The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.
摘要翻译：本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。描述了在包括诸如以太网交换机的节点（71-75和78）的基于帧的通信网络中建立连接（76,77）的方法和连接控制器。通过在各种节点中配置用于转发数据帧（例如以太网帧）的映射来建立连接。映射来自a）与该连接的目的地（或源）节点（73）对应的目的地（或源）地址的组合，以及b）诸如VLAN标签的标识符。映射到各个节点的选定输出端口。通过使用目的地（或源）地址AND标识符的组合，映射使得属于不同连接（76,77）的数据帧能够在节点（75）处差分地转发（即，在不同的输出端口上转发），尽管不同的连接具有相同的目的地节点。这使得路由连接的灵活性和执行流量工程的能力。

9. 发明申请

US20080279196A1 Differential Forwarding in Address-Based Carrier Networks 有权
标题翻译：基于地址的运营商网络的差分转发
公开(公告)号：US20080279196A1
公开(公告)日：2008-11-13
申请号：US10593108
申请日：2005-04-06
申请人： Robert Friskney , Nigel Bragg , Simon Parry , Peter Ashwood Smith , David Allan , Simon Brueckheimer
发明人： Robert Friskney , Nigel Bragg , Simon Parry , Peter Ashwood Smith , David Allan , Simon Brueckheimer
IPC分类号： H04L12/28
CPC分类号： H04L41/0823 , H04L12/4645 , H04L45/00 , H04L45/16 , H04L45/54 , H04L45/64 , H04L45/66 , H04L45/72 , H04L49/205 , H04L49/253 , H04L49/254 , H04L49/351 , H04L49/354
摘要： The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.
摘要翻译：本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。描述了在包括诸如以太网交换机的节点（71-75和78）的基于帧的通信网络中建立连接（76,77）的方法和连接控制器。通过在各种节点中配置用于转发数据帧（例如以太网帧）的映射来建立连接。映射来自a）与该连接的目的地（或源）节点（73）对应的目的地（或源）地址的组合，以及b）诸如VLAN标签的标识符。映射到各个节点的选定输出端口。通过使用目的地（或源）地址AND标识符的组合，映射使得属于不同连接（76,77）的数据帧能够在节点（75）处差分地转发（即，在不同的输出端口上转发），尽管不同的连接具有相同的目的地节点。这使得路由连接的灵活性和执行流量工程的能力。

10. 发明授权

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表项来实现多个组播。映射可以在广播成员身份的物理组播之前由目的地节点执行，或者可以在目的地节点在逻辑多播中通告成员资格之前由中间节点执行安装状态。如果物理组播树处于源映射到物理多播的逻辑多播中的一个源和至少一个目的地之间的最短路径上，则中间节点将为物理多播树安装状态。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式