利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

83 条记录 (耗时 0.021 秒)

    Method and apparatus for scheduling a resource to meet quality-of-service restrictions.
    4.
    发明公开
    Method and apparatus for scheduling a resource to meet quality-of-service restrictions. 审中-公开
    方法和装置设备，以优质的-OF-SERVICE限制之一件无法满足

    公开(公告)号：EP2275941A2

    公开(公告)日：2011-01-19

    申请号：EP10184529.5

    申请日：2002-02-21

    申请人： Sonics, Inc.

    发明人： Weber, Wolf-Dietrich

    IPC分类号： G06F13/14 ,  G06F12/00 ,  H04B7/212 ,  H04L12/56 ,  G06F13/364 ,  H04L29/08

    CPC分类号： G06F9/4887 ,  G06F13/364 ,  H04L47/24 ,  H04L47/521 ,  H04L47/525 ,  H04L47/6215 ,  H04L47/6265 ,  H04L47/6275 ,  H04L67/322

    摘要： The present invention is directed to a method and apparatus for scheduling a resource (35) to meet quality of service guarantees. In one embodiment of three levels of priority, if a channel of a first priority level (15) is within its bandwidth allocation, then a request is issued from that channel. If there are no requests in channels at the first priority level that are within the allocation, requests from channels at the second priority level (20) that are within their bandwidth allocation are chosen. If there are no requests of this type, requests from channels at the third priority level (25) or requests from channels at the first and second levels that are outside of their bandwidth allocation are issued. The system may be implemented using rate-based scheduling.

    摘要翻译： 本发明涉及用于调度资源（35），以满足服务质量保证的方法和装置。 在三个级别的优先级的一个实施例中，如果第一优先级（15）的信道是其带宽分配之内，则请求从通道发出一样。 如果有在第一优先级做在通道没有请求具有分配内，在所述第二优先级（20），从信道请求那样的是其带宽分配中被选择。 如果没有这种类型的请求，从第三优先级（25）信道或请求请求从渠道在第一级和第二级没有被他们的带宽分配外发行。 该系统可以使用基于速率的调度来实现。

    System for allocating resources in a communication system
    6.
    发明公开
    System for allocating resources in a communication system 审中-公开
    系统zur Betriebsmittelzuweisung在einem电信系统

    公开(公告)号：EP1587259A2

    公开(公告)日：2005-10-19

    申请号：EP05011081.6

    申请日：2000-01-12

    申请人： QUALCOMM INCORPORATED

    发明人： Pankaj, Rajesh ,  Sindhushayana, Nagabhushana T.

    IPC分类号： H04L12/56 ,  H04Q7/38 ,  H04L29/06

    CPC分类号： H04L47/14 ,  H04L47/15 ,  H04L47/50 ,  H04L47/522 ,  H04L47/562 ,  H04L47/621 ,  H04L47/6255 ,  H04L47/6265 ,  H04W16/04 ,  H04W72/1221 ,  H04W72/1252 ,  H04W72/1257

    摘要： A resource scheduler in a communication system, the communication system including a common node and a plurality of customer nodes associated with the common node, the common node having at any particular service interval a finite resource seized by one or more engaging customer nodes to the exclusion of any remaining customer nodes, each of the customer nodes having an instantaneous rate of consuming the finite resource. The resource scheduler comprises logic for maintaining a weight associated with each of the customer nodes; logic for selecting one or more of the remaining customer nodes to seize the finite resource in a subsequent service interval based upon a comparison of the weight associated with the selected remaining customer nodes and the respective weights associated with the other remaining customer nodes, the subsequent service interval following a present service interval in which the finite resources are seized by one or more engaging customer nodes; and logic for changing the weight of the selected customer node based upon the instantaneous rate at which the selected customer node consumes the finite resource. The resource scheduler further includes logic for determining a duration of an override time interval, the override time interval having a beginning and an end, associated with at least one customer node based upon a minimum average rate of consuming the finite resource associated with the at least one customer node and the instantaneous rate of consuming the finite resource associated with the at least one customer node; and logic for initializing the override time interval whenever the at least one customer node seizes the finite resource and whenever the override time interval ends, wherein the logic for selecting schedules the at least one customer node to seize the finite resource in the subsequent service interval independent of the weights associated with the customer nodes when each override time interval ends. A corresponding method is also disclosed.

    摘要翻译： 通信系统中的资源调度器，所述通信系统包括与所述公共节点相关联的公共节点和多个客户节点，所述公共节点在任何特定服务间隔处具有由一个或多个参与客户节点占用的有限资源到所述排除 任何剩余的客户节点，每个客户节点具有消耗有限资源的瞬时速率。 资源调度器包括用于维护与每个客户节点相关联的权重的逻辑; 用于基于与所选择的剩余客户节点相关联的权重与与其他剩余客户节点相关联的相应权重的比较来选择一个或多个剩余客户节点来夺取后续服务间隔中的有限资源的逻辑，后续服务 在当前服务间隔之后的时间间隔，其中有限资源被一个或多个参与客户节点占用; 以及用于基于所选择的客户节点消耗有限资源的瞬时速率来改变所选客户节点的权重的逻辑。 资源调度器还包括用于基于与至少一个客户节点相关联的有限资源的最小平均速率来确定与至少一个客户节点相关联的覆盖时间间隔的覆盖时间间隔的持续时间的超时时间间隔的逻辑 一个客户节点和消耗与至少一个客户节点相关联的有限资源的瞬时速率; 以及每当所述至少一个客户节点占用所述有限资源并且每当所述超控时间间隔结束时初始化覆盖时间间隔的逻辑，其中所述用于选择的逻辑调度所述至少一个客户节点以在随后的服务间隔中独立地占用所述有限资源 当每个覆盖时间间隔结束时与客户节点相关联的权重。 还公开了相应的方法。

    High speed weighted fair queuing system for ATM switches
    9.
    发明公开
    High speed weighted fair queuing system for ATM switches 有权
    系统管理软件Warteschlangen mit hoher GeschwindigkeitfürATM Vermittlungstellen

    公开(公告)号：EP1021060A3

    公开(公告)日：2003-01-02

    申请号：EP99307086.1

    申请日：1999-09-07

    申请人： LUCENT TECHNOLOGIES INC.

    发明人： Chen, Chien ,  He, Linhai ,  Wong, Albert Kai-sun

    IPC分类号： H04Q11/04

    CPC分类号： H04L47/6215 ,  H04L47/50 ,  H04L47/522 ,  H04L47/623 ,  H04L47/6265 ,  H04L49/3027 ,  H04L2012/5651 ,  H04L2012/5679

    摘要： Methods and apparatus for an ATM network for implementing a fair servicing of all connections during a back-logged condition through the use of a weighted fair queuing technique. The system is particularly suited for systems where the packets/cells are of a fixed size. Although some important approximations are made in the proposed implementation, all ofthe properties of an ideal weighted fair queuing algorithm are preserved. The sorting methods and apparatus are advantageous in that it is possible to maintain appropriate servicing of connections without sorting all ofthe individual connections. This may be accomplished by pre-sorting each of the individual virtual circuit connections into a finite number of predetermined bins according to a weight associated with the connection. Thereafter, only the bins need be sorted without having to sort each ofthe individual connections. Further aspects ofthe invention include storing the bins in a matrix with an offset value dependent upon the current potential of the bin. In this manner, the overall sorting required to determine the next connection to service is substantially reduced. Accordingly, the invention is suitable for implementations having transmission speeds of multiple gigabits-per-second.

    摘要翻译： ATM网络的方法和装置，用于通过使用加权公平排队技术在回溯状态期间实现对所有连接的公平服务。 该系统特别适用于分组/小区固定大小的系统。 虽然在所提出的实现中进行了一些重要的近似，但是保留了理想加权公平排队算法的所有属性。 排序方法和装置的优点在于，可以在不排除所有单独连接的情况下维持连接的适当维修。 这可以通过根据与连接相关联的权重将每个单独的虚拟电路连接预分类成有限数量的预定仓来实现。 此后，只需要排序箱，而不必对每个连接进行排序。 本发明的其它方面包括将箱体存储在具有取决于箱的当前电位的偏移值的矩阵中。 以这种方式，确定下一次服务连接所需的整体排序大大减少。 因此，本发明适用于具有多吉比特每秒传输速度的实现。

    Packet transfer device and method adaptive to a large number of input ports
    10.
    发明公开
    Packet transfer device and method adaptive to a large number of input ports 失效
    用于发送分组的方法，适合于大量输入端口和调理

    公开(公告)号：EP0763915A2

    公开(公告)日：1997-03-19

    申请号：EP96114952.3

    申请日：1996-09-18

    申请人： KABUSHIKI KAISHA TOSHIBA

    发明人： Shimojo, Yoshimitsu

    IPC分类号： H04L12/56 ,  H04Q11/04

    CPC分类号： H04L12/5601 ,  H04L47/263 ,  H04L47/266 ,  H04L47/30 ,  H04L47/50 ,  H04L47/522 ,  H04L47/60 ,  H04L47/621 ,  H04L47/6215 ,  H04L47/6255 ,  H04L47/6265 ,  H04L49/25 ,  H04L49/254 ,  H04L49/3018 ,  H04L49/3027 ,  H04L49/3081 ,  H04L49/505 ,  H04L49/506 ,  H04L2012/5635 ,  H04L2012/5636 ,  H04L2012/5651 ,  H04L2012/5681 ,  H04L2012/5682

    摘要： A packet transfer device that can be easily realized even when a number of input ports is large. Each input buffer temporarily stores entered packets class by class, and outputs packets of a selected class specified by the control unit, while the control unit determines the selected class of packets to be outputted from the input buffers according to a packet storage state in the packet storage units of the input buffers as a whole for each class. Each input buffer can temporarily store entered packets while selecting packets to be outputted at a next phase, and the control unit can specify packets to be selected in the input buffers according to an output state of packets previously selected in the input buffers as a whole. Packets stored in the buffer can be managed in terms of a plurality of groups, and each packet entered at the buffer can be distributed into a plurality of groups so that packets are distributed fairly among flows. The packets belonging to one of a plurality of groups are then outputted from the buffer toward the output port. A packet transfer at the buffer can be controlled by issuing a packet transfer command according to a log of packet transfer commands with respect to the buffer and a packet storage state of the buffer.

    摘要翻译： 分组传送设备确实能够容易地实现，即使当多个输入端口的大。 每个输入缓冲器暂时存储由类已输入的数据包的类，和输出由所述控制单元指定的所选择的级的数据包，而所述控制单元确定的地雷所选择的级的数据包的要在从输入输出缓冲器雅丁到分组存储状态中的分组 输入缓冲器作为一个整体为每个类的存储单元。 每个输入缓冲器可临时存储输入的分组，而选择在下一阶段将被输出的数据包，并且控制单元可以指定在输入缓冲器雅丁到在输入缓冲器整体此前选择的分组的输出状态将被选择的数据包。 存储在缓冲器中的分组可以在基团的多个方面进行管理，并在缓冲器输入的每个分组可被分配到的用户组。多个所以没有分组流之间公平地分配。 相对于命令缓冲区属于组的多个一项所述的分组然后在从朝向所述输出端口的缓冲器输出。在缓冲器的数据包传输可以通过发出雅丁分组传送命令到一个日志数据包转发的被控制和 所述缓冲器的数据包存储状态。