利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.039 秒)

    Weighted fair queue having adjustable scaling factor
    3.
    发明授权
    Weighted fair queue having adjustable scaling factor 失效
    加权公平队列具有可调缩放因子

    公开(公告)号：US07280474B2

    公开(公告)日：2007-10-09

    申请号：US10015760

    申请日：2001-11-01

    申请人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    发明人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    IPC分类号： H04L12/26 ,  H04L12/56

    CPC分类号： H04L47/2441 ,  H04L47/36 ,  H04L47/50 ,  H04L47/623

    摘要： A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied. The scheduling queue has a range R. Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is calculated for each flow according to the formula D=((WF×FS)/SF), where WF is a weighting factor applicable to a respective flow; FS is a frame size attributable to the respective flow; and SF is a scaling factor. The scaling factor SF is adjusted depending on a comparison of the distance D to the range R.

    摘要翻译： 网络处理器的调度器包括其中应用加权公平队列的调度队列。 调度队列具有范围R.流量与调度队列的当前指针距离D附加到调度队列。 根据公式D =（（WFxFS）/ SF）为每个流量计算距离D，其中WF是适用于相应流量的加权因子; FS是归因于相应流量的帧大小; SF是缩放因子。 根据距离D与范围R的比较来调整缩放因子SF。

    QoS scheduler and method for implementing quality of service with aging time stamps
    4.
    发明授权
    QoS scheduler and method for implementing quality of service with aging time stamps 失效

    公开(公告)号：US07103051B2

    公开(公告)日：2006-09-05

    申请号：US10002416

    申请日：2001-11-01

    申请人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    发明人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    IPC分类号： H04L12/56

    CPC分类号： H04L47/28 ,  H04L12/64 ,  H04L47/24 ,  H04L47/50 ,  H04L47/521 ,  H04L47/525 ,  H04L47/564 ,  H04L47/568

    摘要： A scheduler, scheduling method, and computer program product are provided for implementing Quality-of-Service (QoS) scheduling of a plurality of flows with aging time stamps. Subsets of time stamp data stored in a time stamp aging memory array are sequentially accessed. Each time stamp data subset contains time stamp data for a subplurality of flows. Guaranteed aging processing steps are performed for each flow utilizing the time stamp data subsets to identify and mark invalid calendar next time values. When a new frame arrival for an empty flow is identified, flow queue control block (FQCB) time stamp data and the flow time stamp data in the time stamp aging memory array are accessed. Based on the calendar to which the new frame is directed or the target calendar for the new frame, the target calendar next time valid bit of the time stamp aging memory array data is checked. When the target calendar next time valid bit is on, a target calendar next time value from the flow queue control block (FQCB) time stamp data is compared with a current time. When the target calendar next time is less than the current time, the target calendar next time valid bit is turned off to mark the target calendar next time as invalid. The guaranteed aging processing steps for each flow in the time stamp data subset includes checking a selection indicator of the time stamp aging memory array data for the flow to identify a calendar. Responsive to the selection indicator value, a calendar valid bit is checked. When the calendar valid bit is on, a calendar next time is compared with a current time. When the calendar next time is less than the current time, the calendar valid bit is turned off to mark the calendar next time as invalid. Invalid time stamp values are identified for all scheduler calendars.

    Method and apparatus for improving the fairness of new attaches to a weighted fair queue in a quality of service (QoS) scheduler
    5.
    发明授权
    Method and apparatus for improving the fairness of new attaches to a weighted fair queue in a quality of service (QoS) scheduler 失效
    用于提高服务质量（QoS）调度器中的加权公平队列的新附加的公平性的方法和装置

    公开(公告)号：US07257124B2

    公开(公告)日：2007-08-14

    申请号：US10102166

    申请日：2002-03-20

    申请人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    发明人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    IPC分类号： H04L12/56 ,  H04L12/26

    CPC分类号： H04L47/10 ,  H04L47/2441

    摘要： In a first aspect, a network processor includes a scheduler in which a scheduling queue is maintained. A last frame is dispatched from a flow queue maintained in the network processor, thereby emptying the flow queue. Data indicative of the size of the dispatched last frame is stored in association with the scheduler. A new frame corresponding to the emptied flow queue is received, and the flow corresponding to the emptied flow queue is attached to the scheduling queue. The flow is attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is determined based at least in part on the stored data indicative of the size of the dispatched last frame.

    摘要翻译： 在第一方面，网络处理器包括维护调度队列的调度器。 从网络处理器中维护的流队列调度最后一帧，从而清空流队列。 指示调度的最后一帧的大小的数据与调度器相关联地存储。 接收到与排空流队列对应的新帧，将与排空流队列对应的流附加到调度队列。 该流程与调度队列的当前指针距离D附加到调度队列。 至少部分地基于存储的指示调度的最后帧的大小的数据来确定距离D.

    Weighted fair queue having extended effective range
    6.
    发明授权
    Weighted fair queue having extended effective range 失效
    加权公平队列具有扩展的有效范围

    公开(公告)号：US07187684B2

    公开(公告)日：2007-03-06

    申请号：US10016518

    申请日：2001-11-01

    申请人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    发明人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    IPC分类号： H04L12/56

    CPC分类号： H04L47/623 ,  H04L47/50

    摘要： A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied to define a sequence in which flows are to be serviced. The scheduling queue includes at least a first subqueue and a second subqueue. The first subqueue has a first range and a first resolution, and the second subqueue has an extended range that is greater than the first range and a lower resolution that is less than the first resolution. Flows that are to be enqueued within the range of highest precision to the current pointer of the scheduling queue are attached to the first subqueue. Flows that are to be enqueued outside the range of highest precision from the current pointer of the scheduling queue are attached to the second subqueue. Numerous other aspects are provided.

    摘要翻译： 用于网络处理器的调度器包括调度队列，其中应用加权公平队列来定义要在其中服务流的序列。 调度队列至少包括第一子队列和第二子队列。 第一个子队列具有第一个范围和第一个分辨率，第二个子队列的扩展范围大于第一个范围，而较小的分辨率小于第一个分辨率。 要在最高精度范围内排队的流程将调度队列的当前指针附加到第一个子队列。 要从排队队列的当前指针以外的最高精度范围排队的流量被附加到第二子队列。 提供了许多其他方面。

    QoS scheduler and method for implementing peak service distance using next peak service time violated indication
    7.
    发明授权
    QoS scheduler and method for implementing peak service distance using next peak service time violated indication 失效
    QoS调度器和使用下一个峰值服务时间实现峰值服务距离的方法违反指示

    公开(公告)号：US06973036B2

    公开(公告)日：2005-12-06

    申请号：US10004373

    申请日：2001-11-01

    申请人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    发明人： William John Goetzinger ,  Glen Howard Handlogten ,  James Francis Mikos ,  David Alan Norgaard

    IPC分类号： H04B17/00 ,  H04L12/26 ,  H04L12/54 ,  H04L12/863 ,  H04L12/873 ,  H04L12/875 ,  H04L12/877

    CPC分类号： H04L47/623 ,  H04L47/50 ,  H04L47/521 ,  H04L47/525 ,  H04L47/568

    摘要： A scheduler and scheduling method implement peak service distance using a next peak service time violated (NPTV) indication. A flow scheduled on a best effort or weighted fair queue (WFQ) is identified for servicing and a frame is dispatching from the identified flow. A next PSD time (NPT) being violated is checked for the flow. Responsive to identifying the next PSD time (NPT) being violated for the identified flow, a NPTV indicator is set. Alternatively, responsive to identifying the next PSD time (NPT) not being violated for the identified flow, the NPTV indicator is reset. A next PSD time (NPT) value is calculated for the flow. Checking for more frames to be dispatched from the flow is performed. Responsive to identifying no more frames to be dispatched from the flow, the NPTV indicator is utilized to identify a calendar for attaching the flow upon a new frame arrival for the flow. If the NPTV indicator is not set when the flow goes empty, upon a new frame arrival for the flow, the flow is attached to a weighted fair queue (WFQ) ring using a queue distance calculation. If the NPTV indicator is set when the flow goes empty, upon a new frame arrival for the flow, then it is determined if the next PSD time (NPT) value for the flow has been passed. If the next PSD time (NPT) value has been passed, then the flow is attached to the weighted fair queue (WFQ) ring using the queue distance calculation. If the next PSD time (NPT) value has not been passed, then the flow is attached to a peak bandwidth service (PBS) calendar using the next PSD time (NPT) value.

    摘要翻译： 调度器和调度方法使用下一个高峰服务时间违反（NPTV）指示来实现峰值服务距离。 确定以最佳努力或加权公平队列（WFQ）计划的流量进行维修，并从识别的流程中分派一个帧。 检查下一个违反PSD时间（NPT）的流程。 响应于识别针对所识别的流程违反的下一个PSD时间（NPT），设置NPTV指示符。 或者，响应于识别未被识别的流量的下一个PSD时间（NPT），NPTV指示符被重置。 为流量计算下一个PSD时间（NPT）值。 执行检查要从流中分派的更多帧。 响应于不再从流中发送更多的帧，NPTV指示符用于识别用于在流的新帧到达时附加流的日历。 如果在流量为空时NPTV指示灯未设置，则在新的帧到达流时，流程将使用队列距离计算附加到加权公平队列（WFQ）环。 如果在流量为空时设置了NPTV指示符，则在新的帧到达流时，确定流的下一个PSD时间（NPT）值是否已经通过。 如果下一个PSD时间（NPT）值已经通过，则流程将使用队列距离计算附加到加权公平队列（WFQ）环。 如果未通过下一个PSD时间（NPT）值，则使用下一个PSD时间（NPT）值将该流量附加到峰值带宽服务（PBS）日历。