-
公开(公告)号：US20210334177A1
公开(公告)日：2021-10-28
申请号：US17107630
申请日：2020-11-30
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Dahlia MALKHI , Kartik NAYAK , Ling REN
Abstract: A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view.
-
公开(公告)号：US20220276938A1
公开(公告)日：2022-09-01
申请号：US17746066
申请日：2022-05-17
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Dahlia MALKHI , Kartik NAYAK , Ling REN
Abstract: A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view.
-
公开(公告)号：US20210026843A1
公开(公告)日：2021-01-28
申请号：US16520898
申请日：2019-07-24
Applicant: VMware, Inc.
Inventor： Dahlia MALKHI , Kartik Ravidas NAYAK , Ling REN
Abstract: A replicated service comprises N replicas deployed on compute nodes of a computer network, wherein the replicas are each configured to vote on a proposed transaction output by a leader of the replicas and certify the proposed transaction upon receiving qr*N first votes, where qr is a fractional value between 0 and 1 that represents a quorum required for certification. A method of approving a transaction in the replicated service includes receiving certifications from the replicas, and transmitting an approval of the transaction to the replicas for recording: (i) upon determining that at least qc*N certifications have been received, where qc is a fractional value between 0 and 1 that represents a quorum required for transaction approval and qc>qr, or (ii) upon determining that at least qr*N certifications have been received at the end of the time period equal to 2*Δ, where Δ represents a network delay.
-
Patent Agency Ranking
公开(公告)号：US20220237180A1
公开(公告)日：2022-07-28
申请号：US17720092
申请日：2022-04-13
Applicant: VMware, Inc.
Inventor： Dahlia MALKHI , Kartik Ravidas NAYAK , Ling REN
Abstract: A replicated service comprises N replicas deployed on compute nodes of a computer network, wherein upon receiving qr*N first votes from other replicas on a proposed transaction by a leader of the N replicas, each of the N replicas certifies the proposed transaction to a client of the replicated service, where qr is a fractional value between 0 and 1 that represents a quorum required for certification. A method of approving a transaction in the replicated service includes receiving the certifications from the N replicas, determining whether or not the certifications are received from at least qc*N replicas, where qc is a fractional value between 0 and 1 that represents a quorum required for transaction approval and qc>qr, and transmitting an approval of the transaction to the replicas for recording by the replicas upon determining that the certifications have been received from at least qc*N replicas.
-
公开(公告)号：US20210279255A1
公开(公告)日：2021-09-09
申请号：US17136376
申请日：2020-12-29
Applicant: VMware, Inc.
Inventor： Kartik Ravidas NAYAK , Ling REN , Dahlia MALKHI , Ittai ABRAHAM
Abstract: A distributed service includes replicas that communicate with each other over a network to commit a block of client requests to a log of blocks of client requests. Each replica receives from one of the replicas, designated as the leader, a proposal for committing a new block to the log, and sends a vote on the proposed block to all of the other replicas via the network. Each replica then starts a timer set to twice the maximum network delay time to transmit messages over the network. If there is no equivocation when the timer lapses or stalling condition in proposing new blocks, then each replica commits the proposed block to the log. If there is equivocation or stalling condition, then a new leader is selected, and the process re-attempts to commit the proposed block.
-
公开(公告)号：US20240012724A1
公开(公告)日：2024-01-11
申请号：US18472134
申请日：2023-09-21
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Dahlia MALKHI , Kartik NAYAK , Ling REN
CPC classification number: G06F11/187 , G06F11/2041 , G06F11/1425 , G06F11/182
Abstract: A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view.
-
公开(公告)号：US20210027288A1
公开(公告)日：2021-01-28
申请号：US16520867
申请日：2019-07-24
Applicant: VMware, Inc.
Inventor： Dahlia MALKHI , Kartik Ravidas NAYAK , Ling REN
Abstract: A replicated service comprises N replicas deployed on compute nodes of a computer network, wherein upon receiving qr*N first votes from other replicas on a proposed transaction by a leader of the N replicas, each of the N replicas certifies the proposed transaction to a client of the replicated service, where qr is a fractional value between 0 and 1 that represents a quorum required for certification. A method of approving a transaction in the replicated service includes receiving the certifications from the N replicas, determining whether or not the certifications are received from at least qc*N replicas, where qc is a fractional value between 0 and 1 that represents a quorum required for transaction approval and qc>qr, and transmitting an approval of the transaction to the replicas for recording by the replicas upon determining that the certifications have been received from at least qc*N replicas.
-
公开(公告)号：US20210026842A1
公开(公告)日：2021-01-28
申请号：US16520882
申请日：2019-07-24
Applicant: VMware, Inc.
Inventor： Dahlia MALKHI , Kartik Ravidas NAYAK , Ling REN
Abstract: A replicated service comprises N replicas deployed on compute nodes of a computer network, wherein the N replicas are each configured to vote on a proposed transaction output by a leader of the N replicas and certify the proposed transaction upon receiving qr*N first votes, where qr is a fractional value between 0 and 1 that represents a quorum required for certification. A method of approving a transaction in the replicated service includes receiving certifications from the N replicas, determining whether or not the certifications are received from at least qr*N replicas during a time period equal to 2*Δ, where Δ represents a network delay between two compute nodes of the computer network, and transmitting an approval of the transaction to the replicas for recording by the replicas upon determining that at least qr*N certifications have been received at the end of the time period equal to 2*Δ.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.015 seconds)
