会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 44. 发明授权
    • Processor with scheduler architecture supporting multiple distinct scheduling algorithms
    • 具有调度器架构的处理器,支持多种不同的调度算法
    • US07477636B2
    • 2009-01-13
    • US10722933
    • 2003-11-26
    • Asif Q. KhanDavid B. KramerDavid P. Sonnier
    • Asif Q. KhanDavid B. KramerDavid P. Sonnier
    • H04B7/212
    • H04L47/2441H04L47/22H04L47/50H04L47/522H04L47/568H04L47/58H04L2012/5679
    • A processor includes a scheduler operative to schedule data blocks for transmission from a plurality of queues or other transmission elements, utilizing at least a first table and a second table. The first table may comprise at least first and second first-in first-out (FIFO) lists of entries corresponding to transmission elements for which data blocks are to be scheduled in accordance with a first scheduling algorithm, such as a weighted fair queuing scheduling algorithm. The scheduler maintains a first table pointer identifying at least one of the first and second lists of the first table as having priority over the other of the first and second lists of the first table. The second table includes a plurality of entries corresponding to transmission elements for which data blocks are to be scheduled in accordance with a second scheduling algorithm, such as a constant bit rate or variable bit rate scheduling algorithm.
    • 处理器包括调度器,其利用至少第一表和第二表来调度用于从多个队列或其他传输元件传输的数据块。 第一表可以包括对应于根据第一调度算法(例如加权公平排队调度算法)对数据块进行调度的传输元件的条目的至少第一和第二先进先出(FIFO)列表 。 调度器维护第一表指针,其将第一表的第一列表和第二列表中的至少一个列表标识为优先于第一表的第一和第二列表中的另一列。 第二表包括对应于根据诸如恒定比特率或可变比特率调度算法的第二调度算法对其数据块进行调度的传输元件的多个条目。
    • 46. 发明授权
    • Method and system for selecting connections to bump based on priority in a network
    • 根据网络中的优先级选择碰撞连接的方法和系统
    • US07443792B2
    • 2008-10-28
    • US10928253
    • 2004-08-27
    • Sandeep DharAshwin Raj MadhwarajPuneet Gupta
    • Sandeep DharAshwin Raj MadhwarajPuneet Gupta
    • H04L12/56
    • H04L47/805H04L47/15H04L47/2425H04L47/32H04L47/70H04L47/745H04L47/765H04L2012/5651H04L2012/5679
    • A method and system for selecting connections to bump based on priority in a network. The present invention describes a method for selecting connections to bump in a network to accommodate an incoming connection. The method begins by receiving an incoming connection that is associated with a priority level and a bandwidth group. A plurality of existing connections is indexed by priority level and bandwidth group. A required bandwidth is calculated that is necessary to support the incoming connection. Then, a single existing connection is selected to be released from the plurality of existing connections that is associated with a lower priority and a higher bandwidth group than the incoming connection. If a single connection cannot be selected, then at least one existing connection is selected to be released having a lower priority level and at least the same bandwidth group than that of the incoming connection.
    • 一种基于网络中优先级选择连接到连接的方法和系统。 本发明描述了一种用于选择网络中的碰撞连接以适应传入连接的方法。 该方法通过接收与优先级和带宽组相关联的传入连接开始。 多个现有连接由优先级和带宽组索引。 计算支持传入连接所必需的带宽。 然后,选择从与进入连接相比较的较低优先级和较高带宽组的多个现有连接中释放单个现有连接。 如果不能选择单个连接,则选择要发布的至少一个现有连接具有较低优先级和至少与传入连接相同的带宽组。
    • 48. 发明申请
    • METHOD AND APPARATUS FOR HIERARCHIAL SCHEDULING OF VIRTUAL PATHS WITH UNDERUTILIZED BANDWIDTH
    • 虚拟带路由不均匀带宽分层调度方法与装置
    • US20080159297A1
    • 2008-07-03
    • US12044994
    • 2008-03-09
    • Lyle Edwin GrosbachGlen Howard HandlogtenJames Francis MikosDavid Alan Norgaard
    • Lyle Edwin GrosbachGlen Howard HandlogtenJames Francis MikosDavid Alan Norgaard
    • H04L12/56
    • H04L47/50H04L2012/5679
    • A method and apparatus are provided for implementing hierarchical scheduling of oversubscribed virtual paths with underutilized bandwidth that works for both ATM (cell) and IP (frame) scheduling. A scheduler includes a first calendar for pipes and autonomous flows and a second calendar for pipe flows. A winner of a pipe or an autonomous flow is identified from the first calendar. Responsive to an identified winner pipe, a pipe queue is checked for an associated pipe flow for the winner pipe. Responsive to identifying an empty pipe queue for the winner pipe, a pipe win credit is assigned to the pipe without reattaching the winner pipe to the first calendar. Then a next winner is identified from the first calendar. When a winner pipe flow is identified from the second calendar and the pipe win credit is assigned to the pipe for the winner pipe flow, then the winner pipe flow is serviced without delay.
    • 提供了一种方法和装置,用于实现对于ATM(小区)和IP(帧)调度工作的未充分利用的带宽的超额预订虚拟路径的分层调度。 调度器包括用于管道和自主流的第一日历和用于管道流的第二日历。 从第一个日历识别管道或自主流的获胜者。 对于确定的胜利者管道,检查管道队列以获得胜利管道的相关管道流量。 响应于为胜利者管道识别空管道队列,将管道赢取信用额度分配给管道,而不将胜利者管道重新连接到第一个日历。 然后从第一个日历识别下一个赢家。 当从第二个日历识别获胜者管道流量,并且将管道信贷分配给胜利者管道的管道时,优胜者管道流程将被无延误地维护。