专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07606158B2 Hierarchical flow control for router ATM interfaces 有权
标题翻译：路由器ATM接口的分层流控制
公开(公告)号：US07606158B2
公开(公告)日：2009-10-20
申请号：US10949916
申请日：2004-09-24
申请人： Guy C. Fedorkow , Kenneth H. Potter, Jr. , Mark A. Gustlin , Christopher J. Kappler , Robert T. Olsen
发明人： Guy C. Fedorkow , Kenneth H. Potter, Jr. , Mark A. Gustlin , Christopher J. Kappler , Robert T. Olsen
IPC分类号： H04J1/16
CPC分类号： H04L47/10 , H04L12/5601 , H04L47/266 , H04L2012/562 , H04L2012/5679 , H04L2012/5681
摘要： Presently disclosed is an apparatus and method for returning control of bandwidth allocation and packet scheduling to the routing engine in a network communications device containing an ATM interface. Virtual circuit (VC) flow control is augmented by the addition of a second flow control feedback signal from each virtual path (VP). VP flow control is used to suspend scheduling of all VCs on a given VP when traffic has accumulated on enough VCs to keep the VP busy. A new packet segmenter is employed to segment traffic while preserving the first in, first out (FIFO) order in which packet traffic was received. Embodiments of the invention may be implemented using a two-level (per-VC and per-VP) scheduling hierarchy or may use as many levels of flow control feedback-derived scheduling as may be necessitated by multilevel scheduling hierarchies.
摘要翻译：现在公开的是一种用于在包含ATM接口的网络通信设备中将带宽分配和分组调度的控制返回到路由引擎的装置和方法。通过从每个虚拟路径（VP）添加第二流量控制反馈信号来增加虚拟电路（VC）流量控制。当流量累积在足够的VC上以保持VP忙时，VP流控制用于暂停给定VP上所有VC的调度。采用新的分组分段器来分段业务，同时保持接收到分组业务的先入先出（FIFO）顺序。可以使用两级（每VC和每VP）调度层次来实现本发明的实施例，或者可以使用多级调度层次可能需要的流控制反馈导出调度级别。

2. 发明授权

US07277448B1 Hierarchical scheduler inter-layer eligibility deferral 有权
标题翻译：分级调度程序层间资格推迟
公开(公告)号：US07277448B1
公开(公告)日：2007-10-02
申请号：US10608795
申请日：2003-06-27
申请人： Andrew A. Long , Christopher J. Kappler , Robert T. Olsen
发明人： Andrew A. Long , Christopher J. Kappler , Robert T. Olsen
IPC分类号： H04L12/56
CPC分类号： H04L47/60 , H04L47/50
摘要： Conventional schedulers propagate entries by either polling until an entry is ready, or alternatively, by attaching a so-called “readiness time” to entries. A scheduler which recognizes the readiness time avoids consuming a parent schedule with polling, or with burdening entries with a future readiness time. The system of the present invention employs a deferral queue for deferring entries in response to pop requests from a parent schedule. The child schedule defers entries via the deferral queue when it is not ready to push an entry to the parent schedule, and sets the readiness time corresponding to the entry. Upon the expiration of the readiness time, the child schedule redetermines whether to push the deferred entry corresponding to the deferral queue or optionally to push an interim entry having since arrived. Accordingly, a child schedule receiving a pop requests retains the ability to push an entry at an earlier or later readiness time, and further retains the ability to reconsider which entry to push.
摘要翻译：常规的调度器通过轮询来传播条目，直到条目准备好，或者通过将所谓的“就绪时间”附加到条目。识别准备时间的调度器避免了通过轮询消耗父进程，或者在未来准备时间的负担较重的条目中。本发明的系统采用延迟队列来响应来自父调度的流行请求来推迟条目。当子计划未准备好将条目推送到父计划时，通过延期队列来延迟条目，并设置对应于条目的准备时间。在准备时间期满之后，子时间表重新确定是否推送与延期队列相对应的延期条目，或者可选地推动自从到达之后的临时条目。因此，接收流行请求的子日程表保留在较早或稍后的准备时间推送条目的能力，并且还保留重新考虑要推送哪个条目的能力。

3. 发明授权

