公开(公告)号：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.

摘要翻译： 描述了一种技术，通过该技术，服务器集群中的所有者节点通过持久预留机制来维护存储机制的所有权，同时允许非拥有节点对存储机制进行读写访问。 所有者节点将预留密钥写入与存储机制相关联的注册表。 非拥有节点写入一个共享密钥，为其提供读写访问权限。 所有者节点根据集群成员数据验证共享密钥，并抢占（例如，删除）任何被认为无效的密钥。 所有者节点还保护所有权不受其他节点所有权的挑战，从而如果（以前拥有）节点无法保护，例如由于失败，另一个节点可以占有所有权。

公开(公告)号：US20110252208A1

公开(公告)日：2011-10-13

申请号：US12758042

申请日：2010-04-12

申请人： Abid Ali ,  Amit Singla ,  Manmeet S. Dhody ,  Arun Kumar M. ,  Rajsekhar Das

发明人： Abid Ali ,  Amit Singla ,  Manmeet S. Dhody ,  Arun Kumar M. ,  Rajsekhar Das

IPC分类号： G06F12/16 ,  G06F9/455 ,  G06F12/00

CPC分类号： G06F11/1451 ,  G06F2201/815 ,  G06F2201/84

摘要： A computer-implemented method includes creating a first snapshot of at least one virtual machine at a first time. The first snapshot is created at a computing device of a cluster of computing devices configured to share the at least one virtual machine. As an example, each computing device in the cluster may modify the shared virtual machine via a direct input/output (I/O) transaction, bypassing a file-system stack. The first snapshot is transmitted to a backup device. The method includes creating a second snapshot of the at least one virtual machine at a second time and determining a set of changed data blocks associated with a difference between the second snapshot and the first snapshot. The set of changed blocks is transmitted to the backup device.

摘要翻译： 计算机实现的方法包括在第一时间创建至少一个虚拟机的第一快照。 第一快照是在被配置为共享至少一个虚拟机的计算设备的集群的计算设备上创建的。 作为示例，集群中的每个计算设备可以通过直接输入/输出（I / O）事务来绕过文件系统堆栈来修改共享虚拟机。 第一个快照被传送到备份设备。 该方法包括在第二时间创建所述至少一个虚拟机的第二快照，并且确定与第二快照和第一快照之间的差异相关联的一组改变的数据块。 更改的块的集合被传送到备份设备。

公开(公告)号：US07877553B2

公开(公告)日：2011-01-25

申请号：US11834028

申请日：2007-08-06

申请人： Thothathri Vanamamalai ,  Karan Mehra ,  Paul Adrian Oltean ,  Rajsekhar Das ,  Norbert Kusters

发明人： Thothathri Vanamamalai ,  Karan Mehra ,  Paul Adrian Oltean ,  Rajsekhar Das ,  Norbert Kusters

IPC分类号： G06F13/00

CPC分类号： G06F11/2074 ,  G06F11/2041 ,  G06F11/2048 ,  G06F17/30088

摘要： Aspects of the subject matter described herein relate to sharing volume data via shadow copies. In aspects, an active computer creates a shadow copy of a volume. The shadow copy is exposed to one or more passive computers that may read but not write to the volume. A passive computer may obtain data from the shadow copy by determining whether the data has been written to a differential area and, if so, reading it from the differential area. If the data has not been written to the differential area, the passive computer may obtain it by first reading it from the volume, then re-determining whether it has been written to the differential area, and if so, reading the data from the differential area. Otherwise, the data read from the volume corresponds to the data needed for the shadow copy.

摘要翻译： 本文描述的主题的方面涉及通过卷影副本共享卷数据。 在方面，活动计算机创建卷的卷影副本。 影子副本暴露给可能读取但不写入卷的一个或多个被动计算机。 无源计算机可以通过确定数据是否被写入差分区域而从影子拷贝获得数据，如果是，则从差分区域读取数据。 如果数据尚未写入差分区域，则无源计算机可以通过首先从卷中读取数据，然后重新确定是否将其写入差分区域，如果是，则从差分读取数据 区。 否则，从卷读取的数据对应于卷影副本所需的数据。

公开(公告)号：US20090327798A1

公开(公告)日：2009-12-31

申请号：US12147956

申请日：2008-06-27

申请人： Andrea D'Amato ,  Rajeev Y. Nagar ,  Gor Nishanov ,  Rajsekhar Das ,  Gregorio Maeso

发明人： Andrea D'Amato ,  Rajeev Y. Nagar ,  Gor Nishanov ,  Rajsekhar Das ,  Gregorio Maeso

