会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Switching system
    • 开关系统
    • US06876663B2
    • 2005-04-05
    • US09874500
    • 2001-06-05
    • Ian David JohnsonColin Martin DuxburyMarek Stephen Piekarskl
    • Ian David JohnsonColin Martin DuxburyMarek Stephen Piekarskl
    • H04L12/933H04L12/935H04L12/937H04Q3/545H04Q11/04H04L12/28
    • H04Q11/0478H04L49/101H04L49/254H04L49/30H04L49/3027H04L49/3045H04Q3/5455H04Q2213/1302H04Q2213/1304H04Q2213/131H04Q2213/13103H04Q2213/13106H04Q2213/13196
    • A data switching device has ingress routers and egress routers interconnected by a switching matrix controlled by a controller. Each ingress router maintains one or more virtual output queues for each egress router. The switching matrix itself maintains a head-of queue buffer of cells which are to be transmitted. Each of these queues corresponds to one of the virtual output queues, and the cells stored in the switching matrix are replicated from the cells queuing in the respective virtual output queues. Thus, when it is determined that a connection is to be made between a given input and output of the switching matrix, a cell suitable for transmission along that connection is already available to the switching matrix. Upon receipt of a new cell by one of the ingress routers, the cell is stored in one of the virtual output queues of the ingress router corresponding to the egress router for the cell, and also written the corresponding head of queue buffer, if that buffer has space. If not, the cell is stored, and written to the head of queue buffer when that buffer has space for it.
    • 数据交换设备具有由控制器控制的交换矩阵互连的入口路由器和出口路由器。 每个入口路由器为每个出口路由器维护一个或多个虚拟输出队列。 交换矩阵本身维护要发送的小区的队列缓冲区。 这些队列中的每一个对应于虚拟输出队列中的一个,并且存储在交换矩阵中的单元从在各个虚拟输出队列中排队的单元中复制。 因此,当确定在交换矩阵的给定输入和输出之间进行连接时,适合于沿着该连接的传输的小区已经可用于交换矩阵。 在由入口路由器之一接收到新的小区时,该小区被存储在对应于该小区的出口路由器的入口路由器的一个虚拟输出队列中,并且还写入相应的队列缓冲区头部,如果该缓冲器 有空间。 如果没有,则该单元被存储,并且当缓冲器具有空间时将其写入队列缓冲器的头部。
    • 8. 发明授权
    • Data switching arbitration arrangements
    • 数据交换仲裁安排
    • US07050448B2
    • 2006-05-23
    • US09826801
    • 2001-04-05
    • Ian David JohnsonMarek Stephen Piekarski
    • Ian David JohnsonMarek Stephen Piekarski
    • H04L12/28H04L12/56
    • H04L49/101H04L49/3027H04L49/3045
    • There is disclosed a masking unit (REQMSK) for use in a data packet switching system. The data switching system being of the type having a memoryless cross-back switch (SM) providing cyclic connections under the control of a switch arbiter (SCARB) between ingress routers (IR0, IR1, IR2 and IR3) and egress routers (ER0, ER1, ER2 and ER3). Each of the ingress routers (IR0–IR3) is provided with incoming packet buffering on a virtual output queue basis (VOQ0.0, VOQ0.1, VOQ0.2, and VOQ0.3 for ingress router IR0). Each virtual output queue also produces a connection request signal REQ0.0 to REQ3.3 when the corresponding queue has a data packet in it. The masking unit REQMSK is arranged to randomly mask out correlated connection requests.
    • 公开了一种用于数据分组交换系统的掩蔽单元(REQMSK)。 数据交换系统具有在入口路由器(IR 0,IR 1,IR 2和IR 3)之间的交换仲裁器(SCARB)的控制下提供循环连接的无记忆交叉交换(SM)和出口路由器 (ER 0,ER 1,ER 2和ER 3)。 每个入口路由器(IR 0 -IR 3)都以虚拟输出队列(VOQ 0.0,VOQ 0.1,VOQ 0.2和VOQ 0.3为入口路由器IR 0)提供输入数据包缓冲。 当对应的队列中有一个数据包时,每个虚拟输出队列也产生一个连接请求信号REQ 0.0到REQ 3.3。 屏蔽单元REQMSK被布置成随机屏蔽相关的连接请求。
    • 9. 发明授权
    • Scheduling means for data switching apparatus
    • 数据交换装置的调度装置
    • US06970469B1
    • 2005-11-29
    • US09601695
    • 1999-02-09
    • Paul Graham HowarthIan David Johnson
    • Paul Graham HowarthIan David Johnson
    • H04L12/931H04L12/933H04L12/935H04L12/937H04Q11/04H04J3/02
    • H04Q11/0478H04L49/1546H04L49/205H04L49/254H04L49/3018
    • A scheduling means for data switching apparatus includes a plurality of input ports and a plurality of output ports, the scheduling means capable of processing a plurality of interconnection requests, each requesting interconnection between a sub-set of the input ports and a sub-set of respective the output ports, and each request having a respective priority level which is one of a predetermined number of priority levels. The scheduling means includes determination means for determining a first set of requests selected from the plurality of requests, according to the respective priority levels; a first pipeline stage for receiving only the first set of requests am satisfying at least one of the first set of requests; a priority mixer for determining a further set of requests independently of the priority levels, the further set including requests of the first set which were not satisfied and requests included in the plurality of requests which were not part of the first set and which are of any of the priority levels, and an additional pipeline stage for identifying requests in the further set which can be satisfied, and for satisfying the identified requests.
    • 一种用于数据交换装置的调度装置包括多个输入端口和多个输出端口,该调度装置能够处理多个互连请求,每个互连请求请求在输入端口的子集之间的互连和子集 相应的输出端口,并且每个请求具有作为预定数量的优先级之一的相应优先级。 调度装置包括:确定装置,用于根据各自的优先级确定从多个请求中选择的第一组请求; 用于仅接收满足第一组请求中的至少一个的第一组请求的第一流水线级; 用于独立于所述优先级确定另一组请求的优先级混合器,所述另一组包括不满足的第一组的请求和包括在多个请求中的请求,所述请求不包括第一组的一部分,并且是任何 以及用于识别可满足的另外的集合中的请求以及满足所识别的请求的附加流水线级。
    • 10. 发明授权
    • Method and device for operating a RAM memory
    • US06622202B2
    • 2003-09-16
    • US09850245
    • 2001-05-07
    • Steven Raymond CarrollIan David Johnson
    • Steven Raymond CarrollIan David Johnson
    • G06F1208
    • G11C7/1006
    • A method of operating a RAM memory having a plurality of memory addresses for storing data, the method being performed with a timing based on clock signals spaced by clock periods and comprising the steps of: receiving an address and a function signal specifying a function to be performed on data associated with that address; determining whether the same address has been received during a predefined number of preceding clock periods; generating a first data item representing data associated with the received address; modifying the first item according to the function signal to generate a second data item associated with the address, and writing the second data item to the address in the RAM and retaining a separate record of the last n second data items, the step of generating a first data item being performed by: (i) if the result of the determination is negative, generating the first data item to be equal to data stored by the RAM in the address, and (ii) if the result of the determination is positive, generating the first data item to be equal to the most recent second item associated with the address which is stored in the record.