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

1. 发明申请

US20100020797A1 METHOD AND APPARATUS FOR EXCHANGING ROUTING INFORMATION AND ESTABLISHING CONNECTIVITY ACROSS MULTIPLE NETWORK AREAS 失效
标题翻译：交换路由信息的方法和装置，并建立多个网络区域的连通性
公开(公告)号：US20100020797A1
公开(公告)日：2010-01-28
申请号：US12575190
申请日：2009-10-07
申请人： Liam M. CASEY , David Ian ALLAN , Nigel Lawrence BRAGG , Jerome CHIABAUT
发明人： Liam M. CASEY , David Ian ALLAN , Nigel Lawrence BRAGG , Jerome CHIABAUT
IPC分类号： H04L12/56
CPC分类号： H04L12/462 , H04L12/4641 , H04L45/02 , H04L45/026 , H04L45/04 , H04L45/16 , H04L45/18 , H04L45/66
摘要： A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.
摘要翻译：一种方法可以确保组播数据包遵循相同的无循环路径，随后是分组通信网络中的单播数据包。通信网络包括通过至少一个区域边界节点（“ABN”）互连到第二区域的至少一个第一区域。每个ABN具有连接到每个第一区域的第一级端口和连接到第二区域的第二级端口。转发的每个组播数据包包括一个具有标识多播树根的根ID的报头。在ABN处接收数据分组。响应于在区域边界节点的第二级端口处接收到组播数据包，检查组播数据包的根ID，如果要通过至少一个第一级端口转发组播数据包，在通过第一级端口转发数据包之前，将id替换为数据包。

2. 发明申请

US20120300774A1 METHOD AND APPARATUS FOR EXCHANGING ROUTING INFORMATION AND ESTABLISHING CONNECTIVITY ACROSS MULTIPLE NETWORK AREAS 审中-公开
标题翻译：交换路由信息的方法和装置，并建立多个网络区域的连通性
公开(公告)号：US20120300774A1
公开(公告)日：2012-11-29
申请号：US13567653
申请日：2012-08-06
申请人： Liam M. CASEY , David Ian ALLAN , Nigel Lawrence BRAGG , Jerome CHIABAUT
发明人： Liam M. CASEY , David Ian ALLAN , Nigel Lawrence BRAGG , Jerome CHIABAUT
IPC分类号： H04L12/56
CPC分类号： H04L12/462 , H04L12/4641 , H04L45/02 , H04L45/026 , H04L45/04 , H04L45/16 , H04L45/18 , H04L45/66
摘要： A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.
摘要翻译：一种方法可以确保组播数据包遵循相同的无循环路径，随后是分组通信网络中的单播数据包。通信网络包括通过至少一个区域边界节点（ABN）互连到第二区域的至少一个第一区域。每个ABN具有连接到每个第一区域的第一级端口和连接到第二区域的第二级端口。转发的每个组播数据包包括一个具有标识多播树根的根ID的报头。在ABN处接收数据分组。响应于在区域边界节点的第二级端口处接收到组播数据包，检查组播数据包的根ID，如果要通过至少一个第一级端口转发组播数据包，在通过第一级端口转发数据包之前，将id替换为数据包。

3. 发明申请

US20100157844A1 RESILIENT ATTACHMENT TO PROVIDER LINK STATE BRIDGING (PLSB) NETWORKS 失效
标题翻译：提供链路状态桥梁（PLSB）网络的强制性附件
公开(公告)号：US20100157844A1
公开(公告)日：2010-06-24
申请号：US12340174
申请日：2008-12-19
申请人： Liam CASEY , David ALLAN , Nigel L. BRAGG , Jerome CHIABAUT , Peter ASHWOOD SMITH
发明人： Liam CASEY , David ALLAN , Nigel L. BRAGG , Jerome CHIABAUT , Peter ASHWOOD SMITH
IPC分类号： H04L12/28
CPC分类号： H04L41/0654 , H04L12/66 , H04L45/02 , H04L45/22 , H04L45/245 , H04L45/48 , H04L45/74 , H04L47/41 , H04L2212/00 , Y02D50/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被配置为使得经由第一网络域中的连接从客户端系统接收的入口分组通过一个有意识地根植于虚拟节点的路径转发; 并且去往客户端系统的出口订户分组通过第一网络域中的连接被转发到客户端系统。

4. 发明申请

US20120230199A1 TIE-BREAKING IN SHORTEST PATH DETERMINATION 失效
标题翻译：在最短路径确定中进行切割
公开(公告)号：US20120230199A1
公开(公告)日：2012-09-13
申请号：US13477366
申请日：2012-05-22
申请人： Jerome CHIABAUT
发明人： Jerome CHIABAUT
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/22 , H04L45/24 , H04L45/48
摘要： 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. 发明申请

US20130215749A1 RESILIENT ATTACHMENT TO PROVIDER LINK STATE BRIDGING (PLSB) NETWORKS 有权
标题翻译：提供链路状态桥梁（PLSB）网络的强制性附件
公开(公告)号：US20130215749A1
公开(公告)日：2013-08-22
申请号：US13586620
申请日：2012-08-15
申请人： Liam CASEY , David ALLAN , Nigel L. BRAGG , Jerome CHIABAUT , Peter ASHWOOD SMITH
发明人： Liam CASEY , David ALLAN , Nigel L. BRAGG , Jerome CHIABAUT , Peter ASHWOOD SMITH
IPC分类号： H04L12/66
CPC分类号： H04L41/0654 , H04L12/66 , H04L45/02 , H04L45/22 , H04L45/245 , H04L45/48 , H04L45/74 , H04L47/41 , H04L2212/00 , Y02D50/30
摘要： A system for interfacing a client system in a first network domain with a Provider Link State Bridging (PLSB) domain includes at least two Backbone Edge Bridges (BEBs) of the PLSB domain. 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 in the PLSB domain. An inter-node trunk is provided in the PLSB domain for interconnecting the BEBs. A phantom node is defined in the PLSB domain and is notionally located on the inter-node trunk. 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 packet destined for the client system is forwarded to the client system through the connection in the first network domain.
摘要翻译：用于将第一网络域中的客户端系统与提供商链路状态桥接（PLSB）域接口的系统包括至少两个PLSB域的骨干边缘桥（BEB）。每个BEB是第一网络域中的客户端系统的连接端点和PLSB域中至少一个单播路径的端点。在PLSB域中提供节点间中继以互连BEB。在PLSB域中定义了虚拟节点，并且概念上位于节点间中继线上。每个BEB被配置为使得经由第一网络域中的连接从客户端系统接收的入口分组通过一个有意识地根植于虚拟节点的路径转发; 并且去往客户端系统的出口分组通过第一网络域中的连接被转发到客户端系统。

6. 发明申请

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.
摘要翻译：一种链路状态协议控制网络中组播路由计算的方法。使用已知的生成树协议从网络中的第一节点到每个其他节点计算生成树。然后将网络划分成两个或更多个分区，每个分区包含第一节点的直接邻居节点和对生成树上的邻居节点的网络的任何节点。当满足预定标准时，两个或多个分区被合并。然后识别除了最大分区之外的所有分区内的节点，并且检查每个识别的节点以识别相应的最短路径穿过第一节点的节点对。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式