会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • VIRTUALIZED DATA STORAGE SYSTEM ARCHITECTURE
    • 虚拟化数据存储系统架构
    • US20100241673A1
    • 2010-09-23
    • US12730185
    • 2010-03-23
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • G06F17/30G06F9/455
    • 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.
    • 虚拟存储阵列将通过广域网连接的数据中心的分支数据存储整合。 虚拟存储阵列对存储客户端显示为本地数据存储; 然而,虚拟存储阵列实际上将数据存储在数据中心。 虚拟存储阵列通过预测和预取存储块来克服广域网的带宽和延迟限制,然后将存储块缓存在分支位置。 虚拟存储阵列利用对与存储块相关联的高级数据结构的语义和结构的理解,以预测存储客户端在不久的将来可能要求哪些存储块。 虚拟存储阵列确定所请求的存储块和相应的高级数据结构实体之间的关联,以预测可能被访问的附加高级数据结构实体。 从此,虚拟存储阵列识别用于预取的附加存储块。
    • 2. 发明申请
    • Booting Devices Using Virtual Storage Arrays Over Wide-Area Networks
    • 引导设备在广域网上使用虚拟存储阵列
    • US20120030456A1
    • 2012-02-02
    • US13166321
    • 2011-06-22
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • G06F15/177
    • G06F3/0605G06F3/0665G06F3/067G06F9/5077H04L67/025
    • Virtual storage arrays consolidate data storage at a data center for physical and virtual computer systems at one or more branch network locations. Standalone and virtualized computer systems at a branch network location load, execute, and store their operating systems, applications, and data using virtual storage arrays and do not require any built-in or external non-volatile data storage devices such as hard disk drives or solid-state drives at the branch network location. The virtual disks of the virtual storage array are mapped to physical data storage at the data center and accessed via a WAN using storage block-based protocols. A storage block cache at the branch network location includes storage blocks prefetched based on knowledge about the computer systems at the branch network location and the behavior of their operating systems and applications.
    • 虚拟存储阵列将物理和虚拟计算机系统的数据中心的数据存储整合到一个或多个分支网络位置。 分支网络位置的独立虚拟化计算机系统使用虚拟存储阵列加载,执行和存储其操作系统,应用程序和数据,并且不需要任何内置或外部非易失性数据存储设备,如硬盘驱动器或 固态驱动器在分支网络位置。 虚拟存储阵列的虚拟磁盘映射到数据中心的物理数据存储,并使用基于存储块的协议通过WAN访问。 分支网络位置处的存储块高速缓存包括基于关于分支网络位置处的计算机系统的知识以及其操作系统和应用的行为而预取的存储块。
    • 3. 发明申请
    • VIRTUALIZED DATA STORAGE SYSTEM CACHE MANAGEMENT
    • 虚拟化数据存储系统高速缓存管理
    • US20100241807A1
    • 2010-09-23
    • US12730192
    • 2010-03-23
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • G06F12/08G06F12/00
    • G06F16/188G06F3/0643G06F3/0653G06F3/067G06F12/0862G06F16/172G06F2212/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.
    • 虚拟存储阵列将通过广域网连接的数据中心的分支数据存储整合。 虚拟存储阵列对存储客户端显示为本地数据存储; 然而,虚拟存储阵列实际上将数据存储在数据中心。 虚拟存储阵列通过预测和预取存储块来克服广域网的带宽和延迟限制,然后将存储块缓存在分支位置。 虚拟存储阵列利用对与存储块相关联的高级数据结构的语义和结构的理解,以预测存储客户端在不久的将来可能要求哪些存储块。 虚拟存储阵列确定所请求的存储块和相应的高级数据结构实体之间的关联,以预测可能被访问的附加高级数据结构实体。 从此,虚拟存储阵列识别用于预取的附加存储块。
    • 5. 发明授权
    • Booting devices using virtual storage arrays over wide-area networks
    • 使用虚拟存储阵列在广域网上引导设备
    • US08677111B2
    • 2014-03-18
    • US13166321
    • 2011-06-22
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • David Tze-Si WuSteven McCanneMichael J. DemmerNitin Gupta
    • G06F15/177
    • G06F3/0605G06F3/0665G06F3/067G06F9/5077H04L67/025
    • Virtual storage arrays consolidate data storage at a data center for physical and virtual computer systems at one or more branch network locations. Standalone and virtualized computer systems at a branch network location load, execute, and store their operating systems, applications, and data using virtual storage arrays and do not require any built-in or external non-volatile data storage devices such as hard disk drives or solid-state drives at the branch network location. The virtual disks of the virtual storage array are mapped to physical data storage at the data center and accessed via a WAN using storage block-based protocols. A storage block cache at the branch network location includes storage blocks prefetched based on knowledge about the computer systems at the branch network location and the behavior of their operating systems and applications.
    • 虚拟存储阵列将物理和虚拟计算机系统的数据中心的数据存储整合到一个或多个分支网络位置。 分支网络位置的独立虚拟化计算机系统使用虚拟存储阵列加载,执行和存储其操作系统,应用程序和数据,并且不需要任何内置或外部非易失性数据存储设备,如硬盘驱动器或 固态驱动器在分支网络位置。 虚拟存储阵列的虚拟磁盘映射到数据中心的物理数据存储,并使用基于存储块的协议通过WAN访问。 分支网络位置处的存储块高速缓存包括基于关于分支网络位置处的计算机系统的知识以及其操作系统和应用的行为而预取的存储块。
    • 6. 发明授权
    • Automatic framing selection
    • 自动选框
    • US08792493B2
    • 2014-07-29
    • US13491501
    • 2012-06-07
    • David Tze-Si WuSoren LasenKartik SubbanaNitin GuptaVivasvat Keswani
    • David Tze-Si WuSoren LasenKartik SubbanaNitin GuptaVivasvat Keswani
    • H04L12/28H04L12/26H04L12/56
    • 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.
    • 监控网络流量,并自动确定和应用最优的框架启发式。 成帧启发式规定了组网网络流量的不同规则。 虽然将框架启发式应用于网络流量,但是针对网络流量推测性地评估了替代成帧启发式算法。 这些评估的结果用于对框架启发式进行排序。 选择具有最佳排名的成帧启发式来构建后续网络流量。 每个客户端/服务器流量流可以具有单独的成帧启发式。 帧启发式可以是基于字节计数和/或时间的确定性的,或者基于指示发生框架的合理点的业务特性。 可选帧启发式可以部分地通过手动配置来确定,该手动配置指定哪些帧启发式是可用的,并且部分地由自动进程确定,自动进程决定了应用于可用成帧启发式组的当前网络业务的最佳成帧启发式。
    • 8. 发明授权
    • Automatic framing selection
    • 自动选框
    • US08204058B2
    • 2012-06-19
    • US11494364
    • 2006-07-26
    • David Tze-Si WuSoren LasenKartik SubbanaNitin GuptaVivasvat Keswani
    • David Tze-Si WuSoren LasenKartik SubbanaNitin GuptaVivasvat Keswani
    • H04L12/28
    • 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.
    • 监控网络流量,并自动确定和应用最优的框架启发式。 成帧启发式规定了组网网络流量的不同规则。 虽然将框架启发式应用于网络流量,但是针对网络流量推测性地评估了替代成帧启发式算法。 这些评估的结果用于对框架启发式进行排序。 选择具有最佳排名的成帧启发式来构建后续网络流量。 每个客户端/服务器流量流可以具有单独的成帧启发式。 帧启发式可以是基于字节计数和/或时间的确定性的,或者基于指示发生框架的合理点的业务特性。 可选帧启发式可以部分地通过手动配置来确定,该手动配置指定哪些帧启发式是可用的,并且部分地由自动进程确定,自动进程决定了应用于可用成帧启发式组的当前网络业务的最佳成帧启发式。
    • 9. 发明申请
    • Automatic framing selection
    • 自动选框
    • US20070064717A1
    • 2007-03-22
    • US11494364
    • 2006-07-26
    • David Tze-Si WuSoren LasenKartik SubbanaNitin GuptaVivasvat Keswani
    • David Tze-Si WuSoren LasenKartik SubbanaNitin GuptaVivasvat Keswani
    • H04L12/56
    • 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.
    • 监控网络流量,并自动确定和应用最优的框架启发式。 成帧启发式规定了组网网络流量的不同规则。 虽然将框架启发式应用于网络流量,但是针对网络流量推测性地评估了替代成帧启发式算法。 这些评估的结果用于对框架启发式进行排序。 选择具有最佳排名的成帧启发式来构建后续网络流量。 每个客户端/服务器流量流可以具有单独的成帧启发式。 帧启发式可以是基于字节计数和/或时间的确定性的,或者基于指示发生框架的合理点的业务特性。 可选帧启发式可以部分地通过手动配置来确定,该手动配置指定哪些帧启发式是可用的,并且部分地由自动进程确定,自动进程决定了应用于可用成帧启发式组的当前网络业务的最佳成帧启发式。
    • 10. 发明申请
    • AUTOMATIC FRAMING SELECTION
    • 自动框架选择
    • US20130114439A1
    • 2013-05-09
    • US13491501
    • 2012-06-07
    • David Tze-Si WuSoren LassenKartik SubbanaNitin GuptaVivasvat Keswani
    • David Tze-Si WuSoren LassenKartik SubbanaNitin GuptaVivasvat Keswani
    • H04L12/56
    • 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.
    • 监控网络流量,并自动确定和应用最优的框架启发式。 成帧启发式规定了组网网络流量的不同规则。 虽然将框架启发式应用于网络流量,但是针对网络流量推测性地评估了替代成帧启发式算法。 这些评估的结果用于对框架启发式进行排序。 选择具有最佳排名的成帧启发式来构建后续网络流量。 每个客户端/服务器流量流可以具有单独的成帧启发式。 帧启发式可以是基于字节计数和/或时间的确定性的,或者基于指示发生框架的合理点的业务特性。 可选帧启发式可以部分地通过手动配置来确定,该手动配置指定哪些帧启发式是可用的,并且部分地由自动进程确定,自动进程决定了应用于可用成帧启发式组的当前网络业务的最佳成帧启发式。