公开(公告)号：US5426637A

公开(公告)日：1995-06-20

申请号：US992857

申请日：1992-12-14

申请人： Jeffrey H. Derby ,  Willibald A. Doeringer ,  Harold D. Dykeman ,  Liang Li ,  Haldon J. Sandick ,  Ken V. Vu

发明人： Jeffrey H. Derby ,  Willibald A. Doeringer ,  Harold D. Dykeman ,  Liang Li ,  Haldon J. Sandick ,  Ken V. Vu

IPC分类号： H04L12/46 ,  H04L12/66

CPC分类号： H04L12/66 ,  H04L12/4604 ,  H04L45/742

摘要： A system for interconnecting widely separated local area networks (LANs) by means of a wide area network (WAN) utilizes network level facilities to establish a connection through the wide area network and to create connection table entries at the WAN access point which allow subsequent data frames to be transmitted through the wide area network without such network level operations. More particularly, the various LANs are combined into search groups, represented by address prefixes, to which LAN-initiated connection requests can be broadcast and which can respond so as to establish the data path connections. This system has the connection flexibility of a prior art router and, at the same time, the low overhead of a prior art bridge.

摘要翻译： 通过广域网（WAN）互连广泛分离的局域网（LAN）的系统利用网络级设施通过广域网建立连接，并在WAN接入点创建连接表条目，允许后续数据 通过广域网传输帧，无需进行网络级操作。 更具体地，各种LAN被组合成由地址前缀表示的搜索组，LAN发起的连接请求可以被广播并且哪些可以响应以便建立数据路径连接。 该系统具有现有技术的路由器的连接灵活性，同时具有现有技术的桥接器的低开销。

公开(公告)号：US5398012A

公开(公告)日：1995-03-14

申请号：US980854

申请日：1992-11-24

申请人： Jeffrey H. Derby ,  Willibald A. Doeringer ,  John E. Drake, Jr. ,  Douglas H. Dykeman ,  Haldon J. Sandick ,  Ken V. Vu

发明人： Jeffrey H. Derby ,  Willibald A. Doeringer ,  John E. Drake, Jr. ,  Douglas H. Dykeman ,  Haldon J. Sandick ,  Ken V. Vu

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

CPC分类号： H04L45/04 ,  H04L45/44

摘要： The process for determining the best communication route from a source end station to a destination end station is distributed over both source and destination network nodes. Network nodes, at the interface between a wide area network (WAN) and each subnetwork, contain access agents to control the communication flow between the wide area network and an end station in the subnetwork. The task of selecting the best route between two end stations is distributed between the access agents at the WAN interface in the first subnetwork, and the access agents at the WAN interface in the second subnetwork. Each access agent at one WAN interface obtains the best route from itself to the end station in its subnetwork. Each access agent at the other WAN interface finds the best route from each access agent at the first WAN interface through itself to the end station in its subnetwork. One designated access agent collects all the best route information. This best route information is concatenated, and the route with the least weight is selected as the best route between end stations.

摘要翻译： 用于确定从源端站到目的地端站的最佳通信路由的过程分布在源网络节点和目的地网络节点上。 在广域网（WAN）和每个子网之间的接口上的网络节点包含访问代理，以控制广域网与子网中终端站之间的通信流。 在两个终端站之间选择最佳路由的任务分布在第一子网中的WAN接口的接入代理和第二子网中WAN接口的接入代理之间。 一个WAN接口的每个接入代理在其子网中获得从自己到终端站的最佳路由。 另一个WAN接口的每个接入代理从第一个WAN接口的每个接入代理器找到从其子网到终端站的最佳路由。 一个指定的访问代理收集所有最好的路由信息​​。 这个最佳路由信息是连接起来的，重量最小的路由被选为终端站之间的最佳路由。

公开(公告)号：US07103050B1

公开(公告)日：2006-09-05

申请号：US09202365

申请日：1997-04-10

申请人： Ronald P. Luijten ,  Ken V. Vu

