会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Link layer preemption
    • 链接层抢占
    • US09166917B2
    • 2015-10-20
    • US13539425
    • 2012-06-30
    • Patricia A. Thaler
    • Patricia A. Thaler
    • H04L12/28H04L12/851
    • H04L47/245
    • Disclosed are various embodiments for frame preemption and fragmentation at the media access control (MAC) sublayer of the link layer or the MAC merge sublayer of the link layer. Traffic classes may be organized into preemptive traffic classes and non-preemptive traffic classes. Preemptable frames may be fragmented when a preemptive frame is to be transmitted. The fragmentation may be indicated through modification of the value of cyclic redundancy check (CRC) field in a predetermined way, through addition of a fragmentation trailer, and/or through other approaches.
    • 公开了链路层的媒体访问控制(MAC)子层或链路层的MAC合并子层的帧抢占和分段的各种实施例。 流量类可以被组织成抢占性流量类和非抢占流量类。 当要发送抢占帧时,可抢占帧可能被分段。 可以通过以预定的方式修改循环冗余校验(CRC)值的值,通过添加分段预告,和/或通过其它方法来指示分段。
    • 3. 发明授权
    • Coding and decoding packetized data
    • 打包和解码分组数据
    • US07440513B2
    • 2008-10-21
    • US11136257
    • 2005-05-24
    • Patricia A. Thaler
    • Patricia A. Thaler
    • H04L25/03
    • H03M5/145H04J3/1617H04J2203/0089H04L25/03866
    • A method for coding a packet of information words into frames for transmission, includes receiving blocks of input data, including control words and the packet of information words. When the block consists exclusively of information words, a master transition having a first sense is scrambled and appended to the block to form one of the frames. When the block does not consist exclusively of information words: the block is condensed to accommodate a TYPE word; a TYPE word having a value that indicates a structural property of the block is generated and inserted into the block; and a master transition having a second sense, opposite to the first sense, is scrambled and appended to the block to form one of the frames.
    • 一种用于将信息分组的分组编码成用于传输的帧的方法,包括接收包括控制字和信息字包的输入数据块。 当块仅由信息字组成时,具有第一感测的主转换被加扰并附加到该块以形成其中一个帧。 当块不完全由信息字组成时:块被压缩以容纳TYPE字; 生成具有指示块的结构性质的值的TYPE字,并将其插入到块中; 并且具有与第一感测相反的第二感测的主转换被加扰并附加到块以形成帧中的一个。
    • 5. 发明授权
    • Methods for computing the CRC of a message from the incremental CRCs of composite sub-messages
    • 用于从复合子消息的增量CRC计算消息的CRC的方法
    • US06904558B2
    • 2005-06-07
    • US10080886
    • 2002-02-22
    • Vicente V. CavannaPatricia A. Thaler
    • Vicente V. CavannaPatricia A. Thaler
    • H03M13/09H03M13/00
    • H03M13/091H03M13/617
    • Methods for adjusting an m-bit CRC of sub-messages are provided. Such adjustments enable the computation of the CRC of a message by XORing the partial or incremental CRCs of composite sub-messages corresponding to the sub-messages. In a first method, the contents of an m-bit memory location are field squared and stepped to the next state as determined by the Galois field generated by the CRC generating polynomial to adjust the m-bit CRC. In a second method, the partial m-bit CRC of a sub-message is calculated according to CRC generating polynomial, P(x). A variable Y is calculated using a lookup table, where Y=xn modulo P(x). The partial m-bit CRC and Y are multiplied together and divided by P(x). The remainder of the division forms the adjusted m-bit CRC.
    • 提供了调整子消息的m位CRC的方法。 这样的调整使得能够通过对与子消息相对应的复合子消息的部分增量CRC进行异或来计算消息的CRC。 在第一种方法中,m位存储器位置的内容是场平方的,并且步进到由CRC生成多项式产生的Galois域确定的下一个状态,以调整m位CRC。 在第二种方法中,根据CRC生成多项式P(x)计算子消息的部分m比特CRC。 使用查询表计算变量Y,其中Y = x 模P(x)。 部分m位CRC和Y相乘并除以P(x)。 除法的其余部分形成调整的m位CRC。
    • 6. 发明授权
    • Nonblocking and fair queuing switching method and shared memory packet switch
    • 非阻塞和公平排队切换方式和共享内存分组交换机
    • US06625159B1
    • 2003-09-23
    • US09201510
    • 1998-11-30
    • Bharat K. SinghBruce W. MelvinPatricia A. Thaler
    • Bharat K. SinghBruce W. MelvinPatricia A. Thaler
    • H04L1256
    • H04L49/103H04L49/201H04L49/3027H04L49/90
    • The present invention provides an improved shared memory switching method in which a guaranteed minimum number of buffers per output port is reserved for each input port. The shared memory may also be optionally divided into reserved and unreserved buffers, with the guaranteed minimum number of buffers being provided from the reserved buffers. The unreserved buffers are available to any port and will handle burst communications and other events that cause a given input port's allocation of reserved buffers to be exhausted. So that bursts are also handled fairly among input ports, additional optional features of the present invention include limiting the number of unreserved buffers that may be consumed by a single input port. For fairness among output ports, method also preferably fairly allocates unreserved buffers among the output ports.
    • 本发明提供一种改进的共享存储器切换方法,其中为每个输入端口保留每个输出端口的保证的最小数量的缓冲器。 共享存储器还可以可选地分为保留缓冲器和未保留缓冲器,保留的最小数量的缓冲器从保留的缓冲器提供。 未预留的缓冲区可用于任何端口,并将处理突发通信和导致给定输入端口分配预留缓冲区的其他事件。 因此,在输入端口之间也公平地进行突发处理,本发明的附加可选特征包括限制单个输入端口可能消耗的未预留缓冲器的数量。 为了输出端口之间的公平性,方法还优选地在输出端口之间公平地分配未预留的缓冲器。
    • 7. 发明授权
    • Method and apparatus for recentering an elasticity FIFO when receiving 1000BASE-X traffic using minimal information
    • 在使用最少信息接收1000BASE-X业务时重新设计弹性FIFO的方法和装置
    • US06289066B1
    • 2001-09-11
    • US09096143
    • 1998-06-11
    • Bruce E. LaVignePatricia A. ThalerPaul O'Connor
    • Bruce E. LaVignePatricia A. ThalerPaul O'Connor
    • H04L700
    • G06F5/12G06F2205/126H04J3/0632H04L49/3018H04L49/351H04L49/352
    • A method and apparatus is provided that solves the problem of data overrun and underrun, for example in a system that exchanges data using the Gigabit Ethernet protocol. A single 8-bit data path is provided as output and the main protocol state machines are kept running in the clock domain of the rest of the circuit, after an elasticity FIFO, so that no additional synchronization is necessary. The invention makes no demands upon the receive clock other than those specified in the relevant standard for duty cycle and accuracy. The invention correctly combines the two effective data streams back into a single data stream, only modifying the FIFO when it is acceptable to do so, and in a way that does not corrupt data packets passing through the FIFO. By providing a minimal set of logic running in the receive clock domain, it is possible to simplify the design of the main protocol state machines. Only a very small portion of the design must be aware of the dual-clock nature of the physical interface. In addition, because all key state machines are no longer in the receive clock domain, any state information or registers are available even if the receive clocks are not running correctly, as is the case with a removable transceiver design.
    • 提供了一种解决数据超限和欠载问题的方法和装置,例如在使用千兆以太网协议交换数据的系统中。 提供单个8位数据路径作为输出,并且主协议状态机在弹性FIFO之后保持在电路的其余部分的时钟域中运行,使得不需要额外的同步。 本发明不要求在相关标准中规定的占空比和精度以外的接收时钟。 本发明将两个有效数据流正确地组合成单个数据流,只有在可接受时才修改FIFO,并且以不破坏通过FIFO的数据分组的方式。 通过提供在接收时钟域中运行的最小逻辑集合,可以简化主协议状态机的设计。 只有很小一部分设计必须了解物理接口的双时钟性质。 另外,由于所有关键状态机不再在接收时钟域,所以即使接收时钟运行不正确,任何状态信息或寄存器都可用,如可拆卸收发器设计的情况。
    • 10. 发明授权
    • Coding and decoding packetized data
    • 打包和解码分组数据
    • US07738601B2
    • 2010-06-15
    • US12210502
    • 2008-09-15
    • Patricia A. Thaler
    • Patricia A. Thaler
    • H04L27/06
    • H03M5/145H04J3/1617H04J2203/0089H04L25/03866
    • A method for coding a packet of information words into frames for transmission, includes receiving blocks of input data, including control words and the packet of information words. When the block consists exclusively of information words, a master transition having a first sense is scrambled and appended to the block to form one of the frames. When the block does not consist exclusively of information words: the block is condensed to accommodate a TYPE word; a TYPE word having a value that indicates a structural property of the block is generated and inserted into the block; and a master transition having a second sense, opposite to the first sense, is scrambled and appended to the block to form one of the frames.
    • 一种用于将信息分组的分组编码成用于传输的帧的方法,包括接收包括控制字和信息字包的输入数据块。 当块仅由信息字组成时,具有第一感测的主转换被加扰并附加到该块以形成其中一个帧。 当块不完全由信息字组成时:块被压缩以容纳TYPE字; 生成具有指示块的结构性质的值的TYPE字,并将其插入到块中; 并且具有与第一感测相反的第二感测的主转换被加扰并附加到块以形成帧中的一个。