会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Systems and methods for weighted best effort scheduling
    • 加权最佳努力调度的系统和方法
    • US20060233177A1
    • 2006-10-19
    • US11108485
    • 2005-04-18
    • Claude BassoJean CalvignacChih-jen ChangNatarajan VaidhyanathanFabrice Verplanken
    • Claude BassoJean CalvignacChih-jen ChangNatarajan VaidhyanathanFabrice Verplanken
    • H04L12/56H04L12/54
    • H04L47/568H04L45/00H04L45/60H04L47/50H04L47/527
    • Systems and methods for scheduling data packets in a network processor are disclosed. Embodiments provide a network processor that comprises a best-effort scheduler with a minimal calendar structure for addressing schedule control blocks. In one embodiment, a three-entry calendar structure provides for weighted best effort scheduling. Each of a plurality different flows has an associated schedule control block. Schedule control blocks are stored as linked lists in a last-in-first-out buffer. Each calendar entry is associated with a different linked list by storing in the calendar entry the address of the first-out schedule control block in the linked list. Each schedule control block has a counter and is assigned a weight according to the bandwidth priority of the flow to which the corresponding packet belongs. Each time a schedule control block is accessed from a last-in-first-out buffer storing the linked list, the scheduler generates a scheduling event and the counter of the schedule control block is incremented. When an incremented counter of a schedule control block equals its weight, the schedule control block is temporarily removed from further scheduling.
    • 公开了一种用于在网络处理器中调度数据分组的系统和方法。 实施例提供了一种网络处理器,其包括具有用于寻址日程控制块的最小日历结构的尽力而为调度器。 在一个实施例中,三入口日历结构提供加权最佳努力调度。 多个不同的流中的每一个具有相关的进度控制块。 计划控制块作为链表存储在先进先出缓冲区中。 通过在日历条目中存储链表中的先出时间表控制块的地址来将每个日历条目与不同的链表相关联。 每个调度控制块具有计数器,并根据相应分组所属的流的带宽优先级分配权重。 每当从存储链表的最先进先出缓冲器访问调度控制块时,调度器生成调度事件,并且调度控制块的计数器递增。 当调度控制块的递增计数器等于其权重时,调度控制块暂时从进一步调度中移除。
    • 8. 发明申请
    • Method for prevention of out-of-order delivery of data
    • 防止数据乱序传送的方法
    • US20050259659A1
    • 2005-11-24
    • US10850296
    • 2004-05-20
    • Claude BassoJean CalvignacNatarajan VaidhyanathanFabrice Verplanken
    • Claude BassoJean CalvignacNatarajan VaidhyanathanFabrice Verplanken
    • H04L12/56H04L29/06
    • H04L69/166H04L29/06H04L69/16
    • A method for sequencing delivery of information packets from a router having several processing elements to a receiving processing installation, wherein delivery of the packets must be completed in the order the packets arrive at the router. A linked list of packets is formed in the order they are received at the router, and each packet fragmented into successive fragments. Each fragment is processed at the router. The last fragment of each packet in each linked list is labeled with the sequence in which the packet was received, and enqueued in the order labeled for each last fragment on each linked list. Each fragment of each packet is delivered as processed, except the last fragment of each packet on its linked list to the receiving processor installation, and thereafter, transmitting the final fragment of each packet after processing only if that fragment is at the head of the queue.
    • 一种用于将信息分组从具有多个处理元件的路由器传送到接收处理设备的方法,其中分组的传送必须按分组到达路由器的顺序完成。 分组的链表以它们在路由器处接收的顺序形成,并且每个分组被分段成连续的片段。 每个片段在路由器处理。 每个链表中每个数据包的最后一个片段都标有接收数据包的顺序,并按照每个链表上每个最后一个片段标记的顺序排队。 每个分组的每个片段被处理,除了其链接列表上的每个分组的最后片段到接收处理器安装,然后在处理之后仅在该片段位于队列的头部时发送每个分组的最后片段 。