-
公开(公告)号：US20060029080A1
公开(公告)日：2006-02-09
申请号：US11070932
申请日：2005-03-03
申请人： Christopher Kappler , Anna Charny , Robert Olsen , Earl Cohen
发明人： Christopher Kappler , Anna Charny , Robert Olsen , Earl Cohen
IPC分类号： H04L12/28
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/60 , Y02D50/10
摘要： Schedules may use burst tolerance values to adjust the scheduling in a time-based schedule, such as, but not limited to, adjusting for accumulated but not used bandwidth, and/or adjusting eligibility of schedule entries. A best schedule item associated with an eligible schedule entry of a schedule is identified. Whether or not a particular schedule entry is eligible is typically determined based on the relationship of an associated timestamp with a current scheduling time, such as its timestamp being less than or equal to the current time. A burst tolerance time bound might also be used to allow certain priorities and/or types of items to be considered eligible if even its timestamp exceeds the current time by an amount, but less than or equal to the burst tolerance time bound. When a schedule entry which has been dormant becomes active, its one or more timestamps are typically initialized, which may include setting at least one of these timestamps behind current time by a wakeup burst tolerance value to guarantee its immediate eligibility for one or more consecutive scheduling iterations.
摘要翻译： 时间表可以使用突发容忍值来调整基于时间的时间表中的调度，例如但不限于调整累积但未使用的带宽，和/或调整调度条目的资格。 识别与计划的合格日程表项相关联的最佳计划项目。 通常基于相关联的时间戳与当前调度时间（例如其时间戳小于或等于当前时间）的关系来确定特定调度条目是否合格。 如果即使其时间戳超过当前时间但小于或等于突发容忍时间限制，则突发公差时间限制也可用于允许某些优先级和/或类型的项目被认为是合格的。 当已经休眠的调度项目变为活动时，其一个或多个时间戳通常被初始化，其可以包括将当前时间后面的这些时间戳中的至少一个设置为唤醒突发容忍值，以保证其立即符合一个或多个连续调度 迭代。
-
公开(公告)号：US20060153243A1
公开(公告)日：2006-07-13
申请号：US11022220
申请日：2004-12-23
申请人： Doron Shoham , Christopher Kappler , Anna Charny , Earl Cohen , Robert Olsen
发明人： Doron Shoham , Christopher Kappler , Anna Charny , Earl Cohen , Robert Olsen
IPC分类号： H04J3/06
CPC分类号： H04L47/564 , H04L47/50
摘要： Eligible entries are scheduled using an approximated finish delay identified for an entry based on an associated speed group. One implementation maintains schedule entries, each respectively associated with a start time and a speed group. Each speed group is associated with an approximated finish delay. An approximated earliest finishing entry from the eligible schedule entries is determined that has an earliest approximated finish time, with the approximated finish time of an entry being determined based on the entry's start time and the approximated finish delay of the associated speed group. The scheduled action corresponding to the approximated earliest finishing entry is then typically performed. The action performed may, for example, correspond to the forwarding of one or more packets, an amount of processing associated with a process or thread, or any activity associated with an item.
-
3.发明申请Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权在分级调度中调度层之间的最小保证调度速率的传播公开(公告)号：US20050152374A1
公开(公告)日：2005-07-14
申请号：US11022246
申请日：2004-12-23
申请人： Earl Cohen , Robert Olsen , Christopher Kappler , Anna Charny
发明人： Earl Cohen , Robert Olsen , Christopher Kappler , Anna Charny
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/60
摘要： Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, which may include or be used with a hierarchy of schedules with propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.
摘要翻译： 公开的方法，装置，数据结构，计算机可读介质和机制，其可以包括或者与具有在分级调度中的调度层之间的最小保证调度速率的传播的调度层级一起使用。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的（例如，基于该类流量的活动流量，用于该类流量的活动服务）或静态配置。 一个实施例还包括用于调度项目的多个调度通道，诸如但不限于分组或其指示，使得不同类别的业务（例如，传播的最小保证调度速率，非传播最小保证调度速率，高优先级，超量 调度项目的速率等）可以相应地通过调度层次传播，而不会被阻塞在较低优先级或不同类型的业务量之上。
-
公开(公告)号：US07417999B1
公开(公告)日：2008-08-26
申请号：US10758547
申请日：2004-01-14
申请人： Anna Charny , Christopher Kappler , Robert Olsen
发明人： Anna Charny , Christopher Kappler , Robert Olsen
IPC分类号： H04L12/66
摘要： Priority propagation is achieved in the context of a rate-based scheduling hierarchy. Priority traffic is not delayed by non-priority traffic by more than the duration required for transmission of the maximum packet length at the physical interface speed. Multiple sibling priority levels are supported. To achieve these objectives, the scheduling hierarchy tree is divided into sub-trees corresponding to non-priority traffic and the different levels of priority. At each scheduling decision, a packet is selected from the highest priority non-empty sub-tree. Scheduling decisions within each sub-tree exploit the usual rate-based scheduling method but without priority propagation. When a packet from a priority sub-tree is chosen, scheduling state in the non-priority sub-tree is updated.
摘要翻译： 在基于速率的调度层次结构的上下文中实现优先级传播。 优先流量不被非优先流量延迟超过在物理接口速度下传输最大分组长度所需的持续时间。 支持多个同级优先级。 为了实现这些目标，调度层次树被划分为对应于非优先流量和不同优先级别的子树。 在每个调度决策中，从最高优先级非空子树中选择分组。 每个子树内的调度决策利用了通常的基于速率的调度方法，但没有优先级传播。 当选择来自优先级子树的分组时，更新非优先级子树中的调度状态。
-
5.发明授权2-rate scheduling based on search trees with configurable excess bandwidth sharing 有权基于具有可配置的过量带宽共享的搜索树的2速率调度公开(公告)号：US07567572B1
公开(公告)日：2009-07-28
申请号：US10754970
申请日：2004-01-09
申请人： Anna Charny , Robert Olsen
发明人： Anna Charny , Robert Olsen
CPC分类号： H04L47/521 , H04L47/215 , H04L47/50 , H04L47/562 , H04L47/568 , H04L47/60 , H04L47/627
摘要： Systems and methods for two-rate scheduling over a class hierarchy wherein controlled rates are delivered in a smooth manner, even over short time intervals. A minimum rate scheduler and an excess rate scheduler are employed. The minimum rate scheduler and/or the excess rate scheduler, employ special binary search trees to make selections at each parent node in the class hierarchy.
摘要翻译： 在班级层次上进行双速率调度的系统和方法，即使在短时间间隔内，以顺利的方式传送受控速率。 采用最小速率调度器和超速调度器。 最小速率调度器和/或超速率调度器使用特殊的二叉搜索树来在类层次结构中的每个父节点进行选择。
-
6.发明授权Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权在分级调度中调度层之间的最小保证调度速率的传播公开(公告)号：US08325736B2
公开(公告)日：2012-12-04
申请号：US12426245
申请日：2009-04-18
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/60
摘要： A hierarchy of schedules propagate minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.
摘要翻译： 调度层级在分层调度中传播调度层中的最小保证调度速率。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的（例如，基于该类流量的活动流量，用于该类流量的活动服务）或静态配置。 一个实施例还包括用于调度项目的多个调度通道，诸如但不限于分组或其指示，使得不同类别的业务（例如，传播的最小保证调度速率，非传播最小保证调度速率，高优先级，超量 调度项目的速率等）可以相应地通过调度层次传播，而不会被阻塞在较低优先级或不同类型的业务量之上。
-
公开(公告)号：US08077618B2
公开(公告)日：2011-12-13
申请号：US11070932
申请日：2005-03-03
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/60 , Y02D50/10
摘要： Schedules may use burst tolerance values to adjust the scheduling in a time-based schedule, such as, but not limited to, adjusting for accumulated but not used bandwidth, and/or adjusting eligibility of schedule entries. A best schedule item associated with an eligible schedule entry of a schedule is identified. Whether or not a particular schedule entry is eligible is typically determined based on the relationship of an associated timestamp with a current scheduling time, such as its timestamp being less than or equal to the current time. A burst tolerance time bound might also be used to allow certain priorities and/or types of items to be considered eligible if even its timestamp exceeds the current time by an amount, but less than or equal to the burst tolerance time bound. When a schedule entry which has been dormant becomes active, its one or more timestamps are typically initialized, which may include setting at least one of these timestamps behind current time by a wakeup burst tolerance value to guarantee its immediate eligibility for one or more consecutive scheduling iterations.
摘要翻译： 时间表可以使用突发容忍值来调整基于时间的时间表中的调度，例如但不限于调整累积但未使用的带宽，和/或调整调度条目的资格。 识别与计划的合格日程表项相关联的最佳计划项目。 通常基于相关联的时间戳与当前调度时间（例如其时间戳小于或等于当前时间）的关系来确定特定调度条目是否合格。 如果即使其时间戳超过当前时间但小于或等于突发容忍时间限制，则突发公差时间限制也可用于允许某些优先级和/或类型的项目被认为是合格的。 当已经休眠的调度项目变为活动时，其一个或多个时间戳通常被初始化，其可以包括将当前时间后面的这些时间戳中的至少一个设置为唤醒突发容忍值，以保证其立即符合一个或多个连续调度 迭代。
-
8.发明申请公开(公告)号：US20090207846A1
公开(公告)日：2009-08-20
申请号：US12426245
申请日：2009-04-18
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/60
摘要： A hierarchy of schedules propagate minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.
摘要翻译： 调度层级在分层调度中传播调度层中的最小保证调度速率。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的（例如，基于该类流量的活动流量，用于该类流量的活动服务）或静态配置。 一个实施例还包括用于调度项目的多个调度通道，诸如但不限于分组或其指示，使得不同类别的业务（例如，传播的最小保证调度速率，非传播最小保证调度速率，高优先级，超量 调度项目的速率等）可以相应地通过调度层次传播，而不会被阻塞在较低优先级或不同类型的业务量之上。
-
9.发明授权Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权在分级调度中调度层之间的最小保证调度速率的传播公开(公告)号：US07522609B2
公开(公告)日：2009-04-21
申请号：US11022246
申请日：2004-12-23
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/60
摘要： Methods, apparatus, data structures, computer-readable media, and mechanisms may include or be used with a hierarchy of schedules with propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.
摘要翻译： 方法，装置，数据结构，计算机可读介质和机制可以包括或者与分级调度中的调度层中具有最小保证调度速率的传播的调度层次结合使用。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的（例如，基于该类流量的活动流量，用于该类流量的活动服务）或静态配置。 一个实施例还包括用于调度项目的多个调度通道，诸如但不限于分组或其指示，使得不同类别的业务（例如，传播的最小保证调度速率，非传播最小保证调度速率，高优先级，超量 调度项目的速率等）可以相应地通过调度层次传播，而不会被阻塞在较低优先级或不同类型的业务量之上。
-
公开(公告)号：US07385987B1
公开(公告)日：2008-06-10
申请号：US10357878
申请日：2003-02-04
申请人： Anna Charny , Robert Olsen
发明人： Anna Charny , Robert Olsen
CPC分类号： H04L47/568 , H04L47/50 , H04L47/525 , H04L47/60
摘要： A scheduling method for a multi-level class hierarchy includes inserting all queues containing at least one packet in a first scheduler and inserting into a second scheduler queues contained in the first scheduler which do not exceed their maximum rate. The first scheduler is dequeued until a queue exceeding a maximum rate of the queue is reached, at which time a queue of the second scheduler is dequeued.
摘要翻译： 用于多级类层次的调度方法包括将包含至少一个分组的所有队列插入到第一调度器中并插入到不超过其最大速率的第一调度器中包含的第二调度器队列中。 第一个调度程序出队，直到达到超过队列的最大速率的队列，此时第二个调度程序的队列出队。
-
-
-
-
-
-
-
-
-
搜索结果
69 条记录 (耗时 0.024 秒)