会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • RULES-BASED TRANSACTION PREFETCHING USING CONNECTION END-POINT PROXIES
    • 使用连接端点代码的基于规则的交易预购
    • WO2006099542A2
    • 2006-09-21
    • PCT/US2006/009544
    • 2006-03-15
    • RIVERBED TECHNOLOGY, INC.WU, David Tze-SiKESWANI, VivasvatLARSEN, Case
    • WU, David Tze-SiKESWANI, VivasvatLARSEN, Case
    • G06F15/16
    • H04L67/1095H04L67/10
    • Network proxies reduce server latency in response to series of requests from client applications. Network proxies intercept messages clients and a server. Intercepted client requests are compared with rules. When client requests match a rule, additional request messages are forwarded to the server on behalf of a client application. In response to the additional request messages, the server provides corresponding response messages. A network proxy intercepts and caches the response messages. Subsequent client requests are intercepted by the network application proxy and compared with the cached messages. If a cached response message corresponds with a client request message, the response message is returned to the client application immediately instead of re-requesting the same information from the server. A server-side network proxy can compare client requests with the rules and send additional request messages. The corresponding response messages can be forwarded to a client-side network proxy for caching.
    • 响应于来自客户端应用程序的一系列请求,网络代理减少了服务器延迟。 网络代理拦截消息客户端和服务器。 拦截的客户端请求与规则进行比较。 当客户端请求匹配规则时,代表客户端应用程序将其他请求消息转发到服务器。 响应于附加请求消息,服务器提供相应的响应消息。 网络代理拦截并缓存响应消息。 随后的客户端请求被网络应用程序代理拦截,并与缓存的消息进行比较。 如果缓存的响应消息对应于客户端请求消息,则响应消息立即返回到客户端应用程序,而不是从服务器重新请求相同的信息。 服务器端网络代理可以将客户端请求与规则进行比较,并发送其他请求消息。 相应的响应消息可以转发到客户端网络代理进行缓存。
    • 2. 发明申请
    • AUTOMATIC FRAMING SELECTION
    • 自动框架选择
    • WO2007016236A2
    • 2007-02-08
    • PCT/US2006/029181
    • 2006-07-26
    • RIVERBED TECHNOLOGY, INC.WU, David Tze-SiLASSEN, SorenSUBBANA, KartikGUPTA, NitinKESWANI, Vivasvat
    • WU, David Tze-SiLASSEN, SorenSUBBANA, KartikGUPTA, NitinKESWANI, Vivasvat
    • H04J11/00
    • H04L47/27H04L12/28H04L43/16H04L47/26H04L69/16H04L69/163
    • Network traffic is monitored and an optimal framing heuristic is automatically determined and applied. Framing heuristics specify different rules for framing network traffic. While a framing heuristic is applied to the network traffic, alternative framing heuristics are speculatively evaluated for the network traffic. The results of these evaluations are used to rank the framing heuristics. The framing heuristic with the best rank is selected for framing subsequent network traffic. Each client/server traffic flow may have a separate framing heuristic. The framing heuristics may be deterministic based on byte count and/or time or based on traffic characteristics that indicate a plausible point for framing to occur. The choice of available framing heuristics may be determined partly by manual configuration, which specifies which framing heuristics are available, and partly by automatic processes, which determine the best framing heuristic to apply to the current network traffic from the set of available framing heuristics.
    • 监控网络流量,并自动确定并应用最佳框架启发式。 构筑启发式规则为构建网络流量指定了不同的规则。 在网络流量应用框架启发式的同时,针对网络流量推测性地评估替代框架启发式。 这些评估的结果被用来排列框架启发式。 选择具有最佳排名的框架启发式用于构建后续网络流量。 每个客户端/服务器通信流可能具有单独的框架启发式。 基于字节计数和/或时间或者基于指示帧出现的合理点的业务特性,帧启发法可以是确定性的。 可用框架启发式的选择可部分由手动配置来确定,该手动配置指定哪些框架启发式可用,并且部分由自动过程确定,以从可用框架启发式集合中确定适用于当前网络流量的最佳框架启发式。 / p>

    • 3. 发明申请
    • METHOD AND APPARATUS FOR ACCELERATION BY PREFETCHING ASSOCIATED OBJECTS
    • 通过预先设定相关对象加速的方法和装置
    • WO2008112649A1
    • 2008-09-18
    • PCT/US2008/056431
    • 2008-03-10
    • RIVERBED TECHNOLOGY, INC.HUANG, CharlesGUPTA, NitinKESWANI, VivasvatROBINSON, Bart
    • HUANG, CharlesGUPTA, NitinKESWANI, VivasvatROBINSON, Bart
    • G06F15/16
    • H04L67/28
    • Association information is used to build association trees to associate base pages and embedded objects at a proxy. An association tree has a root node containing a URL for a base page, and zero or more leaf nodes each containing a URL for an embedded object. In most cases an association tree will maintain the invariant that all leaves contain distinct URLs. However, it is also possible to have an association tree in which the same URL appears in multiple nodes Given a number of association trees and a base-page URL, a prefetch system finds the root or Interior node corresponding to that URL (if any) and traverses the tree from that node, prefetching URLs until the URL of the last leaf node is prefetched. The prefetching starts the process of bringing over the various embedded objects before the user or program would ordinarily fetch them.
    • 关联信息用于构建关联树以将代理服务器的基本页面和嵌入的对象关联。 关联树具有包含基页的URL的根节点,以及包含嵌入对象的URL的零个或多个叶节点。 在大多数情况下,关联树将保留所有叶包含不同URL的不变量。 然而,也可能有一个关联树,其中相同的URL出现在多个节点中。给定多个关联树和基页URL,预取系统找到与该URL对应的根节点或内部节点(如果有的话) 并从该节点遍历树,预取URL直到预取最后一个叶节点的URL。 预取开始在用户或程序通常抓取它们之前引导各种嵌入对象的过程。