会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • Method and apparatus for distributed reassembly of subdivided packets using multiple reassembly components
    • 用于使用多个重组组件分布式重新组装细分包的方法和装置
    • US07092393B1
    • 2006-08-15
    • US09777095
    • 2001-02-04
    • Gregg Anthony WestbrookThomas Dejanovic
    • Gregg Anthony WestbrookThomas Dejanovic
    • H04L12/56
    • H04L49/608H04L49/15H04L49/3072H04L49/552H04L2012/5652
    • Methods and apparatus are disclosed for distributed reassembly of large packets split into smaller packets. Larger packets are split into several smaller packets, which are marked with a sequence number, timestamp, or other ordering and reassembly indications, and sent through a system or network. These smaller packets are received at the destination location by multiple reassembly components, which distribute information as to received packets and coordinate the sending of packets from themselves so as to produce the reassembled larger packets. In one implementation, each of the multiple reassembly components maintains one or more data structures indicating packets stored locally and those packets stored anywhere or elsewhere within the multiple reassembly components. When all smaller packets comprising a larger packet are received by one of the distributed resequencing components, the reassembly components transmit their smaller packets in a coordinated fashion as to produce the original larger packet.
    • 公开了用于分组重新分组成较小分组的大分组的方法和装置。 更大的数据包被分成几个更小的数据包,它们被标记为序列号,时间戳或其他排序和重组指示,并通过系统或网络发送。 这些较小的数据包通过多个重组组件在目的位置被接收,多个重组组件分配关于接收到的分组的信息,并协调来自它们的分组的发送,以便产生重新组装的较大分组。 在一个实施方式中,多个重组组件中的每一个维护指示本地存储的分组的一个或多个数据结构,以及存储在多个重组组件内的任何地方或其他地方的那些分组。 当包括较大分组的所有较小分组都由分布式重排组件中的一个接收时,重新组装组件以协调的方式发送它们较小的分组,以产生原始较大的分组。
    • 42. 发明授权
    • System and method for simultaneous deficit round robin prioritization
    • 同时进行循环优先排序的系统和方法
    • US07079545B1
    • 2006-07-18
    • US10022673
    • 2001-12-17
    • Kenneth Yi YunKevin Warren James
    • Kenneth Yi YunKevin Warren James
    • H04L12/56
    • H04L12/5601H04L47/50H04L47/527H04L47/6215H04L47/6225H04L47/6255H04L49/608H04L2012/5651H04L2012/5679H04L2012/5681
    • A system and method have been provided for prioritizing queued information packets having a variable number of cells. A simultaneous deficit round robin (DRR) analysis occurs in the course of several selection cycles. Each queue has an associated increment value. The packet lengths in each queue are simultaneously compared to an accumulation total in every selection cycle. If all the packets have lengths greater than their corresponding accumulation totals, each accumulation total is incremented and the selection process is repeated. If one of the information packets has a number of cells less than, or equal to its corresponding accumulation total, it is selected. In case multiple information packets are eligible, a variety of selection criteria can be used to break a tie. For example, the eligible information packet with the highest class of service (COS) can be selected. The information packet is completed transferred before another selection process is begun.
    • 已经提供了用于对具有可变数目的单元的排队信息分组进行优先排序的系统和方法。 在几个选择周期的过程中,发生同时的赤字循环(DRR)分析。 每个队列都有一个关联的增量值。 每个队列中的分组长度同时与每个选择周期中的累积总和进行比较。 如果所有数据包的长度大于其对应的累加总数,则每个累积总数将递增,并重复选择过程。 如果其中一个信息包具有小于或等于其相应累积总数的小区数,则选择该信元。 在多个信息包符合条件的情况下,可以使用各种选择标准来打破联系。 例如,可以选择具有最高服务等级(COS)的合格信息包。 在另一个选择过程开始之前,信息包被完成传送。
    • 44. 发明授权
    • System and method for hierarchical switching
    • 分层交换的系统和方法
    • US07020131B1
    • 2006-03-28
    • US10035835
    • 2001-12-24
    • Kenneth Yi YunKevin Warren James
    • Kenneth Yi YunKevin Warren James
    • H04L12/66H04L12/50H04L12/28H04Q11/00H04J3/02G06F13/00
    • H04L49/153H04L12/5601H04L49/1576H04L49/608H04L2012/5651H04L2012/5679H04L2012/5681H04Q2213/1302H04Q2213/1304
    • A system and method have been provided for hierarchically arbitrating in a broadband information switching network. The method promotes the fair and efficient distribution of information packets across the switch fabric that ultimately permits the switch to maximally match information packets to switch output addresses, at faster rates and higher throughput. The method comprises: accepting variably sized information packets at a plurality of switch inputs, that address a plurality of switch outputs; at each switch input, queuing the information packets into a plurality of queues; parsing the information packets into units of one cell; simultaneously arbitrating between each switch output and a plurality of available switch inputs, where an available input is defined to have at least one queue with an information packet addressing that particular switch output; selecting a queue; locking the link between switch inputs and switch outputs; and, transferring information packets across the links in units of one cell per master decision cycle.
    • 已经提供了一种用于在宽带信息交换网络中进行分级仲裁的系统和方法。 该方法促进了跨交换结构的信息分组的公平和有效的分配,最终允许交换机以更快的速率和更高的吞吐量最大限度地匹配信息分组以切换输出地址。 该方法包括:在多个交换机输入端接收可变大小的信息分组,其处理多个开关输出; 在每个交换机输入处,将信息分组排队成多个队列; 将信息包解析为一个单元的单元; 同时在每个开关输出和多个可用开关输入之间进行仲裁,其中可用输入被定义为具有至少一个具有寻址特定开关输出的信息分组的队列; 选择队列; 锁定开关输入和开关输出之间的连接; 并且以每个主决策周期的一个单元为单位在链路之间传送信息分组。