发明人： Ronald P. Luijten ,  Ken V. Vu

IPC分类号： H04L12/56

CPC分类号： H04L12/5602 ,  H04L2012/5636 ,  H04Q11/0478

摘要： The invention relates to a method for determining the used bandwidth (CCR) on a connection (18) on which information-carrying units are transported. The duration (ET) of an arrival period, during which a predetermined number (M) of the cells arrives at a certain point of the connection (18), is measured and stored. The bandwidth (CCR) at an arbitrary point of time (GT) is set to the predetermined number (M) per the stored duration (ET), if the point of time (TS) when the duration (ET) was stored is not longer ago than a predetermined threshold time interval (THR) at the arbitrary point of time (GT).

摘要翻译： 本发明涉及一种用于确定在其上传送信息携带单元的连接（18）上的使用带宽（CCR）的方法。 测量并存储到达周期的持续时间（ET），在该期间中，预定数量（M）的单元到达连接（18）的某一点。 如果存储持续时间（ET）的时间点（TS）不长于，则任意时间点（GT）的带宽（CCR）被设置为每个存储持续时间（ET）的预定数量（M） 以前在任意时间点（GT）的预定阈值时间间隔（THR）。

公开(公告)号：US20100312970A1

公开(公告)日：2010-12-09

申请号：US12478555

申请日：2009-06-04

申请人： Gordon B. Bell ,  Anil Krishna ,  Brian M. Rogers ,  Ken V. Vu

发明人： Gordon B. Bell ,  Anil Krishna ,  Brian M. Rogers ,  Ken V. Vu

IPC分类号： G06F12/08 ,  G06F12/00

CPC分类号： G06F12/121

摘要： The illustrative embodiments provide a method, apparatus, and computer program product for managing a number of cache lines in a cache. In one illustrative embodiment, it is determined whether activity on a memory bus in communication with the cache exceeds a threshold activity level. A least important cache line is located in the cache responsive to a determination that the threshold activity level is exceeded, wherein the least important cache line is located using a cache replacement scheme. It is determined whether the least important cache line is clean responsive to the determination that the threshold activity level is exceeded. The least important cache line is selected for replacement in the cache responsive to a determination that the least important cache line is clean. A clean cache line is located within a subset of the number of cache lines and selecting the clean cache line for replacement responsive to an absence of a determination that the least important cache line is not clean, wherein the each cache line in the subset is examined in ascending order of importance according to the cache replacement scheme.

摘要翻译： 说明性实施例提供了用于管理高速缓存中的多条高速缓存行的方法，装置和计算机程序产品。 在一个说明性实施例中，确定与高速缓存通信的存储器总线上的活动是否超过阈值活动级别。 响应于确定超出了阈值活动级别，至少重要的高速缓存行位于缓存中，其中使用高速缓存替换方案来定位最不重要的高速缓存行。 响应于超过阈值活动水平的确定，确定最不重要的高速缓存行是否是干净的。 响应于确定最不重要的高速缓存行是干净的，在缓存中选择最不重要的高速缓存行用于替换。 干净的高速缓存行位于高速缓存行数的一个子集内，并且响应于不存在最不重要的高速缓存行不干净的确定，选择干净的高速缓存行进行替换，其中检查子集中的每个高速缓存行 按照缓存替换方案的重要性升序排列。

公开(公告)号：US20090157968A1

公开(公告)日：2009-06-18

申请号：US11954936

申请日：2007-12-12

申请人： Gordon B. Bell ,  Anil Krishna ,  Nicholas D. Lindbert ,  Ken V. Vu

发明人： Gordon B. Bell ,  Anil Krishna ,  Nicholas D. Lindbert ,  Ken V. Vu

IPC分类号： G06F12/08

CPC分类号： G06F12/0864

