会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • RESILIENT ATTACHMENT TO PROVIDER LINK STATE BRIDGING (PLSB) NETWORKS
    • 提供链路状态桥梁(PLSB)网络的强制性附件
    • US20100157844A1
    • 2010-06-24
    • US12340174
    • 2008-12-19
    • Liam CASEYDavid ALLANNigel L. BRAGGJerome CHIABAUTPeter ASHWOOD SMITH
    • Liam CASEYDavid ALLANNigel L. BRAGGJerome CHIABAUTPeter ASHWOOD SMITH
    • H04L12/28
    • H04L41/0654H04L12/66H04L45/02H04L45/22H04L45/245H04L45/48H04L45/74H04L47/41H04L2212/00Y02D50/30
    • A method system for interfacing a client system in a first network domain with a Provider Link State Bridging (PLSB) network domain. At least two Backbone Edge Bridges (BEBs) of the PLSB domain 20 are provided. Each BEB is an end-point of a connection in the first network domain to the client system and an end-point of at least a unicast path defined within the PLSB domain 20. An inter-node trunk is provided in the PLSB domain 20 for interconnecting the at least two BEBs. A phantom node is defined in the PLSB domain 20. The phantom node has a unique address in the PLSB domain 20 and is notionally located on the inter-node trunk one hop from each of the BEBs. Each of the BEBs is configured such that: an ingress packet received from the client system via the connection in the first network domain is forwarded through a path notionally rooted at the phantom node; and an egress subscriber packet destined for the client system is forwarded to the client system through the connection in the first network domain.
    • 一种用于将第一网络域中的客户端系统与提供商链路状态桥接(PLSB)网络接口的方法系统。 提供了PLSB域20的至少两个骨干边缘桥(BEB)。 每个BEB是在第一网络域中到客户端系统的连接的端点以及在PLSB域20内定义的至少单播路径的端点。在PLSB域20中提供节点间中继,用于 互连所述至少两个BEB。 在PLSB域20中定义了虚拟节点。虚拟节点在PLSB域20中具有唯一的地址,并且从每个BEB中概念地位于节点间中继一跳。 每个BEB被配置为使得经由第一网络域中的连接从客户端系统接收的入口分组通过一个有意识地根植于虚拟节点的路径转发; 并且去往客户端系统的出口订户分组通过第一网络域中的连接被转发到客户端系统。
    • 7. 发明申请
    • EVOLUTION OF ETHERNET NETWORKS
    • 以太网网络演进
    • US20110292836A1
    • 2011-12-01
    • US13206732
    • 2011-08-10
    • Nigel BRAGGDavid ALLANSimon PARRYRobert FRISKNEYSimon BRUECKHEIMER
    • Nigel BRAGGDavid ALLANSimon PARRYRobert FRISKNEYSimon BRUECKHEIMER
    • H04L12/56H04L12/28
    • H04L12/4641H04L12/462H04L12/4654H04L12/4658H04L12/4662H04L41/12H04L43/50H04L45/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标识符可以被分配给节点(例如软件版本)上的不同版本的功能,使得分组经由支持第一版本的一组节点或经由支持第二版本的一组节点转发。
    • 8. 发明申请
    • PROVIDER LINK STATE BRIDGING (PLSB) COMPUTATION METHOD
    • PROVIDER LINK STATE BRIDGING(PLSB)计算方法
    • US20110292838A1
    • 2011-12-01
    • US13204309
    • 2011-08-05
    • Jerome CHIABAUTDavid ALLANNigel BRAGG
    • Jerome CHIABAUTDavid ALLANNigel BRAGG
    • H04L12/28
    • H04L45/122H04L45/04H04L45/16H04L45/48H04L45/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.
    • 一种链路状态协议控制网络中组播路由计算的方法。 使用已知的生成树协议从网络中的第一节点到每个其他节点计算生成树。 然后将网络划分成两个或更多个分区,每个分区包含第一节点的直接邻居节点和对生成树上的邻居节点的网络的任何节点。 当满足预定标准时,两个或多个分区被合并。 然后识别除了最大分区之外的所有分区内的节点,并且检查每个识别的节点以识别相应的最短路径穿过第一节点的节点对。