IPC分类号： G06F17/30 ,  G06F13/14 ,  G06F11/16

CPC分类号： G06F3/0637 ,  G06F3/062 ,  G06F3/0635 ,  G06F3/067 ,  G06F11/1482 ,  G06F11/2035 ,  G06F11/2046 ,  G06F17/30091 ,  H04L67/1097 ,  H04L69/40

摘要： Described is a technology by which a storage volume is shared by cluster nodes of a server cluster. In one implementation, each node includes a redirector that provides shared access to the volume from that node. The redirector routes file system metadata requests from applications and the like through a first (e.g., SMB) communications path to the owning node, and routes file system read and write data to the storage device through a second, high-speed communications path such as direct direct block level I/O. An owning node maintains ownership of the storage device through a persistent reservation mechanism that writes a key to a registration table associated with the storage device. Non-owning nodes write a shared key. The owning node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. Security mechanisms for controlling access are also described.

摘要翻译： 描述了存储卷由服务器集群的集群节点共享的技术。 在一个实现中，每个节点包括重定向器，其向该节点提供对卷的共享访问。 重定向器通过第一（例如SMB）通信路径将应用程序等的文件系统元数据请求路由到所有者节点，并通过第二高速通信路径将文件系统读写数据路由到存储设备，例如 直接直接块级I / O。 拥有节点通过将密钥写入与存储设备相关联的注册表的持久预留机制来维护存储设备的所有权。 非拥有节点写共享密钥。 拥有节点根据集群成员数据验证共享密钥，并抢占（例如删除）任何被认为无效的密钥。 还描述了用于控制访问的安全机制。

公开(公告)号：US20060090095A1

公开(公告)日：2006-04-27

申请号：US11225222

申请日：2005-09-12

申请人： Michael Massa ,  David Dion ,  Rajsekhar Das ,  Rushabh Doshi ,  David Lomet ,  Gor Nishanov ,  Philip Bernstein ,  Rod Gamache ,  Rohit Jain ,  Sunita Shrivastava

发明人： Michael Massa ,  David Dion ,  Rajsekhar Das ,  Rushabh Doshi ,  David Lomet ,  Gor Nishanov ,  Philip Bernstein ,  Rod Gamache ,  Rohit Jain ,  Sunita Shrivastava

IPC分类号： 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.

摘要翻译： 通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。 副本成员维护集群操作数据。 当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。 仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。 仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。 仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

公开(公告)号：US07840730B2

公开(公告)日：2010-11-23

申请号：US12147956

申请日：2008-06-27

申请人： Andrea D'Amato ,  Rajeev Y. Nagar ,  Gor Nishanov ,  Rajsekhar Das ,  Gregorio Maeso

发明人： Andrea D'Amato ,  Rajeev Y. Nagar ,  Gor Nishanov ,  Rajsekhar Das ,  Gregorio Maeso

IPC分类号： G06F19/00

CPC分类号： G06F3/0637 ,  G06F3/062 ,  G06F3/0635 ,  G06F3/067 ,  G06F11/1482 ,  G06F11/2035 ,  G06F11/2046 ,  G06F17/30091 ,  H04L67/1097 ,  H04L69/40

摘要： Described is a technology by which a storage volume is shared by cluster nodes of a server cluster. In one implementation, each node includes a redirector that provides shared access to the volume from that node. The redirector routes file system metadata requests from applications and the like through a first (e.g., SMB) communications path to the owning node, and routes file system read and write data to the storage device through a second, high-speed communications path such as direct direct block level I/O. An owning node maintains ownership of the storage device through a persistent reservation mechanism that writes a key to a registration table associated with the storage device. Non-owning nodes write a shared key. The owning node validates the shared keys against cluster membership data, and preempts (e.g., removes) any key deemed not valid. Security mechanisms for controlling access are also described.

摘要翻译： 描述了存储卷由服务器集群的集群节点共享的技术。 在一个实现中，每个节点包括重定向器，其向该节点提供对卷的共享访问。 重定向器通过第一（例如SMB）通信路径将应用程序等的文件系统元数据请求路由到所有者节点，并通过第二高速通信路径将文件系统读写数据路由到存储设备，例如 直接直接块级I / O。 拥有节点通过将密钥写入与存储设备相关联的注册表的持久预留机制来维护存储设备的所有权。 非拥有节点写共享密钥。 拥有节点根据集群成员数据验证共享密钥，并抢占（例如删除）任何被认为无效的密钥。 还描述了用于控制访问的安全机制。

公开(公告)号：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.

