专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08850007B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US08850007B2
公开(公告)日：2014-09-30
申请号：US13156315
申请日：2011-06-08
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173 , G06F11/08 , G06F11/18 , G06F11/14 , G06F11/20 , G06F17/30 , G06F11/16
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

2. 发明授权

US08850018B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
公开(公告)号：US08850018B2
公开(公告)日：2014-09-30
申请号：US13156305
申请日：2011-06-08
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173 , G06F11/08 , G06F17/30 , G06F11/18 , G06F11/14 , G06F11/20 , G06F11/16
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

3. 发明申请

US20110238842A1 CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS 有权
标题翻译：服务器群集中的一致性集群数据使用REPLICAS的一个QUORUM
公开(公告)号：US20110238842A1
公开(公告)日：2011-09-29
申请号：US13156305
申请日：2011-06-08
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

4. 发明申请

US20110238813A1 CONSISTENT CLUSTER OPERATIONAL DATA IN A SERVER CLUSTER USING A QUORUM OF REPLICAS 有权
公开(公告)号：US20110238813A1
公开(公告)日：2011-09-29
申请号：US13156315
申请日：2011-06-08
申请人： MICHAEL T. MASSA , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
发明人： MICHAEL T. MASSA , David A. Dion , Rajsekhar Das , Rushabh A. Doshi , David B. Lomet , Gor N. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F15/173
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

5. 发明授权

US08719473B2 Resource arbitration for shared-write access via persistent reservation 有权
标题翻译：通过永久保留进行共享写访问的资源仲裁
公开(公告)号：US08719473B2
公开(公告)日：2014-05-06
申请号：US12233862
申请日：2008-09-19
申请人： Rajsekhar Das , David A. Dion
发明人： Rajsekhar Das , David A. Dion
IPC分类号： G06F13/00 , G06F3/00
CPC分类号： H04L67/1097 , G06F3/0622 , G06F3/0631 , G06F3/0659 , G06F3/067 , G06F3/0689 , G06F11/2033 , G06F11/2046 , G06F2209/5014
摘要： Described is a technology by which an owner node in a server cluster maintains ownership of a storage mechanism through a persistent reservation mechanism, while allowing non-owning nodes read and write access to the storage mechanism. An owner node writes a reservation key to a registration table associated with the storage mechanism. Non-owning nodes write a shared key that gives them read and write access. The owner node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. The owner node also defends ownership against challenges to ownership made by other nodes, so that another node can take over ownership if a (formerly) owning node is unable to defend, e.g., because of a failure.
摘要翻译：描述了一种技术，通过该技术，服务器集群中的所有者节点通过持久预留机制来维护存储机制的所有权，同时允许非拥有节点对存储机制进行读写访问。所有者节点将预留密钥写入与存储机制相关联的注册表。非拥有节点写入一个共享密钥，为其提供读写访问权限。所有者节点根据集群成员数据验证共享密钥，并抢占（例如，删除）任何被认为无效的密钥。所有者节点还保护所有权不受其他节点所有权的挑战，从而如果（以前拥有）节点无法保护，例如由于失败，另一个节点可以占有所有权。

6. 发明授权

US07774469B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US07774469B2
公开(公告)日：2010-08-10
申请号：US11225222
申请日：2005-09-12
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
IPC分类号： G06F15/173 , G06F11/00
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

7. 发明申请

US20100077249A1 RESOURCE ARBITRATION FOR SHARED-WRITE ACCESS VIA PERSISTENT RESERVATION 有权
标题翻译：资源仲裁通过持续保留进行共享访问
公开(公告)号：US20100077249A1
公开(公告)日：2010-03-25
申请号：US12233862
申请日：2008-09-19
申请人： Rajsekhar Das , David A. Dion
发明人： Rajsekhar Das , David A. Dion
IPC分类号： G06F11/20
CPC分类号： H04L67/1097 , G06F3/0622 , G06F3/0631 , G06F3/0659 , G06F3/067 , G06F3/0689 , G06F11/2033 , G06F11/2046 , G06F2209/5014
摘要： Described is a technology by which an owner node in a server cluster maintains ownership of a storage mechanism through a persistent reservation mechanism, while allowing non-owning nodes read and write access to the storage mechanism. An owner node writes a reservation key to a registration table associated with the storage mechanism. Non-owning nodes write a shared key that gives them read and write access. The owner node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. The owner node also defends ownership against challenges to ownership made by other nodes, so that another node can take over ownership if a (formerly) owning node is unable to defend, e.g., because of a failure.
摘要翻译：描述了一种技术，通过该技术，服务器集群中的所有者节点通过持久预留机制来维护存储机制的所有权，同时允许非拥有节点对存储机制进行读写访问。所有者节点将预留密钥写入与存储机制相关联的注册表。非拥有节点写入一个共享密钥，为其提供读写访问权限。所有者节点根据集群成员数据验证共享密钥，并抢占（例如，删除）任何被认为无效的密钥。所有者节点还保护所有权不受其他节点所有权的挑战，从而如果（以前拥有）节点无法保护，例如由于失败，另一个节点可以占有所有权。

8. 发明授权

