会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 18. 发明授权
    • Queue manager for a buffer
    • 队列管理器为缓冲区
    • US06557053B1
    • 2003-04-29
    • US09477179
    • 2000-01-04
    • Brian Mitchell BassJean Louis CalvignacMarco C. HeddesMichael Steven SiegelMichael Raymond TrombleyFabrice Jean Verplanken
    • Brian Mitchell BassJean Louis CalvignacMarco C. HeddesMichael Steven SiegelMichael Raymond TrombleyFabrice Jean Verplanken
    • G06F1314
    • G06F13/1673
    • A bandwidth conserving queue manager for a FIFO buffer is provided, preferably on an ASIC chip and preferably including separate DRAM storage that maintains a FIFO queue which can extend beyond the data storage space of the FIFO buffer to provide additional data storage space as needed. FIFO buffers are used on the ASIC chip to store and retrieve multiple queue entries. As long as the total size of the queue does not exceed the storage available in the buffers, no additional data storage is needed. However, when some predetermined amount of the buffer storage space in the FIFO buffers is exceeded, data are written to and read from the additional data storage, and preferably in packets which are of optimum size for maintaining peak performance of the data storage device and which are written to the data storage device in such a way that they are queued in a first-in, first-out (FIFO) sequence of addresses. Preferably, the data are written to and are read from the DRAM in burst mode.
    • 提供了用于FIFO缓冲器的带宽保存队列管理器,优选地在ASIC芯片上,并且优选地包括分离的DRAM存储器,其维持FIFO队列,其可以超出FIFO缓冲器的数据存储空间,以根据需要提供附加的数据存储空间。 在ASIC芯片上使用FIFO缓冲器来存储和检索多个队列条目。 只要队列的总大小不超过缓冲区中可用的存储空间,则不需要额外的数据存储。 然而,当超过FIFO缓冲器中的一些预定量的缓冲存储空间时,数据被写入附加数据存储器并从其中读出,并且优选地是具有用于保持数据存储设备的峰值性能的最佳尺寸的数据包,以及哪个 被写入数据存储设备,使得它们以先入先出(FIFO)地址序列排队。 优选地,以突发模式将数据写入DRAM并从DRAM读取。
    • 20. 发明授权
    • Method and system for network processor scheduling outputs using queueing
    • 使用排队的网络处理器调度输出的方法和系统
    • US06952424B1
    • 2005-10-04
    • US09548912
    • 2000-04-13
    • Brian Mitchell BassJean Louis CalvignacMarco C. HeddesMichael Steven SiegelFabrice Jean Verplanken
    • Brian Mitchell BassJean Louis CalvignacMarco C. HeddesMichael Steven SiegelFabrice Jean Verplanken
    • H04L12/28H04L12/56H04L29/06
    • H04L49/90
    • A system and method of moving information units from a network processor toward a data transmission network in a prioritized sequence which accommodates several different levels of service. The present invention includes a method and system for scheduling the egress of processed information units (or frames) from a network processing unit according to stored priorities associated with the various sources of the information units. The priorities in the preferred embodiment include a low latency service, a minimum bandwidth, a weighted fair queueing and a system for preventing a user from continuing to exceed his service levels over an extended period. The present invention includes a weighted fair queueing system where the position of the next service in a best efforts system for using bandwidth which is not used by committed bandwidth is determined based on the length of the frame and the weight of the particular flow. A “back pressure” system keeps a flow from being selected if its output cannot accept an additional frame because the current level of that port queue exceeds a threshold.
    • 一种将信息单元从网络处理器移动到数据传输网络的系统和方法,其以容纳几个不同级别的服务的优先顺序排列。 本发明包括一种方法和系统,用于根据存储的与信息单元的各种源相关联的优先级来调度来自网络处理单元的处理的信息单元(或帧)的出口。 优选实施例中的优先级包括低延迟服务,最小带宽,加权公平排队以及用于在较长时间内防止用户继续超过其服务水平的系统。 本发明包括一个加权公平排队系统,其中基于帧的长度和特定流的权重确定用于使用未被承诺带宽使用的带宽的最佳努力系统中的下一个服务的位置。 如果该端口队列的当前级别超过阈值,则“背压”系统的输出不能接受额外的帧,从而保持流量的选择。