DYNAMIC PLACEMENT OF REPLICA DATA
    1.
    发明申请
    DYNAMIC PLACEMENT OF REPLICA DATA 审中-公开
    动态放置数据

    公开(公告)号:WO2010124024A2

    公开(公告)日:2010-10-28

    申请号:PCT/US2010/031942

    申请日:2010-04-21

    CPC classification number: G06F17/30215 G06F11/1446 G06F11/2094 G06F17/30212

    Abstract: The claimed subject matter relates to systems and/or methodologies that facilitate distributed storage of data. A distributed file system can be implemented on storage nodes such that the system places multiple copies of data (e.g., replicas) on a variety of disparate storage nodes to guarantee availability of the data and minimize loss of the data. Storage nodes are dynamically evaluated to identify respective characteristics. In one example, the characteristics can include availability of a storage node, capacity of a storage node, data storage cost associated with a storage node, data transfer costs associated with a storage node, locality of a storage node, network topology, or user preferences associated with a storage node. The characteristics can be employed to generate optimal placements decisions.

    Abstract translation: 所要求保护的主题涉及促进数据分布式存储的系统和/或方法。 可以在存储节点上实现分布式文件系统,使得系统将多个数据副本(例如,副本)放置在各种不同的存储节点上,以保证数据的可用性和最小化数据丢失。 动态评估存储节点以识别相应的特征。 在一个示例中,特征可以包括存储节点的可用性,存储节点的容量,与存储节点相关联的数据存储成本,与存储节点相关联的数据传输成本,存储节点的位置,网络拓扑或用户偏好 与存储节点相关联。 可以使用这些特征来产生最佳的布局决定。

    INTELLIGENT TIERS OF BACKUP DATA
    2.
    发明申请
    INTELLIGENT TIERS OF BACKUP DATA 审中-公开
    智能数据备份

    公开(公告)号:WO2010124023A2

    公开(公告)日:2010-10-28

    申请号:PCT/US2010/031939

    申请日:2010-04-21

    Abstract: The claimed subject matter relates to systems and/or methodologies that facilitate intelligent distribution of backup information across storage locations in network-based backup architectures. A virtual layering of backup information across storage locations in the backup architecture can be implemented. Statistical models are utilized to dynamically re-allocate backup information among storage locations and/or layers to ensure availability of data, minimum latency upon restore, and minimum bandwidth utilization upon restore. In addition, heuristics or machine learning techniques can be applied to proactively detect failures or other changes in storage locations such that backup information can be reallocated accordingly prior to a failure.

    Abstract translation: 所要求保护的主题涉及促进基于网络的备份架构中的备份信息跨存储位置的智能分发的系统和/或方法。 可以实现备份架构中跨存储位置的备份信息的虚​​拟分层。 统计模型用于在存储位置和/或层之间动态重新分配备份信息,以确保数据的可用性,恢复时的最小延迟以及还原时的最小带宽利用率。 此外,可以应用启发式或机器学习技术来主动检测存储位置中的故障或其他变化,从而可以在发生故障之前相应地重新分配备份信息。

    DIFFERENTIAL FILE AND SYSTEM RESTORES FROM PEERS AND THE CLOUD
    3.
    发明申请
    DIFFERENTIAL FILE AND SYSTEM RESTORES FROM PEERS AND THE CLOUD 审中-公开
    差异文件和系统恢复从同伴和云

    公开(公告)号:WO2010114777A2

    公开(公告)日:2010-10-07

    申请号:PCT/US2010/028957

    申请日:2010-03-26

    Abstract: Provided herein are systems and methodologies for highly efficient restoration in a network-based backup system. As described herein, differential-based analysis can be utilized such that a new complete differential is calculated based on signatures and/or other information relating to a given item to be restored prior to retrieving backup data. Based on the differential, only blocks determined to be unique between the current version of the item and the desired version are transmitted, which can then be merged with non-unique locally present blocks to obtain the fully restored version of the item. Further, a hybrid architecture can be employed, wherein signatures and/or data are stored at a global location within a network as well as one or more local peers. Accordingly, a backup client can obtain information necessary for restoration from either the global location or a nearby peer, further reducing latency and bandwidth consumption.

    Abstract translation: 这里提供了用于在基于网络的备份系统中高效恢复的系统和方法。 如本文所述,可以利用基于差分的分析,使得基于在检索备份数据之前将要恢复的给定项目的签名和/或其他信息来计算新的完整差分。 基于差分,仅发送在当前版本的项目和期望版本之间确定为唯一的块,然后可以将其与非唯一本地存在的块合并,以获得项目的完全恢复版本。 此外,可以采用混合架构,其中签名和/或数据被存储在网络内的全局位置以及一个或多个本地对等体。 因此,备份客户端可以从全球位置或附近对等体获得恢复所需的信息,进一步减少等待时间和带宽消耗。

    FEEDBACK LOOP FOR SPAM PREVENTION
    4.
    发明公开
    FEEDBACK LOOP FOR SPAM PREVENTION 审中-公开
    RÜCKKOPPLUNGSSCHLEIFEZUR VERHINDERUNG VON SPAM

    公开(公告)号:EP1599781A2

    公开(公告)日:2005-11-30

    申请号:EP04714607.1

    申请日:2004-02-25

    CPC classification number: H04L51/12 G06Q10/107

    Abstract: The subject invention provides for a feedback loop system and method that facilitate classifying items in connection with spam prevention in server and/or client-based architectures. The invention makes uses of a machine-learning approach as applied to spam filters, and in particular, randomly samples incoming email messages so that examples of both legitimate and junk/spam mail are obtained to generate sets of training data. Users which are identified as spam-fighters are asked to vote on whether a selection of their incoming email messages is individually either legitimate mail or junk mail. A database stores the properties for each mail and voting transaction such as user information, message properties and content summary, and polling results for each message to generate training data for machine learning systems. The machine learning systems facilitate creating improved spam filter(s) that are trained to recognize both legitimate mail and spam mail and to distinguish between them.

    Abstract translation: 本发明提供了一种反馈回路系统和方法,其有助于在服务器和/或基于客户端的体系结构中与垃圾邮件防止相关联的项目进行分类。 本发明利用机器学习方法应用于垃圾邮件过滤器,特别是随机抽取传入的电子邮件消息,以便获得合法和垃圾/垃圾邮件的示例以产生一组训练数据。 被要求被识别为垃圾邮件机的用户被要求对所接收的电子邮件的选择是否是合法邮件或垃圾邮件进行投票。 数据库存储每个邮件和投票交易的属性,例如用户信息,消息属性和内容摘要,以及每个消息的轮询结果以生成机器学习系统的训练数据。 机器学习系统便于创建改进的垃圾邮件过滤器,该过滤器被训练以识别合法邮件和垃圾邮件并区分它们。

    DYNAMIC PLACEMENT OF REPLICA DATA
    5.
    发明公开
    DYNAMIC PLACEMENT OF REPLICA DATA 审中-公开
    副本数据可动态布置

    公开(公告)号:EP2422290A2

    公开(公告)日:2012-02-29

    申请号:EP10767727.0

    申请日:2010-04-21

    CPC classification number: G06F17/30215 G06F11/1446 G06F11/2094 G06F17/30212

    Abstract: The claimed subject matter relates to systems and/or methodologies that facilitate distributed storage of data. A distributed file system can be implemented on storage nodes such that the system places multiple copies of data (e.g., replicas) on a variety of disparate storage nodes to guarantee availability of the data and minimize loss of the data. Storage nodes are dynamically evaluated to identify respective characteristics. In one example, the characteristics can include availability of a storage node, capacity of a storage node, data storage cost associated with a storage node, data transfer costs associated with a storage node, locality of a storage node, network topology, or user preferences associated with a storage node. The characteristics can be employed to generate optimal placements decisions.

    DIFFERENTIAL FILE AND SYSTEM RESTORES FROM PEERS AND THE CLOUD
    6.
    发明公开
    DIFFERENTIAL FILE AND SYSTEM RESTORES FROM PEERS AND THE CLOUD 审中-公开
    差分数据和同行的系统恢复和云的OUT

    公开(公告)号:EP2414933A2

    公开(公告)日:2012-02-08

    申请号:EP10759248.7

    申请日:2010-03-26

    Abstract: Provided herein are systems and methodologies for highly efficient restoration in a network-based backup system. As described herein, differential-based analysis can be utilized such that a new complete differential is calculated based on signatures and/or other information relating to a given item to be restored prior to retrieving backup data. Based on the differential, only blocks determined to be unique between the current version of the item and the desired version are transmitted, which can then be merged with non-unique locally present blocks to obtain the fully restored version of the item. Further, a hybrid architecture can be employed, wherein signatures and/or data are stored at a global location within a network as well as one or more local peers. Accordingly, a backup client can obtain information necessary for restoration from either the global location or a nearby peer, further reducing latency and bandwidth consumption.

Patent Agency Ranking