会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • VIRTUALIZED DATA STORAGE SYSTEM ARCHITECTURE
    • 虚拟化数据存储系统体系结构
    • WO2010111312A3
    • 2010-12-29
    • PCT/US2010028375
    • 2010-03-23
    • RIVERBED TECHNOLOGY INCWU DAVID TZE-SIMCCANNE STEVENDEMMER MICHAEL JGUPTA NITIN
    • WU DAVID TZE-SIMCCANNE STEVENDEMMER MICHAEL JGUPTA NITIN
    • G06F13/00
    • G06F17/30233G06F3/0643G06F3/0653G06F3/067G06F12/0862G06F17/30132G06F2212/6024
    • Virtual storage arrays consolidate branch data storage at data centers connected via wide area networks. Virtual storage arrays appear to storage clients as local data storage; however, virtual storage arrays actually store data at the data center. The virtual storage arrays overcomes bandwidth and latency limitations of the wide area network by predicting and prefetching storage blocks, which are then cached at the branch location. Virtual storage arrays leverage an understanding of the semantics and structure of high-level data structures associated with storage blocks to predict which storage blocks are likely to be requested by a storage client in the near future. Virtual storage arrays determine the association between requested storage blocks and corresponding high-level data structure entities to predict additional high-level data structure entities that are likely to be accessed. From this, the virtual storage array identifies the additional storage blocks for prefetching.
    • 虚拟存储阵列整合了通过广域网连接的数据中心的分支数据存储。 虚拟存储阵列似乎将存储客户端视为本地数据存储; 但是,虚拟存储阵列实际上将数据存储在数据中心。 虚拟存储阵列通过预测和预取存储块来克服广域网的带宽和延迟限制,然后将这些存储块缓存到分支位置。 虚拟存储阵列充分了解与存储块关联的高级数据结构的语义和结构,以预测存储客户端在不久的将来可能需要哪些存储块。 虚拟存储阵列确定请求的存储块与相应的高级数据结构实体之间的关联,以预测可能被访问的其他高级数据结构实体。 由此,虚拟存储阵列识别用于预取的附加存储块。
    • 3. 发明申请
    • CONGESTION MANAGEMENT OVER LOSSY NETWORK CONNECTIONS
    • 通过网络连接失败的控制管理
    • WO2007016311A3
    • 2007-05-03
    • PCT/US2006029337
    • 2006-07-26
    • RIVERBED TECHNOLOGY INCMCCANNE STEVENGUPTA NITIN
    • MCCANNE STEVENGUPTA NITIN
    • H04J1/16H04J3/14
    • H04L47/10H04L1/0002H04L1/004H04L1/0057H04L1/1809H04L1/187H04L1/188H04L43/0835H04L43/0847H04L47/11H04L47/25H04L47/27
    • A network stack includes a packet loss analyzer that distinguishes between packet losses due to congestion and due to lossyness of network connections. The loss analyzer observes the packet loss patterns for comparison with a packet loss model. The packet loss model may be based on a Forward Error Correction (FEC) system. The loss analyzer determines if lost packets could have been recovered by a receiving network device, if FEC had been used. If the lost packets could have been corrected by FEC, the loss analyzer assumes that no network congestion exists and that the packet loss comes from the lossy aspects of the network, such as radio interference for wireless networks. If the loss analyzer determines that some of the lost packet could not have been recovered by the receiving network device, the loss analyzer assumes that network congestion causes these packet losses and reduces the data rate.
    • 网络堆栈包括分组丢失分析器,其区分由于拥塞引起的分组丢失以及由于网络连接的有损性。 损耗分析仪观察丢包模式,以便与丢包模型进行比较。 分组丢失模型可以基于前向纠错(FEC)系统。 如果使用了FEC,丢失分析器将确定丢失的数据包是否已被接收网络设备恢复。 如果丢失的分组可能被FEC纠正,则丢失分析器假设没有网络拥塞,并且分组丢失来自网络的有损方面,例如无线网络的无线电干扰。 如果丢失分析器确定某些丢失的分组不能被接收网络设备恢复,则丢失分析器假设网络拥塞导致这些分组丢失并降低数据速率。
    • 4. 发明申请
    • ACCESSING NETWORK TRAFFIC DATA AT MULTIPLE TIME SCALES AND LEVELS OF DETAIL
    • 在多个时间尺度和细节级别访问网络流量数据
    • WO2012122435A3
    • 2013-05-16
    • PCT/US2012028382
    • 2012-03-08
    • RIVERBED TECHNOLOGY INCDEGIOANNI LORISMCCANNE STEVENWHITE CHRISTOPHERVLACHOS DIMITRI
    • DEGIOANNI LORISMCCANNE STEVENWHITE CHRISTOPHERVLACHOS DIMITRI
    • G06F15/16G16H10/60
    • H04L43/022H04L43/026H04L43/04H04L43/10H04L43/12H04L63/30H04L67/1097Y02D50/30
    • Network traffic information from multiple sources, at multiple time scales, and at multiple levels of detail are integrated to more easily identify relevant network information. The network monitoring system stores and manipulates low-level and higher-level network traffic data separately to enable efficient data collection and storage. Packet traffic data is collected, stored, and analyzed at multiple locations. The network monitoring locations communicate summary and aggregate data to central modules, which combine this data to provide an end-to-end description of network traffic at coarser time scales. The network monitoring system enables users to zoom in on high-level, coarse time scale network performance data to one or more lower levels of network performance data at finer time scales. When high-level network performance data of interest is selected, corresponding low-level network performance data is retrieved from the appropriate distributed network monitoring locations to provide additional detailed information.
    • 来自多个源,多个时间尺度和多个细节级别的网络流量信息被集成以更容易地识别相关的网络信息。 网络监控系统分别存储和操纵低级别和更高级别的网络流量数据,以实现有效的数据收集和存储。 在多个位置收集,存储和分析数据包流量数据。 网络监控位置将汇总和汇总数据传送到中央模块,将这些数据组合在一起,以更粗糙的时间尺度提供端到端的网络流量描述。 网络监控系统使用户能够在更精细的时间尺度上将高级,粗糙的时间尺度网络性能数据放大到一个或多个较低级别的网络性能数据。 当选择感兴趣的高级网络性能数据时,从适当的分布式网络监控位置检索相应的低级网络性能数据,以提供额外的详细信息。
    • 5. 发明申请
    • ADDRESS MANIPULATION FOR USE IN TRANSACTION ACCELERATION OVER A NETWORK
    • 用于在网络中进行交易加速的地址操作
    • WO2007104031A3
    • 2008-10-02
    • PCT/US2007063621
    • 2007-03-08
    • RIVERBED TECHNOLOGY INCLANDRUM ALFREDLY KANDMCCANNE STEVEN
    • LANDRUM ALFREDLY KANDMCCANNE STEVEN
    • G06F15/16
    • H04L69/16H04L61/2528H04L61/2532H04L67/28H04L67/2876
    • In address manipulation enabled transaction accelerators, the transaction accelerators include outer connection addressing information in packets emitted over an inner connection between transaction accelerators and inner connection addressing information is added in packets sent over the inner connection. The inner connection addressing information can be carried in TCP option fields, directly in other fields, or indirectly through data structures maintained by the endpoints processing the connection. Address information can be encoded into header fields originally intended for other purposes but that are unused or encoded into used fields, overlaid in combination with other data that is being carried in those used fields. The existence of inner connection addressing information in a packet can be signaled by a flag in the packet, by a bit or other designated encoding. The flag can be in an unused header field or overlaid. Where replacement and option addition is needed, swappers and unswappers might be used.
    • 在启用地址操作的事务加速器中,事务加速器包括在事务加速器之间的内部连接上发送的分组中的外部连接寻址信息,并且内部连接寻址信息被添加到通过内部连接发送的分组中。 内部连接寻址信息可以在TCP选项字段中直接在其他字段中携带,或间接通过处理连接的端点维护的数据结构。 地址信息可以被编码为原始用于其他目的的标题字段,但是未被使用或编码为使用字段的报头字段,与在这些字段中携带的其他数据相结合。 分组中的内部连接寻址信息的存在可以通过分组中的标志,位或其他指定的编码来发出信号。 标志可以在未使用的标题字段中或覆盖。 在需要替换和选项的情况下,可能会使用swappers和unswappers。
    • 8. 发明申请
    • DATA SEGMENTATION USING SHIFT-VARYING PREDICATE FUNCTION FINGERPRINTING
    • 数据分割采用移动变化的预测函数指纹
    • WO2008083046A3
    • 2008-11-20
    • PCT/US2007088455
    • 2007-12-20
    • RIVERBED TECHNOLOGY INCMACE JAMES EANDERSON DAVID BMCCANNE STEVEN
    • MACE JAMES EANDERSON DAVID BMCCANNE STEVEN
    • G06F15/16
    • H04L47/10H04L47/27H04L47/365
    • Shift-varying segmentation uses a shift-varying predicate function to evaluate input data within a sliding window to determine if the current sliding window position should be a segment boundary. The shift-varying predicate function is a function of both the input data within the sliding window and the position of the sliding window relative to a previous segment boundary or the beginning of the input data. The shift-varying predicate function includes a containment property and may compute a hash value from the input data in the sliding window. The hash value is compared to a threshold value that is a function of the sliding window position. As the sliding window position advances away from a previous segment boundary, the probability of a segment boundary at the window position increases. Shift-varying segmentation can be used in compression, transaction acceleration, and data storage applications.
    • 移位变化分段使用移位变化谓词函数来评估滑动窗口内的输入数据以确定当前滑动窗口位置是否应该是分段边界。 换档变谓词功能既是滑动窗口内的输入数据和相对滑动之前段边界或输入数据的开始窗口的位置的函数。 位移变化谓词函数包含一个包含属性,并且可以根据滑动窗口中的输入数据计算散列值。 将散列值与作为滑动窗口位置的函数的阈值进行比较。 随着滑动窗口位置远离先前的分段边界,窗口位置处的分段边界的概率增加。 换档分段可用于压缩,事务加速和数据存储应用程序。
    • 9. 发明申请
    • ACCESSING NETWORK TRAFFIC DATA AT MULTIPLE TIME SCALES AND LEVELS OF DETAIL
    • 以多个时间尺度和细节水平访问网络流量数据
    • WO2012122435A9
    • 2013-07-11
    • PCT/US2012028382
    • 2012-03-08
    • RIVERBED TECHNOLOGY INCDEGIOANNI LORISMCCANNE STEVENWHITE CHRISTOPHERVLACHOS DIMITRI
    • DEGIOANNI LORISMCCANNE STEVENWHITE CHRISTOPHERVLACHOS DIMITRI
    • G06F15/16G16H10/60
    • H04L43/022H04L43/026H04L43/04H04L43/10H04L43/12H04L63/30H04L67/1097Y02D50/30
    • Network traffic information from multiple sources, at multiple time scales, and at multiple levels of detail are integrated to more easily identify relevant network information. The network monitoring system stores and manipulates low-level and higher-level network traffic data separately to enable efficient data collection and storage. Packet traffic data is collected, stored, and analyzed at multiple locations. The network monitoring locations communicate summary and aggregate data to central modules, which combine this data to provide an end-to-end description of network traffic at coarser time scales. The network monitoring system enables users to zoom in on high-level, coarse time scale network performance data to one or more lower levels of network performance data at finer time scales. When high-level network performance data of interest is selected, corresponding low-level network performance data is retrieved from the appropriate distributed network monitoring locations to provide additional detailed information.
    • 将来自多个来源,多个时间尺度以及多个细节层面的网络流量信息进行整合,以更轻松地识别相关的网络信息。 网络监控系统分别存储和处理低级别和高级别网络流量数据,以实现高效的数据收集和存储。 数据包流量数据在多个位置被收集,存储和分析。 网络监控位置将汇总和汇总数据传送给中央模块,中央模块将这些数据组合起来,以便在较粗的时间范围内提供网络流量的端到端描述。 网络监控系统使用户能够在更精确的时间范围内将高级粗时间尺度网络性能数据放大到一个或多个较低级别的网络性能数据。 当选择感兴趣的高级网络性能数据时,从适当的分布式网络监控位置检索相应的低级网络性能数据以提供额外的详细信息。
    • 10. 发明申请
    • CONTENT DELIVERY BASED ON USER AFFINITY USING CONNECTION END-POINT PROXIES
    • 使用连接端点代码的用户自定义内容传送
    • WO2006112845A9
    • 2008-01-03
    • PCT/US2005013285
    • 2005-04-19
    • RIVERBED TECHNOLOGY INCWU DAVID TZE-SIMCCANNE STEVEN
    • WU DAVID TZE-SIMCCANNE STEVEN
    • G06F17/30
    • G06F17/30902
    • In a network supporting transactions between clients and servers over a network path having operating characteristics to overcome, data is transported to overcome the operating characteristics using user affinities and dynamic user location information to selectively preload data, or representations, signatures, segments, etc. of data, in order to overcome the one or more operating characteristic. Examples of operating characteristics to overcome include bandwidth limitations, errors and latency. The dynamic location information can be stored in data structures accessible by agents of a data server and the data structures are populated based on user activities with respect to proxies associated with user locations, or the dynamic location information can be obtained implicitly as proxies maintain connections after termination by clients and the use of those maintained connections for preloading of data for the users associated with those clients. The data being preloaded can be protocol-specific data or protocol-independent data.
    • 在支持通过具有要克服的操作特征的网络路径的客户端和服务器之间的事务的网络中,使用用户亲和度和动态用户位置信息传输数据以克服操作特征,以选择性地预加载数据或表示,签名,段等 数据,以克服一个或多个操作特性。 要克服的操作特性的示例包括带宽限制,错误和延迟。 动态位置信息可以存储在可由数据服务器的代理访问的数据结构中,并且基于与用户位置相关联的代理的用户活动来填充数据结构,或者可以在代理维护连接之后隐含获取动态位置信息 客户端的终止以及使用这些维护的连接来为与这些客户端相关联的用户预加载数据。 预加载的数据可以是协议特定的数据或与协议无关的数据。