会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and system for providing congestion control in a data
communications network
    • 在数据通信网络中提供拥塞控制的方法和系统
    • US6035333A
    • 2000-03-07
    • US977252
    • 1997-11-24
    • Clark Debs JeffriesAnoop GhanwaniGerald Arnold MarinKen Van Vu
    • Clark Debs JeffriesAnoop GhanwaniGerald Arnold MarinKen Van Vu
    • H04L12/56G06F15/173
    • H04L47/28H04L47/10H04L47/12H04L47/13
    • A bin packing algorithm is employed to schedule computer network activities, such as pause times required for operation of an Ethernet network which implements existing IEEE 802.3x standards. In such a network, any node in the network can control the flow of traffic from upstream stations in order to avoid congestion at the flow-controlling node. Upon sensing congestion, the flow-controlling node determines how long each upstream node contributing to the congestion should pause transmission over the next control interval. In accordance with the invention, the pause times are scheduled or staggered by using the bin packing algorithm to sort the sources into one or more bins. One required bin property is that there is no overlap in pause times for the sources within a particular bin. Another required bin property is that the sum of the pause times within a bin can be no greater than the length of the control interval. In a preferred embodiment, the calculated pause times are separated into different groups having different number ranges and no more than one pause time is selected from any particular group for packing into a given bin.
    • 采用bin打包算法来调度计算机网络活动,例如实现现有IEEE 802.3x标准的以太网的操作所需的暂停时间。 在这种网络中,网络中的任何节点可以控制来自上游站的业务流,以避免流控制节点处的拥塞。 在感测到拥塞时,流控制节点确定每个有助于拥塞的上游节点在暂停下一个控制间隔时间内的传输时间。 根据本发明,通过使用二进制打包算法来排列或交错暂停时间,以将源排列成一个或多个仓。 一个必需的bin属性是在特定仓中的源的暂停时间没有重叠。 另一个所需的bin属性是bin内暂停时间的总和可以不大于控制间隔的长度。 在优选实施例中,将计算的暂停时间分成具有不同数量范围的不同组,并且从用于打包到给定仓中的任何特定组中选择不超过一个暂停时间。
    • 7. 发明授权
    • Detecting network instability
    • 检测网络不稳定
    • US06918067B2
    • 2005-07-12
    • US10135296
    • 2002-04-30
    • Francis Michael BartuccaClark Debs JeffriesRosemary Venema SlagerNorman Clark Strole
    • Francis Michael BartuccaClark Debs JeffriesRosemary Venema SlagerNorman Clark Strole
    • H04L12/24H04L12/26G06F11/00
    • H04L41/0681H04L43/0829H04L43/0894H04L43/16
    • A method, system and computer program product for detecting conditions of network instability. An attribute indicative of network instability, e.g., processor and/or co-processor utilization, packet arrival rates, packet peak rates, packet size distribution, packet clustering tendencies, buffer usage patterns, occurrence of peak utilization, out-of-buffer conditions, packet discard rates, may be monitored for a network device, e.g., router. The monitored attribute may be associated with a plurality of labels (variables) where a portion of those labels may be stored in a cache. A hit ratio for the cache storing labels associated with the monitored attribute may be tracked within a period of time based on the number of requested items, i.e., labels, that are currently stored in the cache. A condition of network instability may then be detected based on the hit ratio by determining if the absolute value of the acceleration of the hit ratio exceeds a threshold.
    • 一种用于检测网络不稳定状况的方法,系统和计算机程序产品。 指示网络不稳定性的属性,例如处理器和/或协处理器利用率,分组到达速率,分组峰值速率,分组大小分布,分组聚类倾向,缓冲器使用模式,峰值利用的发生,非缓冲条件, 可以监视网络设备(例如路由器)的分组丢弃率。 所监视的属性可以与多个标签(变量)相关联,其中这些标签的一部分可以被存储在高速缓存中。 可以基于当前存储在高速缓存中的所请求的项目(即,标签)的数量,在一段时间内跟踪与所监视的属性相关联的高速缓存存储标签的命中率。 然后可以通过确定命中率的加速度的绝对值是否超过阈值,基于命中率来检测网络不稳定性的状况。
    • 10. 发明授权
    • Cache storage management using dual stacks
    • 使用双栈缓存存储管理
    • US06336167B1
    • 2002-01-01
    • US09415416
    • 1999-10-08
    • Clark Debs JeffriesKen Van VuMazin Sami Yousif
    • Clark Debs JeffriesKen Van VuMazin Sami Yousif
    • G06F1200
    • G06F12/123
    • Cache management in a computer system is achieved by using a cache with dual stacks with storage locations for labels associated with data units stored either in the stack or in a separate cache memory unit. The first or preliminary stack is always refreshed following each label request using a conventional Least Recently Used (LRU) algorithm. If the requested label exists in either stack, the conventional LRU algorithm is also used to update the second stack. If the requested label does not exist in either stack and the bottom position in the second stack is empty, the label is written into the top position of the second stack and existing stack entries are pushed down one position. If the bottom position in the second stack is not empty, stack entries at and below a predetermined insertion point (which may be set statically or dynamically) are pushed down, the entry in the bottom position in the stack is discarded and the label is written into the predetermined insertion point in the second stack.
    • 计算机系统中的缓存管理通过使用具有双堆栈的高速缓存来实现,该缓存具有与存储在堆栈中的数据单元相关联的标签的存储单元或单独的高速缓冲存储器单元中。 使用常规的最近最少使用(LRU)算法,在每个标签请求之后总是刷新第一或初步堆叠。 如果请求的标签存在于任一堆栈中,传统的LRU算法也用于更新第二堆栈。 如果请求的标签不存在于任一堆栈中,并且第二堆栈中的底部位置为空,则将标签写入第二堆栈的顶部位置,并将现有堆栈条目按下一个位置。 如果第二堆栈中的底部位置不为空,则在预定插入点(可以静态或动态设置)下方的堆栈条目被按下,堆叠中底部位置的条目被丢弃并且标签被写入 进入第二堆叠中的预定插入点。