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

1. 发明申请

US20080095047A1 METHOD AND SYSTEM FOR LOOPING BACK TRAFFIC IN QIQ ETHERNET RINGS AND 1:1 PROTECTED PBT TRUNKS 有权
标题翻译：在QIQ以太网环和1：1保护的PBT TRUNKS中循环交换的方法和系统
公开(公告)号：US20080095047A1
公开(公告)日：2008-04-24
申请号：US11955888
申请日：2007-12-13
申请人： Darek SKALECKI , Gerard (Gary) SWINKELS , David ALLAN , Nigel BRAGG , Marc HOLNESS
发明人： Darek SKALECKI , Gerard (Gary) SWINKELS , David ALLAN , Nigel BRAGG , Marc HOLNESS
IPC分类号： H04L12/26
CPC分类号： H04L41/0668 , H04L45/22 , H04L45/28
摘要： A resilient virtual Ethernet ring has nodes interconnected by working and protection paths. If a span fails, the two nodes immediately on either side of the failure are cross-connected to fold the ring. Working-path traffic is cross-connected onto the protection path at the first of the two nodes and is then cross-connected back onto the working path at the second of the two nodes so that traffic always ingresses and egresses the ring from the working path. A traffic originating node, upon determining that transmitted packets are being looped back due to a fault on a primary path, is adapted to switch transmission of data packets from the primary path to a secondary path.
摘要翻译：一个有弹性的虚拟以太网环具有通过工作和保护路径互连的节点。如果跨度失效，则立即在故障两侧的两个节点交叉连接以折叠环。工作路径流量交叉连接到两个节点第一个的保护路径上，然后在两个节点的第二个端口上交叉连接回工作路径，以便流量始终从工作路径中进出环。业务始发节点在确定由于主路径上的故障而被发送的分组环回时适于将数据分组从主路径传输到次路径。

2. 发明申请

US20110292836A1 EVOLUTION OF ETHERNET NETWORKS 失效
标题翻译：以太网网络演进
公开(公告)号：US20110292836A1
公开(公告)日：2011-12-01
申请号：US13206732
申请日：2011-08-10
申请人： Nigel BRAGG , David ALLAN , Simon PARRY , Robert FRISKNEY , Simon BRUECKHEIMER
发明人： Nigel BRAGG , David ALLAN , Simon PARRY , Robert FRISKNEY , Simon BRUECKHEIMER
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L12/4641 , H04L12/462 , H04L12/4654 , H04L12/4658 , H04L12/4662 , H04L41/12 , H04L43/50 , H04L45/745
摘要： An Ethernet network comprises nodes which support a plurality of different forwarding modes. A range of VLAN Identifiers (VIDs) are allocated to each of the forwarding modes. Connections are configured between a source node and a destination node of the network using different forwarding modes. Packets carrying data traffic are sent to the destination node by selectively setting a VID in a packet to a first value, to transfer a packet via a first connection and a first forwarding mode, and a second value to transfer a packet via the second connection and the second forwarding mode. Packets received from both of the connections and sent on to an end user. VLAN Identifiers can be allocated to different releases of functionality at nodes (e.g. software releases) such that packets are forwarded via a set of nodes supporting a first release, or via a set of nodes supporting a second release.
摘要翻译：以太网网络包括支持多个不同转发模式的节点。每个转发模式都分配了一系列VLAN标识符（VID）。使用不同的转发模式在网络的源节点和目的节点之间配置连接。通过选择性地将分组中的VID设置为第一值，通过第一连接和第一转发模式传送分组，以及通过第二连接传送分组的第二值，将携带数据业务的分组发送到目的地节点，第二转发模式。从两个连接接收的数据包都发送到最终用户。 VLAN标识符可以被分配给节点（例如软件版本）上的不同版本的功能，使得分组经由支持第一版本的一组节点或经由支持第二版本的一组节点转发。

3. 发明申请

US20120257514A1 Failure Notification in a Network Having Serially Connected Nodes 有权
标题翻译：具有连接节点的网络中的故障通知
公开(公告)号：US20120257514A1
公开(公告)日：2012-10-11
申请号：US13528483
申请日：2012-06-20
申请人： David ALLAN , Malcolm BETTS , Nigel BRAGG , Peter ASHWOOD SMITH , Paul UNBEHAGEN
发明人： David ALLAN , Malcolm BETTS , Nigel BRAGG , Peter ASHWOOD SMITH , Paul UNBEHAGEN
IPC分类号： H04L12/26
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中，以使包含控制消息的帧能够经由数据平面转发到下游节点，使得控制消息沿双连接节点链的传播可能发生在数据平面速度。

4. 发明申请

US20110292838A1 PROVIDER LINK STATE BRIDGING (PLSB) COMPUTATION METHOD 失效
标题翻译： PROVIDER LINK STATE BRIDGING（PLSB）计算方法
公开(公告)号：US20110292838A1
公开(公告)日：2011-12-01
申请号：US13204309
申请日：2011-08-05
申请人： Jerome CHIABAUT , David ALLAN , Nigel BRAGG
发明人： Jerome CHIABAUT , David ALLAN , Nigel BRAGG
IPC分类号： H04L12/28
CPC分类号： H04L45/122 , H04L45/04 , H04L45/16 , H04L45/48 , H04L45/66
摘要： A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.
摘要翻译：一种链路状态协议控制网络中组播路由计算的方法。使用已知的生成树协议从网络中的第一节点到每个其他节点计算生成树。然后将网络划分成两个或更多个分区，每个分区包含第一节点的直接邻居节点和对生成树上的邻居节点的网络的任何节点。当满足预定标准时，两个或多个分区被合并。然后识别除了最大分区之外的所有分区内的节点，并且检查每个识别的节点以识别相应的最短路径穿过第一节点的节点对。

5. 发明申请

US20100189015A1 Planning Routes and Allocating Identifiers to Routes in a Managed Frame-Forwarding Network 失效
标题翻译：规划路由和分配标识符到管理帧转发网络中的路由
公开(公告)号：US20100189015A1
公开(公告)日：2010-07-29
申请号：US12752228
申请日：2010-04-01
申请人： Nigel BRAGG , Paul Bottorff , David Allan , Robert Friskney , Simon Parry
发明人： Nigel BRAGG , Paul Bottorff , David Allan , Robert Friskney , Simon Parry
IPC分类号： H04L12/28
CPC分类号： H04L45/48 , H04L45/04
摘要： A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees.
摘要翻译：提供了一种在被管理的帧转发网络中规划路由和分配路由标识符的方法。该网络包括通过链路互连的多个节点，每个节点被安排为根据由接收的数据帧承载的标识符和网络地址的组合以及存储在该节点处的转发指令来转发数据帧。该方法的第一步确定作为网络核心节点的节点子集。其余节点称为外围节点。然后，每个标识的核心节点都生成一个生成树，生成树停止一个链路，而不是任何其他核心节点。每个生成树定义生成树根节点和一组外围节点之间的无环路径。在生成树的根之间计划连接，并且将不同的标识符分配给一对生成树之间的每个计划的连接。

6. 发明申请

US20120134357A1 MULTICAST IMPLEMENTATION IN A LINK STATE PROTOCOL CONTROLLED ETHERNET NETWORK 有权
标题翻译：链路状态协议控制以太网网络中的多播实现
公开(公告)号：US20120134357A1
公开(公告)日：2012-05-31
申请号：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/56
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

热门服务

关于我们

友情链接

联系方式