US07433953B1 Methods and apparatus for reducing arbitration delay in channelized systems by use of additional scheduling hierarchy 有权
标题翻译：通过使用额外的调度层次来减少信道化系统仲裁延迟的方法和装置
公开(公告)号：US07433953B1
公开(公告)日：2008-10-07
申请号：US10422167
申请日：2003-04-24
申请人： Christopher J. Kappler , Gregory S. Goss , Andrew T. Hebb , Robert T. Olsen
发明人： Christopher J. Kappler , Gregory S. Goss , Andrew T. Hebb , Robert T. Olsen
IPC分类号： G06F15/173 , G06F11/00
CPC分类号： H04L47/805 , H04L47/10 , H04L47/70 , H04L47/803 , H04L47/828
摘要： A data communications device interconnected for channelized communication overcomes the problems associated with message traffic starvation on outgoing traffic channels by forming arbitration, or speed groups of logical interfaces and allocating scheduling resources in proportion to the bandwidth attributed to each group relative to the total bandwidth of the device. Incoming messages have a transmission rate based on QOS, content type, or other constraints. A categorizer determines arbitration groups of the outgoing messages based on the transmission rate of the message. The scheduler allocates dequeue requests among the groups according to the proportion allocated to the arbitration group. A dequeue manager drains the outgoing messages from the arbitration groups at a rate in proportion to the total percentage of outgoing transmission bandwidth represented by the group by selecting a message from among the arbitration groups according to the computed proportion.
摘要翻译：互联的信道化通信的数据通信设备通过形成仲裁来克服与输出业务信道上的消息流量饥饿相关的问题，或者组合逻辑接口的速度组，并且根据与每个组相对于每个组的总带宽成比例的带宽分配调度资源设备。传入消息具有基于QOS，内容类型或其他约束的传输速率。分类者基于消息的传输速率来确定传出消息的仲裁组。调度员根据分配给仲裁组的比例，在组中分配出队请求。根据所计算出的比例，从出现的仲裁组中通过从仲裁组中选择一个消息，排队管理员以与该组所表示的传出传输带宽的总百分比成比例的比例排出来自仲裁组的传出消息。

4. 发明授权

US07321940B1 Iterative architecture for hierarchical scheduling 有权
标题翻译：层次调度的迭代架构
公开(公告)号：US07321940B1
公开(公告)日：2008-01-22
申请号：US10610181
申请日：2003-06-30
申请人： Scott C. Smith , Christopher J. Kappler , Andrew T. Hebb , Gregory S. Goss , Robert T. Olsen
发明人： Scott C. Smith , Christopher J. Kappler , Andrew T. Hebb , Gregory S. Goss , Robert T. Olsen
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L47/60 , H04L47/10 , H04L47/50 , H04L47/522 , H04L47/625
摘要： Conventional schedulers employ designs allocating specific processor and memory resources, such as memory for configuration data, state data, and scheduling engine processor resources for specific aspects of the scheduler, such as layers of the scheduling hierarchy, each of which consumes dedicated processor and memory resources. A generic, iterative scheduling engine, applicable to an arbitrary scheduling hierarchy structure having a variable number of hierarchy layers, receives a scheduling hierarchy structure having a predetermined number of layers, and allocates scheduling resources such as instructions and memory, according to scheduling logic, in response to design constraints and processing considerations. The resulting scheduling logic processes the scheduling hierarchy in iterative manner which allocates the available resources among the layers of the hierarchy, such that the scheduler achieves throughput requirements corresponding to enqueue and dequeue events with consideration to the number of layers in the scheduling hierarchy and the corresponding granularity of queuing.
摘要翻译：常规调度器采用分配特定处理器和存储器资源的设计，例如用于配置数据的存储器，状态数据和调度器的特定方面的调度引擎处理器资源，诸如调度层次结构的层，每层消耗专用处理器和存储器资源。适用于具有可变数量层级层次的任意调度层次结构的通用迭代调度引擎接收具有预定层数的调度层次结构，并根据调度逻辑分配诸如指令和存储器的调度资源，响应设计约束和处理考虑。所得到的调度逻辑以迭代方式处理调度层次，其分配层次结构的层之间的可用资源，使得调度器考虑到调度层次结构中的层数和相应的调度器来实现对应于入队和出队事件的吞吐量要求排队的粒度

5. 发明授权

