会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Router switch fabric protection using forward error correction
    • 路由器交换矩阵保护采用前向纠错
    • US08315175B2
    • 2012-11-20
    • US10981841
    • 2004-11-05
    • Thomas C. McDermott, IIIHarry C. BlackmonTony M. BrewerHarold W. DozierJim KleinerGregory S. PalmerKeith W. ShawDavid TraylorDean E. Walker
    • Thomas C. McDermott, IIIHarry C. BlackmonTony M. BrewerHarold W. DozierJim KleinerGregory S. PalmerKeith W. ShawDavid TraylorDean E. Walker
    • H04L12/26
    • H04Q11/0005H04J2203/0057H04L49/1523H04L49/208H04L49/254H04L49/357H04L2012/5627H04Q11/0066H04Q2011/0043
    • Instead of alternatively utilizing only one fabric or the other fabric of a redundant pair, both fabrics simultaneously transmit duplicate information, such that each packet forwarding module (PFM) receives the output of both fabrics simultaneously. In real time, an internal optics module (IOM) analyzes each information chunk coming out of a working zero switch fabric; simultaneously examines a parallel output of a working one duplicate switch fabric; and compares on a chunk-by-chunk basis the validity of each and every chunk from both switch fabrics. The IOM does this by examining forward error correction (FEC) check symbols encapsulated into each chunk. FEC check symbols allow correcting a predetermined number of bit errors within a chunk. If the chunk cannot be corrected, then the IOM provides indication to all PFMs downstream that the chunk is defective. Under such conditions, the PFMs select a chunk from the non-defective switch fabric. Under error-free normal conditions, however, the PFMs select a chunk arbitrarily from a default switch fabric. In this way, each chunk in real time is selected from a non-defective source and is thus guaranteed to be error free. Accordingly, if a switch fabric fails, no information chunks are lost anywhere in the system.
    • 代替替代地仅使用冗余对的一个结构或另一个结构,两个结构同时发送重复信息,使得每个分组转发模块(PFM)同时接收两个结构的输出。 实时地,内部光学模块(IOM)分析从工作的零交换结构出来的每个信息块; 同时检查工作的一个重复交换矩阵的并行输出; 并且以逐块为基础比较来自两个交换结构的每个块的有效性。 IOM通过检查封装到每个块中的前向纠错(FEC)校验符号来实现。 FEC检查符号允许校正块内的预定数量的位错误。 如果块不能被纠正,则IOM向下游的所有PFM提供指示该块是有缺陷的。 在这种情况下,PFM从无缺陷的交换结构中选择一个块。 然而,在无错误的正常条件下,PFM从默认的交换结构中任意选择一个块。 以这种方式,从无缺陷源选择实时的每个块,并且因此被保证是无错误的。 因此,如果交换机结构发生故障,系统中的任何地方都不会丢失任何信息块。
    • 2. 发明申请
    • System and method for router queue and congestion management
    • 路由器队列和拥塞管理的系统和方法
    • US20060062233A1
    • 2006-03-23
    • US11272998
    • 2005-11-14
    • Tony BrewerJim KleinerGregory PalmerKeith Shaw
    • Tony BrewerJim KleinerGregory PalmerKeith Shaw
    • H04L12/56H04L12/28
    • H04L47/32H04L47/10H04L47/24H04L49/3081H04L2012/5648H04L2012/5681H04Q11/0478
    • In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.
    • 在多QOS级别排队结构中,分组有效载荷指针被存储在公共存储器池中的多个队列和分组有效载荷中。 算法控制进入排队结构的数据包的丢弃概率。 通过将测量的瞬时队列大小与计算的最小和最大队列大小进行比较,可以获得瞬时丢弃概率。 未使用的公共存储器空间被同时分配给所有队列。 时间平均下降概率遵循传统的加权随机早期丢弃机制。 算法适用于多级QOS结构,浮点格式和硬件实现。 从路由器出口排队结构到单个出口端口支路的分组流由使用速率计量机制的仲裁算法控制。 对路由器系统中的每个出口支路进行排队结构的复制。
    • 3. 发明申请
    • Router switch fabric protection using forward error correction
    • 路由器交换矩阵保护采用前向纠错
    • US20050083921A1
    • 2005-04-21
    • US10981841
    • 2004-11-05
    • Thomas McDermottHarry BlackmonTony BrewerHarold DozierJim KleinerGregory PalmerKeith ShawDavid TraylorDean Walker
    • Thomas McDermottHarry BlackmonTony BrewerHarold DozierJim KleinerGregory PalmerKeith ShawDavid TraylorDean Walker
    • H04L12/56H04Q11/00H04Q11/04H04L12/50
    • H04Q11/0005H04J2203/0057H04L49/1523H04L49/208H04L49/254H04L49/357H04L2012/5627H04Q11/0066H04Q2011/0043
    • Instead of alternatively utilizing only one fabric or the other fabric of a redundant pair, both fabrics simultaneously transmit duplicate information, such that each packet forwarding module (PFM) receives the output of both fabrics simultaneously. In real time, an internal optics module (IOM) analyzes each information chunk coming out of a working zero switch fabric; simultaneously examines a parallel output of a working one duplicate switch fabric; and compares on a chunk-by-chunk basis the validity of each and every chunk from both switch fabrics. The IOM does this by examining forward error correction (FEC) check symbols encapsulated into each chunk. FEC check symbols allow correcting a predetermined number of bit errors within a chunk. If the chunk cannot be corrected, then the IOM provides indication to all PFMs downstream that the chunk is defective. Under such conditions, the PFMs select a chunk from the non-defective switch fabric. Under error-free normal conditions, however, the PFMs select a chunk arbitrarily from a default switch fabric. In this way, each chunk in real time is selected from a non-defective source and is thus guaranteed to be error free. Accordingly, if a switch fabric fails, no information chunks are lost anywhere in the system.
    • 代替替代地仅使用冗余对的一个结构或另一个结构,两个结构同时发送重复信息,使得每个分组转发模块(PFM)同时接收两个结构的输出。 实时地,内部光学模块(IOM)分析从工作的零交换结构出来的每个信息块; 同时检查工作的一个重复交换矩阵的并行输出; 并且以逐块为基础比较来自两个交换结构的每个块的有效性。 IOM通过检查封装到每个块中的前向纠错(FEC)校验符号来实现。 FEC检查符号允许校正块内的预定数量的位错误。 如果块不能被纠正,则IOM向下游的所有PFM提供指示该块是有缺陷的。 在这种情况下,PFM从无缺陷的交换结构中选择一个块。 然而,在无错误的正常条件下,PFM从默认的交换结构中任意选择一个块。 以这种方式,从无缺陷源选择实时的每个块,并且因此被保证是无错误的。 因此,如果交换机结构发生故障,系统中的任何地方都不会丢失任何信息块。
    • 4. 发明授权
    • System and method for router packet control and ordering
    • 路由器数据包控制和排序的系统和方法
    • US06876657B1
    • 2005-04-05
    • US09737646
    • 2000-12-14
    • Tony M. BrewerMichael K. DuganJim KleinerGregory S. PalmerPaul F. Vogel
    • Tony M. BrewerMichael K. DuganJim KleinerGregory S. PalmerPaul F. Vogel
    • H04L12/56H04L12/28
    • H04L49/103H04L49/3018H04L49/352H04L49/357
    • Hardware interconnected around multiple packet forwarding engines prepends sequence numbers to packets going into multiple forwarding engines through parallel paths, After processing by the multiple forwarding engines, packets are reordered using queues and a packet ordering mechanism, such that the sequence numbers are put back into their original prepended order. Exception packets flowing through the forwarding engines do not follow a conventional fast path, but are processed off-line and emerge from the forwarding engines out of order relative to fast path packets. These exception packets are marked, such that after they exit the forwarding engines, they are ordered among themselves independent of conventional fast path packets. Viewed externally, all exception packets are ordered across all multiple forwarding engines independent of the fast path packets.
    • 在多个数据包转发引擎之间互连的硬件将序列号添加到通过并行路径进入多个转发引擎的数据包中。在由多个转发引擎处理之后,使用队列和数据包排序机制重新排序数据包,使序列号被放回到 原先预订的订单。 流经转发引擎的异常数据包不遵循传统的快速路径,而是离线处理,并且相对于快速路径数据包,从转发引擎出来。 这些异常分组被标记,使得在他们退出转发引擎之后,它们之间是独立于传统的快速路径分组排序的。 从外部看,除了快速路径数据包之外,所有异常包均按所有多个转发引擎排序。
    • 5. 发明授权
    • System and method for router data distribution
    • 路由器数据分发的系统和方法
    • US07483433B2
    • 2009-01-27
    • US09954362
    • 2001-09-17
    • Steve M. SimmonsJim KleinerQiang LiBing LiuLance Arnold Visser
    • Steve M. SimmonsJim KleinerQiang LiBing LiuLance Arnold Visser
    • H04L12/28
    • H04L47/15H04L1/1614H04L12/1868H04L45/02H04L45/021H04L45/42H04L47/12H04L47/22
    • Employing an asymmetric protocol, multiple sources reliably broadcast dynamically changing routing tables incrementally across multiple consumers from a single distributor. Each of multiple sources sends current tables to the distributor using a snapshot mechanism. Messages are buffered, segmented, paced by timers, and broadcast to the consumers repetitively at the distributor. Negative acknowledgments from the consumer request missing messages from the distributor after receipt of a keepalive message from the distributor. The distributor marks the missing messages and retransmits replacements from a history buffer only after firing of a resend timer. A unique Session ID included in all messages originating from each particular source facilitates reliable table distribution from multiple sources to multiple consumers via a single distributor.
    • 采用非对称协议,多个源可以从单个分发者可靠地广泛地跨多个消费者广播动态变化的路由表。 每个多个源使用快照机制将当前表发送给分发者。 消息被缓冲,分段,由定时器起搏,并在分销商处重复地向消费者广播。 来自消费者的否定确认从收到来自经销商的保持性消息的消息中请求丢失来自经销商的消息。 分配器标记丢失的消息,并且仅在触发重新发送定时器之后从历史缓冲区重新发送替换。 来自每个特定源的所有消息中包含的唯一会话ID便于通过单个分发者将多个源到多个消费者的可靠表格分发。
    • 6. 发明授权
    • System and method for router queue and congestion management
    • 路由器队列和拥塞管理的系统和方法
    • US07813365B2
    • 2010-10-12
    • US11272998
    • 2005-11-14
    • Tony M. BrewerJim KleinerGregory S. PalmerKeith W. Shaw
    • Tony M. BrewerJim KleinerGregory S. PalmerKeith W. Shaw
    • H04L12/56
    • H04L47/32H04L47/10H04L47/24H04L49/3081H04L2012/5648H04L2012/5681H04Q11/0478
    • In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.
    • 在多QOS级别排队结构中,分组有效载荷指针被存储在公共存储器池中的多个队列和分组有效载荷中。 算法控制进入排队结构的数据包的丢弃概率。 通过将测量的瞬时队列大小与计算的最小和最大队列大小进行比较,可以获得瞬时丢弃概率。 未使用的公共存储器空间被同时分配给所有队列。 时间平均丢失概率遵循传统的加权随机早期丢弃机制。 算法适用于多级QOS结构,浮点格式和硬件实现。 从路由器出口排队结构到单个出口端口支路的分组流由使用速率计量机制的仲裁算法控制。 对路由器系统中的每个出口支路进行排队结构的复制。
    • 7. 发明授权
    • System and method for router data distribution
    • 路由器数据分发的系统和方法
    • US08335219B2
    • 2012-12-18
    • US12333029
    • 2008-12-11
    • Steve M. SimmonsJim KleinerQiang LiBing LiuLance Arnold Visser
    • Steve M. SimmonsJim KleinerQiang LiBing LiuLance Arnold Visser
    • H04L12/28G06F15/173
    • H04L47/15H04L1/1614H04L12/1868H04L45/02H04L45/021H04L45/42H04L47/12H04L47/22
    • Employing an asymmetric protocol, multiple sources reliably broadcast dynamically changing routing tables incrementally across multiple consumers from a single distributor. Each of multiple sources send current tables to the distributor using a snapshot mechanism. Message are buffered, segmented, paced by timers, and broadcast to the consumers repetitively at the distributor. Negative acknowledgments from the consumer request missing messages from the distributor after receipt of a keepalive message from the distributor. The distributor marks the missing messages and retransmits replacements from a history buffer only after firing of a resend timer. A unique Session ID included in all messages originating from each particular source facilitates reliable table distribution from multiple sources to multiple consumers via a single distributor.
    • 采用非对称协议,多个源可以从单个分发者可靠地广泛地跨多个消费者广播动态变化的路由表。 每个多个源使用快照机制将当前表发送给分发者。 消息被缓冲,分段,由定时器起搏,并在分销商处重复地向消费者广播。 来自消费者的否定确认从收到来自经销商的保持性信息后,向经销商请求丢失消息。 分配器标记丢失的消息,并且仅在触发重新发送定时器之后从历史缓冲区重新发送替换。 来自每个特定源的所有消息中包含的唯一会话ID便于通过单个分发者将多个源到多个消费者的可靠表格分发。
    • 8. 发明申请
    • SYSTEM AND METHOD FOR ROUTER QUEUE AND CONGESTION MANAGEMENT
    • 路由器队列和控制管理系统与方法
    • US20100220742A1
    • 2010-09-02
    • US12777069
    • 2010-05-10
    • Tony M. BrewerJim KleinerGregory S. PalmerKeith W. Shaw
    • Tony M. BrewerJim KleinerGregory S. PalmerKeith W. Shaw
    • H04L12/56
    • H04L47/32H04L47/10H04L47/24H04L49/3081H04L2012/5648H04L2012/5681H04Q11/0478
    • In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.
    • 在多QOS级别排队结构中,分组有效载荷指针被存储在公共存储器池中的多个队列和分组有效载荷中。 算法控制进入排队结构的数据包的丢弃概率。 通过将测量的瞬时队列大小与计算的最小和最大队列大小进行比较,可以获得瞬时丢弃概率。 未使用的公共存储器空间被同时分配给所有队列。 时间平均丢失概率遵循传统的加权随机早期丢弃机制。 算法适用于多级QOS结构,浮点格式和硬件实现。 从路由器出口排队结构到单个出口端口支路的分组流由使用速率计量机制的仲裁算法控制。 对路由器系统中的每个出口支路进行排队结构的复制。
    • 9. 发明授权
    • System and method for router queue and congestion management
    • 路由器队列和拥塞管理的系统和方法
    • US07974208B2
    • 2011-07-05
    • US12777069
    • 2010-05-10
    • Tony M. BrewerJim KleinerGregory S. PalmerKeith W. Shaw
    • Tony M. BrewerJim KleinerGregory S. PalmerKeith W. Shaw
    • H04L12/56H04J1/16
    • H04L47/32H04L47/10H04L47/24H04L49/3081H04L2012/5648H04L2012/5681H04Q11/0478
    • In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.
    • 在多QOS级别排队结构中,分组有效载荷指针被存储在公共存储器池中的多个队列和分组有效载荷中。 算法控制进入排队结构的数据包的丢弃概率。 通过将测量的瞬时队列大小与计算的最小和最大队列大小进行比较,可以获得瞬时丢弃概率。 未使用的公共存储器空间被同时分配给所有队列。 时间平均丢失概率遵循传统的加权随机早期丢弃机制。 算法适用于多级QOS结构,浮点格式和硬件实现。 从路由器出口排队结构到单个出口端口支路的分组流由使用速率计量机制的仲裁算法控制。 对路由器系统中的每个出口支路进行排队结构的复制。