会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Active flow management with hysteresis
    • 主动流量管理带滞后
    • US07453798B2
    • 2008-11-18
    • US10782617
    • 2004-02-19
    • Jeffrey P. BradfordGordon T. DavisDongming HwangClark D. JeffriesSrinivasan RamaniKartik SudeepKen V. Vu
    • Jeffrey P. BradfordGordon T. DavisDongming HwangClark D. JeffriesSrinivasan RamaniKartik SudeepKen V. Vu
    • H04L12/00
    • H04L47/10H04L47/29H04L47/323
    • The present invention provides for a computer network method and system that applies “hysteresis” to an active queue management algorithm. If a queue is at a level below a certain low threshold and a burst of packets arrives at a network node, then the probability of dropping the initial packets in the burst is recalculated, but the packets are not dropped. However, if the queue level crosses beyond a hysteresis threshold, then packets are discarded pursuant to a drop probability.Also, according to the present invention, queue level may be decreased until it becomes less than the hysteresis threshold, with packets dropped per the drop probability until the queue level decreases to at least a low threshold. In one embodiment, an adaptive algorithm is also provided to adjust the transmit probability for each flow together with hysteresis to increase the packet transmit rates to absorb bursty traffic.
    • 本发明提供一种向活动队列管理算法应用“迟滞”的计算机网络方法和系统。 如果队列处于低于某个低阈值的水平,并且一​​群数据包到达网络节点,则重新计算突发中丢弃初始数据包的概率,但不会丢弃数据包。 然而,如果队列级别超过滞后阈值,则根据丢弃概率丢弃数据包。 此外,根据本发明,可以减少队列级别,直到其变得小于滞后阈值,其中每个丢弃概率的分组丢弃,直到队列级别降低到至少低阈值。 在一个实施例中,还提供自适应算法来调整每个流的发送概率以及迟滞以增加分组传输速率以吸收突发业务。
    • 2. 发明申请
    • Active flow management with hysteresis
    • 主动流量管理带滞后
    • US20050185581A1
    • 2005-08-25
    • US10782617
    • 2004-02-19
    • Jeffrey BradfordGordon DavisDongming HwangClark JeffriesSrinivasan RamaniKartik SudeepKen Vu
    • Jeffrey BradfordGordon DavisDongming HwangClark JeffriesSrinivasan RamaniKartik SudeepKen Vu
    • H04L12/56H04J3/16
    • H04L47/10H04L47/29H04L47/323
    • The present invention provides for a computer network method and system that applies “hysteresis” to an active queue management algorithm. If a queue is at a level below a certain low threshold and a burst of packets arrives at a network node, then the probability of dropping the initial packets in the burst is recalculated, but the packets are not dropped. However, if the queue level crosses beyond a hysteresis threshold, then packets are discarded pursuant to a drop probability. Also, according to the present invention, queue level may be decreased until it becomes less than the hysteresis threshold, with packets dropped per the drop probability until the queue level decreases to at least a low threshold. In one embodiment, an adaptive algorithm is also provided to adjust the transmit probability for each flow together with hysteresis to increase the packet transmit rates to absorb bursty traffic.
    • 本发明提供一种向活动队列管理算法应用“迟滞”的计算机网络方法和系统。 如果队列处于低于某个低阈值的水平,并且一​​群数据包到达网络节点,则重新计算突发中丢弃初始数据包的概率,但不会丢弃数据包。 然而,如果队列级别超过滞后阈值,则根据丢弃概率丢弃数据包。 此外,根据本发明,可以减少队列级别,直到其变得小于滞后阈值,其中每个丢弃概率的分组丢弃,直到队列级别降低到至少低阈值。 在一个实施例中,还提供自适应算法来调整每个流的发送概率以及迟滞以增加分组传输速率以吸收突发业务。
    • 4. 发明授权
    • Bandwidth allocation in accordance with shared queue output limit
    • 带宽分配按照共享队列输出限制
    • US06701389B2
    • 2004-03-02
    • US09876358
    • 2001-06-07
    • Brahmanand Kumar GortiDongming HwangClark Debs JeffriesMichael Steven SiegelKartik Sudeep
    • Brahmanand Kumar GortiDongming HwangClark Debs JeffriesMichael Steven SiegelKartik Sudeep
    • G06F300
    • H04L47/30H04L47/10H04L47/263H04L47/32Y02D50/10
    • A method for dynamically adjusting the flow rate of a plurality of logical pipes that share a common output queue. In accordance with the method of the present invention, a minimum flow rate and a maximum flow rate are set for each of the pipes. Next a determination is made of whether or not excess queue bandwidth exists in accordance with the output flow rate of the shared queue. The determination of whether or not excess bandwidth exists comprises comparing the output flow rate of the shared queue with a pre-determined threshold queue output value. An instantaneous excess bandwidth signal has a value of 1 if there is excess bandwidth and is otherwise 0 if there is no excess bandwidth. In an alternate embodiment, the instantaneous excess bandwidth signal for a particular pipe is logically ANDed with one or more additional excess bandwidth signals to form a composite instantaneous excess bandwidth signal. In response to the existence of excess queue bandwidth, a flow rate of a pipe is linearly increased while in response to a lack of excess queue bandwidth, the flow rate of the pipe is exponentially decreased.
    • 一种用于动态调整共享公共输出队列的多个逻辑管道的流量的方法。 根据本发明的方法,为每个管设定最小流量和最大流量。 接下来,根据共享队列的输出流量确定是否存在过量队列带宽。 确定是否存在超量带宽包括将共享队列的输出流量与预定阈值队列输出值进行比较。 如果存在过多的带宽,则瞬时过量带宽信号的值为1,如果没有超额带宽,则为0。 在替代实施例中,用于特定管道的瞬时过量带宽信号与一个或多个附加过量带宽信号进行逻辑“与”,以形成复合瞬时过量带宽信号。 响应于存在多余的队列带宽,管道的流量线性增加,同时响应于缺少多余的队列带宽,管道的流量呈指数下降。
    • 5. 发明授权
    • Data structure supporting random delete and timer function
    • 数据结构支持随机删除和定时功能
    • US07792873B2
    • 2010-09-07
    • US12015198
    • 2008-01-16
    • Gordon T. DavisMarco HeddesDongming Hwang
    • Gordon T. DavisMarco HeddesDongming Hwang
    • G06F17/30G06F7/00
    • G06F17/30955Y10S707/99933Y10S707/99942
    • A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.
    • 一个过程用于提供处理大量活动数据条目的数据结构以及高活动条目的添加和删除率。 该过程利用以下一个或多个修改。 定时器从单个会话表条目中删除,并通过指针进行链接。 在会话表和定时器结构之间建立双向链路。 老化/定时器检查应用于定时器控制块(TCB)。 可以使用可选地包括多余块的TCB链,以及将多个TCB打包到单个存储器位置中。 这个多余的块允许终止的会话继续占用TCB,直到定时器进程前进到块链中的块位置。
    • 7. 发明授权
    • Data structure supporting random delete and timer function
    • 数据结构支持随机删除和定时功能
    • US07412454B2
    • 2008-08-12
    • US10654139
    • 2003-09-03
    • Gordon T. DavisMarco HeddesDongming Hwang
    • Gordon T. DavisMarco HeddesDongming Hwang
    • G06F17/30G06F7/00
    • G06F17/30955Y10S707/99933Y10S707/99942
    • A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.
    • 一个过程用于提供处理大量活动数据条目的数据结构以及高活动条目的添加和删除率。 该过程利用以下一个或多个修改。 定时器从单个会话表条目中删除,并通过指针进行链接。 在会话表和定时器结构之间建立双向链路。 老化/定时器检查应用于定时器控制块(TCB)。 可以使用可选地包括多余块的TCB链,以及将多个TCB打包到单个存储器位置中。 这个多余的块允许终止的会话继续占用TCB,直到定时器进程前进到块链中的块位置。