摘要： A cache memory including a plurality of sets of cache lines, and providing an implementation for increasing the associativity of selected sets of cache lines including the combination of providing a group of parameters for determining the worthiness of a cache line stored in a basic set of cache lines, providing a partner set of cache lines, in the cache memory, associated with the basic set, applying the group of parameters to determine the worthiness level of a cache line in the basic set and responsive to a determination of a worthiness in excess of a predetermined level, for a cache line, storing said worthiness level cache line in said partner set.

摘要翻译： 一种高速缓冲存储器，包括多组高速缓存行，并且提供用于增加所选择的高速缓存行集合的关联性的实现，包括提供用于确定存储在基本高速缓存中的高速缓存行的价值的一组参数的组合 在高速缓冲存储器中提供与基本集合相关联的一组高速缓存行，应用该组参数以确定基本集合中的高速缓存行的有效性水平，并且响应于超过 用于高速缓存行的预定级别，将所述有价值级别的高速缓存行存储在所述伙伴集合中。

公开(公告)号：US07453798B2

公开(公告)日：2008-11-18

申请号：US10782617

申请日：2004-02-19

申请人： Jeffrey P. Bradford ,  Gordon T. Davis ,  Dongming Hwang ,  Clark D. Jeffries ,  Srinivasan Ramani ,  Kartik Sudeep ,  Ken V. Vu

发明人： Jeffrey P. Bradford ,  Gordon T. Davis ,  Dongming Hwang ,  Clark D. Jeffries ,  Srinivasan Ramani ,  Kartik Sudeep ,  Ken V. Vu

IPC分类号： H04L12/00

CPC分类号： H04L47/10 ,  H04L47/29 ,  H04L47/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.

摘要翻译： 本发明提供一种向活动队列管理算法应用“迟滞”的计算机网络方法和系统。 如果队列处于低于某个低阈值的水平，并且一​​群数据包到达网络节点，则重新计算突发中丢弃初始数据包的概率，但不会丢弃数据包。 然而，如果队列级别超过滞后阈值，则根据丢弃概率丢弃数据包。 此外，根据本发明，可以减少队列级别，直到其变得小于滞后阈值，其中每个丢弃概率的分组丢弃，直到队列级别降低到至少低阈值。 在一个实施例中，还提供自适应算法来调整每个流的发送概率以及迟滞以增加分组传输速率以吸收突发业务。

公开(公告)号：US20100306515A1

公开(公告)日：2010-12-02

申请号：US12473764

申请日：2009-05-28

申请人： Muawya M. Al-Otoom ,  Timothy H. Heil ,  Anil Krishna ,  Ken V. Vu

发明人： Muawya M. Al-Otoom ,  Timothy H. Heil ,  Anil Krishna ,  Ken V. Vu

IPC分类号： G06F9/38

CPC分类号： G06F9/3848

摘要： An adaptive prediction threshold scheme for dynamically adjusting prediction thresholds of entries in a Pattern History Table (PHT) by observing global tendencies of the branch or branches that index into the PHT entries. A count value of a prediction state counter representing a prediction state of a prediction state machine for a PHT entry is obtained. Count values in a set of counters allocated to the entry in the PHT are changed based on the count value of the entry's prediction state counter. The prediction threshold of the prediction state machine for the entry may then be adjusted based on the changed count values in the set of counters, wherein the prediction threshold is adjusted by changing a count value in a prediction threshold counter in the entry, and wherein adjusting the prediction threshold redefines predictions provided by the prediction state machine.

摘要翻译： 一种自适应预测阈值方案，用于通过观察索引到PHT条目中的分支或分支的全局倾向来动态地调整模式历史表（PHT）中条目的预测阈值。 获得表示PHT条目的预测状态机的预测状态的预测状态计数器的计数值。 分配给PHT中的条目的一组计数器中的计数值根据条目的预测状态计数器的计数值而改变。 然后可以基于该组计数器中的改变的计数值来调整用于该条目的预测状态机的预测阈值，其中通过改变条目中的预测阈值计数器中的计数值来调整预测阈值，并且其中调整 预测阈值重新定义了由预测状态机提供的预测。