会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 83. 发明授权
    • Method and system for performing asymmetric address translation
    • US07136385B2
    • 2006-11-14
    • US10017261
    • 2001-12-07
    • Philippe DamonGordon Taylor Davis
    • Philippe DamonGordon Taylor Davis
    • H04L12/28H04L12/56
    • H04L61/2514H04L29/12009H04L29/12367H04L29/12462H04L29/12481H04L61/255H04L61/2557
    • A method and system for performing network address translations for a session in a network is disclosed. The network includes at least one local network domain, and the at least one local network domain includes at least one computer system. Each computer system has a local address and is associated with a global address. The session exchanges packets that travel between the computer system within the local network domain and another computer system which may be outside of the local network domain. Each packet includes source and destination information. The method and system include determining a direction of travel for each packet, inbound or outbound, by searching a global address table for a match of a key for each packet. The key is provided using a portion of the destination information. The global address table includes at least one entry. Each entry corresponds to the global address for a first corresponding computer system. The method and system also include asymmetrically translating the source and destination information for each packet using an address translation table or session table based on whether or not the full match is found. The destination information is translated using information in the session table if the packet is inbound. The source information is translated based on the address translation table if the packet is outbound. The address translation table includes at least one entry. Each entry corresponds to the local address for a first corresponding computer system or a global host name for a shared host.
    • 84. 发明授权
    • Connection allocation technology
    • 连接分配技术
    • US07107344B2
    • 2006-09-12
    • US09931540
    • 2001-08-16
    • Gordon Taylor DavisClark Debs JeffriesMark Anthony Rinaldi
    • Gordon Taylor DavisClark Debs JeffriesMark Anthony Rinaldi
    • G06F15/16
    • H04L69/16H04L67/14H04L69/163
    • A method and apparatus useful in network management which makes intelligent, high speed, connection allocation decisions, overcoming difficulties encountered heretofore and providing enhanced network services. During episodes of network congestion, some connection requests for a class of service of low value and with currently a high number of existing connections may be purposefully ignored (not acknowledged with an Acknowledge (ACK) packet) so that the processing capability of a device will not become overwhelmed, causing the dropping of new connection is to note the numbers of connections of different classes relative to their service-level contracts, to ignore abundant, low-value connection requests in accordance with value policies when and only when necessary, and to insure that valuable new connection requests that conform to their contract connection rates can be intelligently accommodated.
    • 一种在网络管理中有用的方法和装置,其实现智能,高速,连接分配决策,克服迄今遇到的困难并提供增强的网络服务。 在网络拥塞发生期间,可以有目的地忽略一些低价值服务和当前具有大量现有连接的连接请求(未被确认(ACK)分组确认),使得设备的处理能力将 不会变得不堪重负,导致新连接的下降是注意到不同类别与其服务级别合同的连接数量,当且仅在必要时根据价值政策忽略丰富的低价值连接请求,并且 确保符合其合同连接率的有价值的新连接请求可以被智能地适应。
    • 86. 发明授权
    • Performance of a cache by including a tag that stores an indication of a previously requested address by the processor not stored in the cache
    • 缓存的性能包括一个标签,该标签存储未存储在高速缓存中的处理器先前请求的地址的指示
    • US07010649B2
    • 2006-03-07
    • US10685054
    • 2003-10-14
    • Gordon Taylor DavisThomas Basilio Genduso
    • Gordon Taylor DavisThomas Basilio Genduso
    • G06F12/08
    • G06F12/126
    • A method and system for improving the performance of a cache. The cache may include a tag entry that identifies the previously requested address by the processor whose data was not located in the cache. If the processor requests that address a second time, then there is a significant probability that the address will be accessed again. When the processor requests the address identified by the tag entry a second time, the cache is updated by inserting the data located at that address and evicting the data located in the least recently used entry. In this manner, data will not be evicted from the cache unless there is a significant probability that the data placed in the cache will likely be accessed again. Hence, data may not be evicted in the cache by the processor and replaced with data that will not be reused, such as in an interrupt routine.
    • 一种用于提高缓存性能的方法和系统。 缓存可以包括标识条目,其标识由数据未位于高速缓存中的处理器先前请求的地址。 如果处理器第二次请求该地址,则重新有可能再次访问该地址。 当处理器第二次请求由标签条目标识的地址时,通过插入位于该地址的数据并驱逐位于最近最少使用的条目中的数据来更新高速缓存。 以这种方式,除非存在可能再次访问高速缓存中的数据的重大概率,否则数据将不会从高速缓存中逐出。 因此,数据可能不会被处理器在高速缓存中驱逐,并且被替换为不被重用的数据,例如在中断程序中。
    • 89. 发明授权
    • Method and system for performing range rule testing in a ternary content addressable memory
    • 在三元内容可寻址存储器中执行范围规则测试的方法和系统
    • US06886073B2
    • 2005-04-26
    • US10173994
    • 2002-06-18
    • Gordon Taylor DavisClark Debs JeffriesJan Van Lunteren
    • Gordon Taylor DavisClark Debs JeffriesJan Van Lunteren
    • G06F12/00G06F17/30H04L29/06
    • H04L69/22H04L69/12
    • A method and system for storing and searching for prefixes for rules, such as filter rules, in a computer system is disclosed. The method and system include providing a ternary content addressable memory (TCAM). The filter rules use range(s) of values in at least one dimension and correspond to prefix(es). The range(s) are described by prefix(es). Some filter rules may intersect. The method and system include providing priorities for the filter rules. The priorities include at least one different priority for the filter rules that intersect. The method and system also include storing the prefixes in the TCAM in block(s) in an order based upon the priorities of the filter rules. In another aspect, the method and system include searching the TCAM for a longest prefix match for a key and searching an additional storage for an almost exact match for the key in parallel with the TCAM. In this aspect, the method and system include returning the longest prefix match having a lowest or a highest location if the longest prefix match is found in the TCAM and the almost exact match is not found in the additional storage.
    • 公开了一种用于在计算机系统中存储和搜索诸如过滤规则的规则的前缀的方法和系统。 该方法和系统包括提供三元内容可寻址存储器(TCAM)。 过滤器规则使用至少一个维度中的值的范围,并对应于前缀(es)。 范围由前缀(es)描述。 一些过滤规则可能会相交。 该方法和系统包括为过滤规则提供优先级。 优先级至少包含与交叉的过滤规则的一个不同的优先级。 该方法和系统还包括基于过滤器规则的优先级按顺序将块中的前缀存储在块中。 在另一方面,所述方法和系统包括搜索TCAM对于密钥的最长前缀匹配,并且搜索附加存储器以与所述TCM并行的所述密钥几乎精确匹配。 在这方面,如果在TCAM中找到最长前缀匹配并且在附加存储器中找不到几乎精确的匹配,则该方法和系统包括返回具有最低或最高位置的最长前缀匹配。