会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Provider link state bridging (PLSB) computation method
    • 提供商链路状态桥接(PLSB)计算方法
    • US08605627B2
    • 2013-12-10
    • 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 neighbor node of the first node and any nodes of the network subtending the neighbor 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.
    • 一种链路状态协议控制网络中组播路由计算的方法。 使用已知的生成树协议从网络中的第一节点到每个其他节点计算生成树。 然后将网络划分成两个或更多个分区,每个分区包含第一节点的直接邻居节点和对生成树上的邻居节点的网络的任何节点。 当满足预定标准时,两个或多个分区被合并。 然后识别除了最大分区之外的所有分区内的节点,并且检查每个识别的节点以识别相应的最短路径穿过第一节点的节点对。
    • 2. 发明申请
    • TRAFFIC DRIVEN VARIABLE BANDWIDTH OPTICAL TRANSMISSION
    • 交通驱动可变带宽光传输
    • US20120219288A1
    • 2012-08-30
    • US13220318
    • 2011-08-29
    • Kim B. RobertsJerome Chiabaut
    • Kim B. RobertsJerome Chiabaut
    • H04B17/00
    • H04J3/14H04J3/0605H04J3/0623H04J3/1611H04J3/1617H04L1/0002H04L1/0017
    • Link bandwidth is varied based on the subscriber traffic load. Varying the link bandwidth has the effect of varying the actual noise margin of the link (in an inverse elation), so that the noise margin will vary inversely with the traffic load. A beneficial result is that, because the noise margin is increased during “off-peak” traffic periods, rapidly varying and burst impairments can be absorbed without causing data loss. In effect, the respective probability distributions of error bursts and traffic load are separated. Data loss only becomes a significant risk when peaks in both distributions coincide. However, the probability of that event occurring is comparatively low. This enables a lower noise margin allocation during design of the link, which dramatically reduces the link cost.
    • 链路带宽根据用户流量负载而变化。 改变链路带宽具有改变链路的实际噪声容限(反向相关)的效果,使得噪声容限将与业务负载成反比变化。 有利的结果是,由于在“非高峰”运行期间噪声容限增加,所以可以在不造成数据丢失的情况下吸收快速变化和爆发损伤。 实际上,错误突发和业务负载的各自的概率分布被分离。 数据丢失仅在两个分布的峰值一致时才成为重大风险。 然而,事件发生的概率相对较低。 这使得在链路设计期间能够进行更低的噪声容限分配,这显着降低了链路成本。
    • 3. 发明授权
    • Traffic driven variable bandwidth optical transmission
    • 流量驱动可变带宽光传输
    • US08009985B1
    • 2011-08-30
    • US10436129
    • 2003-05-13
    • Kim B. RobertsJerome Chiabaut
    • Kim B. RobertsJerome Chiabaut
    • H04J14/00
    • H04J3/14H04J3/0605H04J3/0623H04J3/1611H04J3/1617H04L1/0002H04L1/0017
    • Link bandwidth is varied based on the subscriber traffic load. Varying the link bandwidth has the effect of varying the actual noise margin of the link (in an inverse relation), so that the noise margin will vary inversely with the traffic load. A beneficial result is that, because the noise margin is increased during “off-peak” traffic periods, rapidly varying and burst impairments can be absorbed without causing data loss. In effect, the respective probability distributions of error bursts and traffic load are separated. Data loss only becomes a significant risk when peaks in both distributions coincide. However, the probability of that event occurring is comparatively low. This enables a lower noise margin allocation during design of the link, which dramatically reduces the link cost.
    • 链路带宽根据用户流量负载而变化。 改变链路带宽具有改变链路的实际噪声容限(反向关系)的效果,使得噪声容限将与业务负载成反比变化。 有利的结果是,由于在“非高峰”运行期间噪声容限增加,所以可以在不造成数据丢失的情况下吸收快速变化和爆发损伤。 实际上,错误突发和业务负载的各自的概率分布被分离。 数据丢失仅在两个分布的峰值一致时才成为重大风险。 然而,事件发生的概率相对较低。 这使得在链路设计期间能够进行更低的噪声容限分配,这显着降低了链路成本。
    • 7. 发明申请
    • METHOD AND APPARATUS FOR SELECTING BETWEEN MULTIPLE EQUAL COST PATHS
    • 用于选择多个等效成本的方法和装置
    • US20120307832A1
    • 2012-12-06
    • US13589372
    • 2012-08-20
    • David AllanNigel BraggJerome Chiabaut
    • David AllanNigel BraggJerome Chiabaut
    • H04L12/28
    • H04L45/24H04L12/66H04L45/00H04L45/12H04L45/66
    • Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths.
    • 为每个相等的成本路径指定了通过连接形成通过网络的路径的有序的链路ID组创建的路径ID。 链接ID是从链路的任一组上的节点ID创建的。 链接ID从最低到最高排列,以便于路径的排名。 从这个排名列表中选择低和高排名的路径作为通过网络的第一组不同路径。 然后,每个路径上的每个链路ID被重命名,例如通过反转所有高节点ID或低节点ID。 在链接重新命名之后,通过连接重命名的链接ID的有序集来创建新的路径ID。 然后将路径重新排列,并且从该重新排列的列表中选择低和高重新排序的路径作为第二组不同路径。
    • 9. 发明申请
    • BREAK BEFORE MAKE FORWARDING INFORMATION BASE (FIB) POPULATION FOR MULTICAST
    • 在为MULTICAST提供前向信息库(FIB)人口之前BREAK
    • US20090180400A1
    • 2009-07-16
    • US12260558
    • 2008-10-29
    • Jerome ChiabautDavid AllanNigel Bragg
    • Jerome ChiabautDavid AllanNigel Bragg
    • H04L12/28
    • H04L41/12H04L12/18H04L12/462H04L45/02H04L45/021H04L45/16H04L45/18H04L45/22H04L45/28H04L45/48
    • A method of installing forwarding state in a link state protocol controlled network node having a topology database representing a known topology of the network, and at least two ports for communication with corresponding peers of the network node. A unicast path is computed from the node to a second node in the network, using the topology database, and unicast forwarding state associated with the computed unicast path installed in a filtering database (FDB) of the node. Multicast forwarding state is removed for multicast trees originating at the second node if an unsafe condition is detected. Subsequently, a “safe” indication signal is advertised to each of the peers of the network node. The “safe” indication signal comprises a digest of the topology database. A multicast path is then computed from the network node to at least one destination node of a multicast tree originating at the second node. Finally, multicast forwarding state associated with the computed multicast path is installed in the filtering database (FDB) of the network node, when predetermined safe condition is satisfied.
    • 一种在具有表示网络的已知拓扑的拓扑数据库的链路状态协议控制网络节点中安装转发状态的方法,以及用于与网络节点的相应对等体进行通信的至少两个端口。 使用拓扑数据库从网络中的节点到第二节点计算单播路径,以及与安装在节点的过滤数据库(FDB)中的计算的单播路径相关联的单播转发状态。 如果检测到不安全状况,则组播转发状态将被删除。 随后,向网络节点的每个对等体通告“安全”指示信号。 “安全”指示信号包括拓扑数据库的摘要。 然后,从网络节点计算多播路径到源于第二节点的多播树的至少一个目的地节点。 最后,当满足预定的安全条件时,安装在网络节点的过滤数据库(FDB)中与计算出的组播路径相关联的组播转发状态。
    • 10. 发明申请
    • System and method for increasing call capacity for a wireless local area network
    • 一种用于增加无线局域网呼叫容量的系统和方法
    • US20050226219A1
    • 2005-10-13
    • US10822427
    • 2004-04-12
    • Liam CaseyDavid AllanJerome Chiabaut
    • Liam CaseyDavid AllanJerome Chiabaut
    • H04L12/28H04L12/56H04M7/00
    • H04L47/365H04L47/10H04L47/14H04L47/283H04L65/80H04W28/06H04W76/10H04W84/12H04W88/08
    • A system for increasing the call capacity of an access point in a WLAN, allowing the number of WLAN phones that can be supported to be increased. The system determines whether a maximum total voice path delay would be exceeded if the packetization delay is increased for packets in a call. In the event that the packetization delay can be increased without the total delay exceeding the maximum delay, the disclosed system increases the size of packets used in the call, if all participating devices can process the increased packet size. The maximum delay may be predetermined, and reflect a maximum delay that cannot be exceeded without adversely impacting the voice quality of a call. If the two end points for a call are determined to be physically “local” to each other, packetization delay for the call may be increased based on the assumption that the increased packetization delay will not decrease the voice quality of the call.
    • 用于增加WLAN中接入点的呼叫容量的系统,允许增加可支持的WLAN电话的数量。 如果呼叫中的分组的分组化延迟增加,则系统确定是否将超过最大总话音路径延迟。 如果可以增加分组化延迟而没有超过最大延迟的总延迟,则所公开的系统增加了呼叫中使用的分组的大小,如果所有参与的设备都可以处理增加的分组大小。 最大延迟可以是预定的,并且反映不能超过的最大延迟,而不会不利地影响呼叫的语音质量。 如果呼叫的两个端点被确定为彼此物理上“本地”,则可以基于增加的分组化延迟不会降低呼叫的语音质量的假设来增加呼叫的分组化延迟。