公开(公告)号：US20120272092A1

公开(公告)日：2012-10-25

申请号：US13540527

申请日：2012-07-02

申请人： Michael T. Massa ,  Rudolf Opavsky ,  David A. Dion

发明人： Michael T. Massa ,  Rudolf Opavsky ,  David A. Dion

IPC分类号： G06F11/20 ,  G06F15/173

CPC分类号： H04L45/28 ,  G06F11/2005 ,  G06F11/2007 ,  H04L41/0654 ,  H04L43/10 ,  H04L45/22 ,  H04L69/16 ,  H04L69/161 ,  H04L69/165 ,  H04L69/32 ,  H04L69/40

摘要： A method for providing fault-tolerant network communications between a plurality of nodes for an application, including providing a plurality of initial communications pathways over a plurality of networks coupled between the plurality of nodes, receiving a data packet on a sending node from the application, the sending node being one of the plurality of nodes, the data packet being addressed by the application to an address on one of the plurality of nodes, and selecting a first selected pathway for the data packet from among the plurality of initial communications pathways where the first selected pathway is a preferred pathway.

摘要翻译： 一种用于在应用的多个节点之间提供容错网络通信的方法，包括在耦合在所述多个节点之间的多个网络上提供多个初始通信路径，从所述应用接收发送节点上的数据分组， 所述发送节点是所述多个节点之一，所述数据分组被所述应用程序寻址到所述多个节点之一上的地址，并且从所述多个初始通信路径中选择所述数据分组的第一选择路径，其中， 第一选择的途径是优选途径。

公开(公告)号：US07984155B2

公开(公告)日：2011-07-19

申请号：US12815373

申请日：2010-06-14

申请人： Michael T. Massa ,  David A. Dion ,  Raj Das ,  Rushabh Doshi ,  David B. Lomet ,  Gor V. Nishanov ,  Philip A. Bernstein ,  Rod N. Gamache ,  Rohit N. Jain ,  Sunita V. Nishanov

发明人： Michael T. Massa ,  David A. Dion ,  Raj Das ,  Rushabh Doshi ,  David B. Lomet ,  Gor V. Nishanov ,  Philip A. Bernstein ,  Rod N. Gamache ,  Rohit N. Jain ,  Sunita V. Nishanov

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.

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

公开(公告)号：US07821930B2

公开(公告)日：2010-10-26

申请号：US11275185

申请日：2005-12-16

申请人： Michael T. Massa ,  Rudolf Opavsky ,  David A. Dion

发明人： Michael T. Massa ,  Rudolf Opavsky ,  David A. Dion

IPC分类号： H04L12/56

CPC分类号： H04L45/28 ,  G06F11/2005 ,  G06F11/2007 ,  H04L41/0654 ,  H04L43/10 ,  H04L45/22 ,  H04L69/16 ,  H04L69/161 ,  H04L69/165 ,  H04L69/32 ,  H04L69/40

摘要： A method for providing fault-tolerant network communications between a plurality of nodes for an application, including providing a plurality of initial communications pathways over a plurality of networks coupled between the plurality of nodes, receiving a data packet on a sending node from the application, the sending node being one of the plurality of nodes, the data packet being addressed by the application to an address on one of the plurality of nodes, and selecting a first selected pathway for the data packet from among the plurality of initial communications pathways where the first selected pathway is a preferred pathway.

摘要翻译： 一种用于在应用的多个节点之间提供容错网络通信的方法，包括在耦合在所述多个节点之间的多个网络上提供多个初始通信路径，从所述应用接收发送节点上的数据分组， 所述发送节点是所述多个节点之一，所述数据分组被所述应用程序寻址到所述多个节点之一上的地址，并且从所述多个初始通信路径中选择所述数据分组的第一选择路径，其中， 第一选择的途径是优选途径。

公开(公告)号：US20100250750A1

公开(公告)日：2010-09-30

申请号：US12815373

申请日：2010-06-14

申请人： MICHAEL T. MASSA ,  DAVID A. DION ,  RAJSEKHAR DAS ,  RUSHABH A. DOSHI ,  DAVID B. LOMET ,  GOR V. 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 V. NISHANOV ,  PHILIP A. BERNSTEIN ,  ROD N. GAMACHE ,  ROHIT JAIN ,  SUNITA 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.

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