HIERARCHICAL QUEUING AND SCHEDULING
    1.
    发明申请
    HIERARCHICAL QUEUING AND SCHEDULING 审中-公开
    分层排队和调度

    公开(公告)号:US20110194426A1

    公开(公告)日:2011-08-11

    申请号:US12702826

    申请日:2010-02-09

    IPC分类号: H04L12/56

    摘要: In an example embodiment, there is disclosed herein logic encoded in at least one tangible media for execution and when executed operable to receive a packet. The logic determines a client associated with the packet. The client associated with a service set, and the service set associated with a transmitter. The logic determines a drop probability for the selected client determines a current packet arrival rate for the selected client and determines whether to enqueue or drop the packet based on the drop probability for the selected client and the current packet arrival rate associated with the selected client. The drop probability is based on a packet arrival rate and virtual queue length for the, which is based on a packet arrival rate and virtual queue length for the service set that is based on a packet arrival rate and virtual queue length for the transmitter.

    摘要翻译: 在一个示例性实施例中,本文公开了逻辑编码在至少一个有形介质中用于执行,并且当被执行时可操作以接收分组。 逻辑确定与数据包相关联的客户端。 与服务集相关联的客户端以及与发射机相关联的服务集合。 该逻辑确定所选择的客户端的丢弃概率确定所选择的客户端的当前分组到达速率,并且基于所选客户端的丢弃概率以及与所选择的客户端相关联的当前分组到达速率,确定是否对分组进行入队或丢弃。 丢弃概率基于分组到达速率和虚拟队列长度,其基于基于分组到达速率和发射机的虚拟队列长度的服务集合的分组到达速率和虚拟队列长度。