US07500009B2 Rate computations of particular use in scheduling activities or items such as the sending of packets 有权
标题翻译：在调度活动或诸如发送数据包的项目中的特定用途的速率计算
公开(公告)号：US07500009B2
公开(公告)日：2009-03-03
申请号：US10777607
申请日：2004-02-11
申请人： Earl T. Cohen , Christopher J. Kappler
发明人： Earl T. Cohen , Christopher J. Kappler
IPC分类号： G06F15/16
CPC分类号： H04L47/10 , H04L47/215 , H04L47/22 , H04L47/527
摘要： Rate computations are performed such as for use in scheduling activities, such as, but not limited to packets, processes, traffic flow, etc. One implementation identifies an approximated inverse rate, a fix-up adjustment value, and a quantum. An activity measurement value is maintained based on a measure of activity, and a rate control value is maintained based on the measure of activity and the approximated inverse rate. The fix-up adjustment value is applied once each quantum to the rate control value to maintain rate accuracy of the activity. In one implementation, the control value is a scheduling value used for determining when to perform a next part of the activity (e.g., send one or more packets). Scheduling rates are efficiently and compactly stored in an inverse form, which may have advantages in terms of rate granularity, accuracy, and the ability to deliver service smoothly.
摘要翻译：执行速率计算，例如用于调度活动，例如但不限于分组，进程，业务流程等。一个实现标识近似的反向速率，修正调整值和量子。基于活动度量维持活动测量值，并且基于活动度量和近似反向率来维持速率控制值。固定调整值每一个量程应用于速率控制值，以保持活动的速率准确性。在一个实现中，控制值是用于确定何时执行活动的下一部分（例如，发送一个或多个分组）的调度值。调度速率以反向形式被有效和紧凑地存储，这可以在速率粒度，准确度和顺利地提供服务的能力方面具有优点。

6. 发明授权

US07599381B2 Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group 有权
标题翻译：使用基于相关联的速度组为入口标识的近似完成延迟来计划合格条目
公开(公告)号：US07599381B2
公开(公告)日：2009-10-06
申请号：US11022220
申请日：2004-12-23
申请人： Doron Shoham , Christopher J. Kappler , Anna Charny , Earl T. Cohen , Robert Olsen
发明人： Doron Shoham , Christopher J. Kappler , Anna Charny , Earl T. Cohen , Robert Olsen
IPC分类号： H04L12/56 , H04L12/28
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.
摘要翻译：使用基于相关联的速度组为入口识别的近似完成延迟来安排合格条目。一个实现维护计划条目，每个进度条目分别与开始时间和速度组相关联。每个速度组与近似的完成延迟相关联。确定具有最早近似完成时间的合格调度条目中的近似最早的整理条目，其中基于条目的开始时间和相关联的速度组的近似完成延迟来确定条目的近似完成时间。然后通常执行与近似最早的完成条目相对应的调度动作。执行的动作可以例如对应于一个或多个分组的转发，与进程或线程相关联的处理量或与项目相关联的任何活动。

7. 发明授权

US5926459A Rate shaping in per-flow queued routing mechanisms for available bit rate service 失效
标题翻译：针对可用比特率服务的每流队列路由机制中的速率整形
公开(公告)号：US5926459A
公开(公告)日：1999-07-20
申请号：US872753
申请日：1997-06-11
申请人： J. Bryan Lyles , Landis C. Rogers , Christopher J. Kappler
发明人： J. Bryan Lyles , Landis C. Rogers , Christopher J. Kappler
IPC分类号： H04L12/56 , H04Q11/04 , H04J3/14
CPC分类号： H04L12/5602 , H04Q11/0478 , H04L2012/5635 , H04L2012/5636 , H04L2012/5651 , H04L2012/568
摘要： Rate shaping is provided in per-flow queued routing mechanisms for available bit rate service. A traffic shaper in a packet switched communications system serially emits packets of time multiplexed flows in substantial compliance with individual network traffic contracts for the respective flows. The individual network traffic contracts include contracts which specify respective peak packet emission rates and associated peak rate tolerances for certain of the flows and which cause each of the flows to fall into mutually exclusive categories. The traffic shaper includes a queuing mechanism and a scheduling mechanism. The queuing mechanism organizes pending packets of active flows, including the certain flows, in respective queues in accordance with an oldest pending packet at head of queue order. The scheduling mechanism is coupled to the queuing mechanism for scheduling the packets of the active flows for emission. The scheduling mechanism includes a relatively high priority non-work conserving calendar queue, at least one relatively low priority work conserving queue, and another non-working conserving calendar queue of indeterministic priority relative to the high and low priority queues. The scheduling mechanism can also include a control mechanism for monitoring emissions from the high and low priority queues and for selectively descheduling packets scheduled on the high and low priority queues.
摘要翻译：在可用比特率服务的每流排队路由机制中提供速率整形。分组交换通信系统中的流量整形器基本上符合相应流的各个网络流量合同，串行发送时间复用流的分组。单独的网络流量合同包括指定相应的峰值分组排放率和某些流量的相关峰值速率容限的合同，并且导致每个流落入相互排斥的类别。流量整形器包括排队机构和调度机制。排队机构根据队列顺序前的最旧的挂起分组，在相应的队列中组织包括某些流的有效流的未决分组。调度机制耦合到排队机制，用于调度用于发射的活动流的分组。调度机制包括相对高优先级的非工作保存日历队列，至少一个相对较低优先级的工作节省队列，以及相对于高优先级队列和低优先级队列的不确定优先级的另一非工作保存日历队列。调度机制还可以包括用于监视来自高优先级队列和低优先级队列的发射的控制机制，并且用于选择性地排列在高优先级队列和低优先级队列上调度的分组。