US08463762B2 Volumes and file system in cluster shared volumes 有权
标题翻译：集群共享卷中的卷和文件系统
公开(公告)号：US08463762B2
公开(公告)日：2013-06-11
申请号：US12971322
申请日：2010-12-17
申请人： Vladimir Petter , Vinod R. Shankar , Andrea D'Amato , Rajsekhar Das
发明人： Vladimir Petter , Vinod R. Shankar , Andrea D'Amato , Rajsekhar Das
IPC分类号： G06F17/00
CPC分类号： G06F17/30115
摘要： The present invention extends to methods, systems, and computer program products for sharing volumes between clustered nodes. Embodiments of the invention include a Clustered Shared Volume File System (CsvFs) that appears to clients as a local file system. The CsvFs communicates to a node where a disk is mounted to coordinate access to files on the disks. CsvFs uses Opportunistic Locks (oplocks) to decide when direct access to a volume is safe. CsvFs can be extended with oplock upgrade mechanisms that allow a coordinating node to tell CsvFs when it is safe to attempt to upgrade oplock. CsvFs also uses a transitivity property of oplocks to be able to grant (delegate) oplocks to clients that are on top of CsvFs.
摘要翻译：本发明扩展到用于在集群节点之间共享卷的方法，系统和计算机程序产品。本发明的实施例包括作为本地文件系统向客户端显示的群集共享卷文件系统（CsvF）。 CsvF与安装磁盘的节点通信，以协调对磁盘上文件的访问。 CsvFs使用机会锁（oplocks）来决定直接访问卷是否安全。可以使用oplock升级机制来扩展CsvF，允许协调节点在尝试升级oplock时安全地告诉CsvF。 CsvFs还使用oplock的传递性属性能够向位于CsvF之上的客户端授予（委托）oplock。

9. 发明授权

US08411863B2 Full volume encryption in a clustered environment 有权
标题翻译：集群环境中的全卷加密
公开(公告)号：US08411863B2
公开(公告)日：2013-04-02
申请号：US12244888
申请日：2008-10-03
申请人： Octavian T. Ureche , Scott A. Brender , Elden Theodore Christensen , Rajsekhar Das
发明人： Octavian T. Ureche , Scott A. Brender , Elden Theodore Christensen , Rajsekhar Das
IPC分类号： H04L9/00
CPC分类号： H04L9/08 , G06F21/80 , H04L9/0891
摘要： Full volume encryption can be applied to volumes in a clustering environment. To simplify the maintenance of keys relevant to such encrypted volumes, a cluster key table construct can be utilized, where each entry of the cluster key table corresponds to an encrypted volume and comprises an identification of the encrypted volume and a key needed to access that volume. Keys can be protected by encrypting them with a key specific to each computing device storing the cluster key table. Updates can be propagated among the computing devices in the cluster by first decrypting the keys and then reencrypting them with a key specific to each computing device as they are stored on those computing devices. Access control requirements can also be added to the entries in the cluster key table. Alternative access control requirements can be accommodated by assigning multiple independent entries to a single encrypted volume.
摘要翻译：完整卷加密可以应用于群集环境中的卷。为了简化与这种加密卷相关的密钥的维护，可以利用集群密钥表结构，其中集群密钥表的每个条目对应于加密卷，并且包括加密卷的标识和访问该卷所需的密钥。可以使用特定于存储群集密钥表的每个计算设备的密钥对密钥进行加密来保护密钥。可以通过首先对密钥进行解密，然后在每个计算设备存储在这些计算设备上的每个计算设备特定的密钥来重新加密，从而可以在群集中的计算设备之间传播更新。访问控制要求也可以添加到群集密钥表中的条目。可以通过将多个独立条目分配给单个加密卷来实现替代的访问控制要求。

10. 发明申请

US20120158681A1 VOLUMES AND FILE SYSTEM IN CLUSTER SHARED VOLUMES 有权
标题翻译：群集共享卷中的卷和文件系统
公开(公告)号：US20120158681A1
公开(公告)日：2012-06-21
申请号：US12971322
申请日：2010-12-17
申请人： Vladimir Petter , Vinod R. Shankar , Andrea D'Amato , Rajsekhar Das
发明人： Vladimir Petter , Vinod R. Shankar , Andrea D'Amato , Rajsekhar Das
IPC分类号： G06F17/30
CPC分类号： G06F17/30115
摘要： The present invention extends to methods, systems, and computer program products for sharing volumes between clustered nodes. Embodiments of the invention include a Clustered Shared Volume File System (CsvFs) that appears to clients as a local file system. The CsvFs communicates to a node where a disk is mounted to coordinate access to files on the disks. CsvFs uses Opportunistic Locks (oplocks) to decide when direct access to a volume is safe. CsvFs can be extended with oplock upgrade mechanisms that allow a coordinating node to tell CsvFs when it is safe to attempt to upgrade oplock. CsvFs also uses a transitivity property of oplocks to be able to grant (delegate) oplocks to clients that are on top of CsvFs.
摘要翻译：本发明扩展到用于在集群节点之间共享卷的方法，系统和计算机程序产品。本发明的实施例包括作为本地文件系统向客户端显示的群集共享卷文件系统（CsvF）。 CsvF与安装磁盘的节点通信，以协调对磁盘上文件的访问。 CsvFs使用机会锁（oplocks）来决定直接访问卷是否安全。可以使用oplock升级机制来扩展CsvF，允许协调节点在尝试升级oplock时安全地告诉CsvF。 CsvFs还使用oplock的传递性属性能够向位于CsvF之上的客户端授予（委托）oplock。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式