摘要翻译： 通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。 副本成员维护集群操作数据。 当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。 仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。 仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。 仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

公开(公告)号：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.

摘要翻译： 描述了一种技术，通过该技术，服务器集群中的所有者节点通过持久预留机制来维护存储机制的所有权，同时允许非拥有节点对存储机制进行读写访问。 所有者节点将预留密钥写入与存储机制相关联的注册表。 非拥有节点写入一个共享密钥，为其提供读写访问权限。 所有者节点根据集群成员数据验证共享密钥，并抢占（例如，删除）任何被认为无效的密钥。 所有者节点还保护所有权不受其他节点所有权的挑战，从而如果（以前拥有）节点无法保护，例如由于失败，另一个节点可以占有所有权。

公开(公告)号：US20090043968A1

公开(公告)日：2009-02-12

申请号：US11834028

申请日：2007-08-06

申请人： Thothathri Vanamamalai ,  Karan Mehra ,  Paul Adrian Oltean ,  Rajsekhar Das ,  Norbert Kusters

发明人： Thothathri Vanamamalai ,  Karan Mehra ,  Paul Adrian Oltean ,  Rajsekhar Das ,  Norbert Kusters

IPC分类号： G06F12/06

CPC分类号： G06F11/2074 ,  G06F11/2041 ,  G06F11/2048 ,  G06F17/30088

摘要： Aspects of the subject matter described herein relate to sharing volume data via shadow copies. In aspects, an active computer creates a shadow copy of a volume. The shadow copy is exposed to one or more passive computers that may read but not write to the volume. A passive computer may obtain data from the shadow copy by determining whether the data has been written to a differential area and, if so, reading it from the differential area. If the data has not been written to the differential area, the passive computer may obtain it by first reading it from the volume, then re-determining whether it has been written to the differential area, and if so, reading the data from the differential area. Otherwise, the data read from the volume corresponds to the data needed for the shadow copy.

摘要翻译： 本文描述的主题的方面涉及通过卷影副本共享卷数据。 在方面，活动计算机创建卷的卷影副本。 影子副本暴露给可能读取但不写入卷的一个或多个被动计算机。 无源计算机可以通过确定数据是否被写入差分区域而从影子拷贝获得数据，如果是，则从差分区域读取数据。 如果数据尚未写入差分区域，则无源计算机可以通过首先从卷中读取数据，然后重新确定是否将其写入差分区域，如果是，则从差分读取数据 区。 否则，从卷读取的数据对应于卷影副本所需的数据。

公开(公告)号：US20070294363A1

公开(公告)日：2007-12-20

申请号：US11419118

申请日：2006-05-18

申请人： Kurt Lawrence Friedrich ,  David Allen Dion ,  Rajsekhar Das ,  Gregory I. Thiel

发明人： Kurt Lawrence Friedrich ,  David Allen Dion ,  Rajsekhar Das ,  Gregory I. Thiel

IPC分类号： G06F15/16

CPC分类号： G06F9/5061 ,  G06F2209/505 ,  H04L67/1002 ,  H04L67/1034 ,  H04L69/40

摘要： A cluster system including as few as two cluster nodes and a plurality of links, each one of the plurality of links coupling one of the cluster nodes to a voting device wherein a single surviving cluster node obtain a vote from the voting device. A method of establishing quorum in a cluster system including as few as two cluster nodes, the method comprising determining a single surviving cluster node of the as few as two cluster nodes, obtaining a vote from a voting device, and establishing quorum such that cluster operations are continued by the single surviving cluster node. A method for preventing a partition-in-time quorum establishment problem in a cluster system including as few as two cluster nodes, the method comprising determining that a revived cluster node is also a sole active cluster node of the cluster system, checking a last-surviving flag of the sole active cluster node, and if the last-surviving flag is set to FALSE, not restarting cluster operations.

摘要翻译： 包括少至两个群集节点和多个链路的群集系​​统，所述多个链路中的每一个将所述群集节点中的一个链接到投票设备，其中单个幸存群集节点从所述投票设备获得投票。 一种在包括少至两个集群节点的集群系统中建立仲裁的方法，所述方法包括：确定少至两个集群节点中的单个幸存集群节点，从投票设备获取投票权，并建立群集操作 由单个幸存的群集节点继续。 一种用于在包括少至两个集群节点的集群系统中防止时间段仲裁建立问题的方法，所述方法包括确定恢复的集群节点也是集群系统的唯一主动集群节点， 唯一活动群集节点的生存标志，如果最后一个生存标志设置为FALSE，则不重新启动集群操作。