8. 发明授权

US08325736B2 Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权
标题翻译：在分级调度中调度层之间的最小保证调度速率的传播
公开(公告)号：US08325736B2
公开(公告)日：2012-12-04
申请号：US12426245
申请日：2009-04-18
申请人： Earl T. Cohen , Robert Olsen , Christopher J. Kappler , Anna Charny
发明人： Earl T. Cohen , Robert Olsen , Christopher J. Kappler , Anna Charny
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. 发明授权

US08077618B2 Using burst tolerance values in time-based schedules 有权
标题翻译：在基于时间的计划中使用突发公差值
公开(公告)号：US08077618B2
公开(公告)日：2011-12-13
申请号：US11070932
申请日：2005-03-03
申请人： Christopher J. Kappler , Anna Charny , Robert Olsen , Earl T. Cohen
发明人： Christopher J. Kappler , Anna Charny , Robert Olsen , Earl T. Cohen
IPC分类号： H04L12/26 , H04L12/28 , H04L12/56
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.
摘要翻译：时间表可以使用突发容忍值来调整基于时间的时间表中的调度，例如但不限于调整累积但未使用的带宽，和/或调整调度条目的资格。识别与计划的合格日程表项相关联的最佳计划项目。通常基于相关联的时间戳与当前调度时间（例如其时间戳小于或等于当前时间）的关系来确定特定调度条目是否合格。如果即使其时间戳超过当前时间但小于或等于突发容忍时间限制，则突发公差时间限制也可用于允许某些优先级和/或类型的项目被认为是合格的。当已经休眠的调度项目变为活动时，其一个或多个时间戳通常被初始化，其可以包括将当前时间后面的这些时间戳中的至少一个设置为唤醒突发容忍值，以保证其立即符合一个或多个连续调度迭代。

10. 发明申请

US20090207846A1 PROPAGATION OF MINIMUM GUARANTEED SCHEDULING RATES AMONG SCHEDULING LAYERS IN A HIERARCHICAL SCHEDULE 有权
标题翻译：在层次分析表中调度层的最小保证调度率的传播
公开(公告)号：US20090207846A1
公开(公告)日：2009-08-20
申请号：US12426245
申请日：2009-04-18
申请人： Earl T. Cohen , Robert Olsen , Christopher J. Kappler , Anna Charny
发明人： Earl T. Cohen , Robert Olsen , Christopher J. Kappler , Anna Charny
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.
摘要翻译：调度层级在分层调度中传播调度层中的最小保证调度速率。父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。对一类流量的最小速率调度保证的这种传播可以是动态的（例如，基于该类流量的活动流量，用于该类流量的活动服务）或静态配置。一个实施例还包括用于调度项目的多个调度通道，诸如但不限于分组或其指示，使得不同类别的业务（例如，传播的最小保证调度速率，非传播最小保证调度速率，高优先级，超量调度项目的速率等）可以相应地通过调度层次传播，而不会被阻塞在较低优先级或不同类型的业务量之上。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式