Split (1)

train · 617k rows

text stringlengths 2 132k	source dict
in humans: 46 (22 pairs of autosomes and two sex chromosomes) .deoxyribonucleic acid (DNA). The molecule contained within chromosomes which encodes the genes responsible for the structure and function of an organism and allows for transmission of genetic information from one generation to the next .dose rate. A measure...	{ "page_id": null, "source": 7334, "title": "from dpo" }
of the products of a chain reaction; or (b) Radiation exposure. • Points (a) and (b) approximately represent nuclear and radiological emergencies, respectively. However, this is not an exact distinction. • Radiation emergency is used in some cases when an explicit distinction in the nature of the hazard is immaterial (...	{ "page_id": null, "source": 7334, "title": "from dpo" }
radionuclides in the environment. The International Commission on Radiological Protection uses the term prolonged exposure to describe the same concept as chronic exposure. Both terms are contrasted with acute exposure. > false negative. A test result which indicates that an individual is unaffected when he or she is a...	{ "page_id": null, "source": 7334, "title": "from dpo" }
(very short wavelength) emitted by the nucleus or from the particle decays or annihilation events. Gamma rays penetrate tissue farther than do beta particles or alpha particles, but have a lower linear energy transfer. Heavy materials such as lead or concrete must be used for shielding from gamma radiation. G-banding. ...	{ "page_id": null, "source": 7334, "title": "from dpo" }
For a radionuclide, the time required for the activity to decrease, by a radioactive decay process, by half. • The term ‘physical half-life’ is also used for this concept. half-time. The time required for a parameter to fall 50% of its original value. For biological dosimetry application, this term is used to describe ...	{ "page_id": null, "source": 7334, "title": "from dpo" }
strong chemical bond. isotope. Atoms of one and the same chemical elements with the same number of protons (same atomic number but different nuclear number) and electrons but 220 different number of neutrons. Isotopes are the same chemical but have different nucleonic characteristics. karyotype. Systematic arrangement ...	{ "page_id": null, "source": 7334, "title": "from dpo" }
response to radiation, in which the effect Y is a linear-quadratic function of dose D: Y = αD + βD2. 221 lymphocyte. A type of white blood cell mainly found in the blood, lymph, and lymphatic tissues that forms the body's immunologically competent cells and their precursors. meta-analysis. Studies where the results of ...	{ "page_id": null, "source": 7334, "title": "from dpo" }
measure of the average speed of cell cycling which is taken from the relative number of cells in a population which has reached each successive stage of division, normally to fourth division. nucleoplasmic bridge (NPB). Occurs when the centromeres of dicentric chromosomes or chromatids are pulled to the opposite poles ...	{ "page_id": null, "source": 7334, "title": "from dpo" }
Qdr (above) but based instead on the distribution of prematurely condensed chromosome fragments. > relative biological effectiveness (RBE)*. A relative measure of the effectiveness of different radiation types at inducing a specified health effect, expressed as the inverse ratio of the absorbed doses of two different r...	{ "page_id": null, "source": 7334, "title": "from dpo" }
of the amount of variation in a sample of measurements from a population, giving an indication of how widely spread are the values in a data set. For data that approximate to a Normal distribution, the standard deviation of a curve parameter indicates how far it is likely to deviate from the true value, which can be id...	{ "page_id": null, "source": 7334, "title": "from dpo" }
whole chromosome or segment, the resulting hybrid segregating together at meiosis. > reciprocal translocation (2-way or complete translocation). The exchange of terminal portions of two separate chromosomes. > non-reciprocal translocation (1-way or incomplete translocation). Translocation of a single chromosome segment...	{ "page_id": null, "source": 7334, "title": "from dpo" }
Agency (IAEA) Carr, Z. World Health Organization (WHO) Di Giorgio, M. Autoridad Regulatoria Nuclear, Argentina Fenech, M. Commonwealth Scientific and Industrial Research Organisation (CSIRO), Australia Garcia Lima, O. Center for Hygiene and Radiation Protection, Cuba Kodama, Y. Radiation Effects Research Foundation, Ja...	{ "page_id": null, "source": 7334, "title": "from dpo" }
Defence and Research Development Canada, Canada > 229 # @ !" # $ %&'( ) *+!...	{ "page_id": null, "source": 7334, "title": "from dpo" }
?8=$ ? 5( 0 099 =$ ? & " * ; ; %4444456 701-%./>44&4/5 08 % G. 6 # ,.>: , * ?4/%&56 7012.../-/'.-.> 0 8$ * ; # ; &>>/&'2>&>%/56 ...	{ "page_id": null, "source": 7334, "title": "from dpo" }
=B 9$B ( #K B 9: 4>>>%- 0 8 B 8 B 8 B 8 B ( 0 099 B %- "%,# + " ; ? ">>/5DL E01&&/34'4-'-4/56 701&&/34'4-'/3- D...	{ "page_id": null, "source": 7334, "title": "from dpo" }
E R n At i o n A l At o m i C E n E R g y A g E n C y V i E n n A E P R - b i o D o S i m E t R y2 0 1 1	{ "page_id": null, "source": 7334, "title": "from dpo" }
Title: Gun Evidence Boxes 14 3/4 inch x 7 7/8 inch x 2 1/4 inch (Set of 25) URL Source: Markdown Content: Gun Evidence Boxes 14 3/4 inch x 7 7/8 inch x 2 1/4 inch (Set of 25) \| Evidence Boxes \| Forensic Supplies \| Sirchie =============== The store will not work correctly in the case when cookies are disabled. * [About...	{ "page_id": null, "source": 7336, "title": "from dpo" }
Photography]( * [Mugshot Photography]( * [All-Weather Writing Products]( * [Physiological Specimen/DNA Collection]( * [Sexual Assault Kits]( * [DNA Specimen Collection Kits]( * [Blood and Urine Collection Kits]( * [Applicator Swabs & Accessories]( * [Blood Collection Tubes & Accessories]( * [DNA-Free Specimen Collectio...	{ "page_id": null, "source": 7336, "title": "from dpo" }
Kits]( * [Arson Evidence Collection]( * [Evidence Packaging, Labeling & Sealing]( * [Evidence Collection Bags & Pouches]( * [Evidence Envelopes]( * [Evidence Boxes]( * [Evidence Collection Containers]( * [Evidence Integrity Tape & Strips]( * [Evidence Identification Labels]( * [Evidence Rule & Label Tape]( * [Evidence ...	{ "page_id": null, "source": 7336, "title": "from dpo" }
Equipment (PPE)]( * Gloves * Gun Evidence Boxes 14 3/4 inch x 7 7/8 inch x 2 1/4 inch (Set of 25) Gun Evidence Boxes 14 3/4 inch x 7 7/8 inch x 2 1/4 inch (Set of 25) ==================================================================== $49.57 SKU ECB001G Quantity Add to Cart Add to Wish List]( !Image 5: Gun Evi...	{ "page_id": null, "source": 7336, "title": "from dpo" }
custody and identification information. Holes located in the bottom panel of the box are used to fasten the weapon in place with SIRCHIE's No. ET100 releasable evidence ties. _Shipped flat in sets of 25 each._ Related Products 1. ![Image 10: image]( "Evidence Collection Box 10 3/8 inch x 6 3/8 inch x 4 1/2 inch...	{ "page_id": null, "source": 7336, "title": "from dpo" }
or1-800-356-7311 * [About Us]( * [Support]( * [GSA Schedule]( * [ISO 9001:2015 Certified]( * [Job/Career]( ### SHOPPING * [Shop by Category]( * [My Account]( * [View Cart]( * [My Wish Lists]( * [Order Status]( * [Privacy Policy]( * [Terms and Conditions]( [Contact Us]( Copyright © 2013-present Sirchie. All rights r...	{ "page_id": null, "source": 7336, "title": "from dpo" }
Title: Invalid URL URL Source: Warning: Target URL returned error 400: Bad Request Markdown Content: The requested URL " is invalid. Reference #9.da83817.1749136939.798f946	{ "page_id": null, "source": 7336, "title": "from dpo" }
Title: Distributed Consensus with Process Failures URL Source: Markdown Content: _The following notes are based on the book ``Distributed Algorithms'' by Nancy A. Lynch (Morgan Kaufmann)_ ***************************************************************************** ### Distributed Consensus with Process Failures Failu...	{ "page_id": null, "source": 7338, "title": "from dpo" }
* next broadcast (if necessary) at earliest round _r_ if _P i_ knows of a new value * at most two broadcasts per process * _2n 2_ messages, _O(n 2 b)_ comm. bits * alternative: if _V_ is totally ordered, _P i_ broadcasts smallest value seen so far * _O((f+1)n 2 b)_ communication bits ### Exponential Information Gatheri...	{ "page_id": null, "source": 7338, "title": "from dpo" }
value * time = _f+1_ rounds * number of messages = _2n 2_ * number of bits = _O(n 2 (b + (f+1) log n))_ ### Byzantine Agreement with Authentication Assumptions: 1. processes able to authenticate their communications using digital signatures 2. a single source generates all initial values and signs them 3. faulty proces...	{ "page_id": null, "source": 7338, "title": "from dpo" }
then _v_ is the only possible decision value for a nonfaulty process.	{ "page_id": null, "source": 7338, "title": "from dpo" }
Title: URL Source: Markdown Content: # Distributed Agreement with Optimal Communication Complexity # Seth Gilbert EPFL # seth.gilbert@epfl.ch # Dariusz R. Kowalski University of Liverpool # D.Kowalski@liverpool.ac.uk Abstract We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We p...	{ "page_id": null, "source": 7338, "title": "from dpo" }
in t+1 rounds, which is optimal for deterministic algorithms. Chor et al. develop a randomized algorithm that takes O(log n) rounds, with high probability, which is almost optimal (under an oblivious adversary); they also show a lower bound of Ω(log n/ log log n) rounds to achieve agreement, with high probability. Unf...	{ "page_id": null, "source": 7338, "title": "from dpo" }
in this paper). Main Result. In this paper, we present the first con-sensus protocol to achieve both optimal communication complexity and almost optimal time complexity, while tolerating up to f < n/ 2 crash failures. Specifically, we present a randomized consensus protocol that, with high probability, has both O(n) co...	{ "page_id": null, "source": 7338, "title": "from dpo" }
(Again, the trivial solution in which each co-ordinator sends the decision to every process requires Θ( n log n) messages.) In addition, some of the coor-dinators may fail during the protocol. We rely on a fault-tolerant work-sharing paradigm in which the co-ordinators repeatedly exchange information to prevent wasted ...	{ "page_id": null, "source": 7338, "title": "from dpo" }
n) rounds (and showed that among a certain class of algorithms, this was optimal). Using the universe reduction technique, along with the coordinator protocols described in this paper, we show how to achieve fault-tolerant gossip in a synchronous network in only O(log ∗ n) rounds, using only O(n) messages, with high pr...	{ "page_id": null, "source": 7338, "title": "from dpo" }
arises in all random rumor spreading protocols. 966 Copyright © by SIAM. Unauthorized reproduction of this article is prohibited. Message/Bit Complexity Round Complexity Randomized? FloodSet O(n3) bits O(n) No Optimized FloodSet O(n2) bits O(n) No GMY’95 O(n) messages O(n1+ ε) No GMY’95 O(n) bits 2O(n) No CK’02,CK’06...	{ "page_id": null, "source": 7338, "title": "from dpo" }
a round, then an arbitrary subset (possibly all) of its messages for that round are lost, as determined by the adversary. The message complexity of an execution is the total number of messages sent by all processes during the entire execution. The commu-nication complexity of an execution is the total number of bits fo...	{ "page_id": null, "source": 7338, "title": "from dpo" }
at random, and then participate in a simple discovery process to find the other coordinators. (This discovery process can be viewed as an example of probabilistic quorum systems .) The second step, described in Section 3.2, is for the coordinators to run a consensus protocol amongst themselves; we refer to this as a li...	{ "page_id": null, "source": 7338, "title": "from dpo" }
i. • Probabilistic Uniformity CC : With high probability, there exists a subset S such that: (i) every process pi ∈ S is a coordinator ( isC i = True ); (ii) every non-failed coordinator at the end of the ChooseC protocol is a member of S; (iii) for each non-failed coordinator pi ∈ S, coords i ⊆ S; (iv) for each non-fa...	{ "page_id": null, "source": 7338, "title": "from dpo" }
The response of an intermediary pj contains all the mes-sages received by pj in round 1. Each coordinator pi combines the responses it receives from interme-diaries, along with its own identifier, to form the list coords i. Analysis. We first bound the size of the set of coordinators, showing that with high probability...	{ "page_id": null, "source": 7338, "title": "from dpo" }
non-failed coordinator pi ∈ S, coords i ⊆ S;(iv) for each non-failed coordinator pi ∈ S, for each 968 Copyright © by SIAM. Unauthorized reproduction of this article is prohibited. process pj ∈ S\coords i, process pj fails by the end of the ChooseC protocol. Proof. Let S be the set of processes that set isC = True in Ro...	{ "page_id": null, "source": 7338, "title": "from dpo" }
we conclude that the ChooseC protocol satis-fies the requisite properties: Lemma 3.3. The ChooseC protocol guarantees self-inclusion CC , probabilistic uniformity CC , coordinator-set size CC , and termination CC .Proof. The self-inclusion property follows immediately from the protocol, as every coordinator pi adds its...	{ "page_id": null, "source": 7338, "title": "from dpo" }
isC indicator and the coordinator lists coords satisfy self-inclusion, probabilistic uniformity, and coordinator-set size, as per the ChooseC protocol. Each process with isC = True returns one output: a value vo. The sub-protocol guarantees the following properties at the end of the execution: • Probabilistic Agreement...	{ "page_id": null, "source": 7338, "title": "from dpo" }
is sufficient to ensure that the coordi-nators correctly execute consensus. Lemma 3.5. The LUConsensus protocol satis-fies probabilistic agreement LU C , validity LU C , and termination LU C , assuming the inputs isC and coords satisfy self-inclusion CC , probabilistic uniformity CC ,and coordinator-set size CC .Proof....	{ "page_id": null, "source": 7338, "title": "from dpo" }
coordinators, pj adopts estimate ei. From this we conclude that at the end of round r, every non-failed coordinator has adopted estimate ei. This immediately implies the agreement property, as desired. The communication complexity can be calculated by summing the various message costs: Lemma 3.6. With high probabilit...	{ "page_id": null, "source": 7338, "title": "from dpo" }
= True and vj = v. • Consistency D : If, for some pair of processes pi, p j ,the flag ds i = True and ds j = True , then initial values vi = vj . • Termination D : The protocol terminates in O(log ∗ n) rounds. With high probability, every cor-rect coordinator pi returns ds i = True . Sub-protocol description. Partition...	{ "page_id": null, "source": 7338, "title": "from dpo" }
, v ′〉, it proceeds as follows: if g′ ∈ Lj and v′ = vj , then coordinator pj removes g′ from Lj and adds n′ > g to cj .These three rounds are repeated Θ(log ∗ n) times. At this point, if, for some coordinator pi, the list Li is not empty, then pi proceedings as follows: • Coordinator pi sends the value vi directly to e...	{ "page_id": null, "source": 7338, "title": "from dpo" }
reasons a group may be removed from Li. First, it might be the case that pi directly sends value vi to every process in g.Second, it might be the case that pi receives a message from some other process pj indicating that pj has sent message vj = vi to every process in g. In both cases, the removal of g clearly implies ...	{ "page_id": null, "source": 7338, "title": "from dpo" }
received no value other than vi prior to receiving value vi.Now, we conclude the proof. Fix two processes pi and pj such that ds i = ds j = True when the protocol completes. This implies that ci > n/ 2 and cj > n/ 2. Thus there is some process p` that is included in both counts, i.e., that received a message containing...	{ "page_id": null, "source": 7338, "title": "from dpo" }
initial value by some coordinator, without resorting to the final round in which coordinators send their value directly to every-one. In this case, the total communication incurred is Θ(log ∗ n) triples of rounds in which Θ(log n) processes send (and receive as responses) Θ( n/ (log n log ∗ n) bits each, along with a s...	{ "page_id": null, "source": 7338, "title": "from dpo" }
log n coordinators (ignoring the notifications by addi-tional coordinators). Observe that in each such triple of rounds, each of the log n coordinators in S notifies a new group with probability at least log n > 2 log n = 12 , independent of the choices made by the other coordinators. For log n coordinators, over c log...	{ "page_id": null, "source": 7338, "title": "from dpo" }
Thus after some O(c log ∗ n)rounds, every group has been notified with probability polynomially small in n. Putting together Lemma 3.10 and Corollary 3.1, we conclude the following: Lemma 3.12. The communication complexity of Disseminate is O(n), with high probability, assuming the inputs isC and coords satisfy self-...	{ "page_id": null, "source": 7338, "title": "from dpo" }
pi is non-failed, we know that pi ∈ coords j , and hence receives the update from pj that g was notified. Since all coordinators agree on the same value, we know that vj = vi, and hence pi removes g from Li. By the end of the protocol, every coordinator has an empty group list, and hence no coordinator sends its value ...	{ "page_id": null, "source": 7338, "title": "from dpo" }
, then set isC i = False .4. Disseminate (ei, isC i, coords i)i → 〈 Vi, ds i〉• If isC i = True and ds i = False , then set isC i = False . • If isC i = False and Vi is not empty, then set ei to the unique value in V . (We will show that there is always at most one value in the set V .) 5. Disseminate (ei, isC i, coords...	{ "page_id": null, "source": 7338, "title": "from dpo" }
property of LUConsensus , the termination D property of the Disseminate protocol, and the termination property of the fallback consensus protocol. We now consider the agreement property. We first argue that at the end of Step 3, every non-failed coordinator has the same value. Assume that, at the end of Step 3, there e...	{ "page_id": null, "source": 7338, "title": "from dpo" }
only value received in Step 4, and hence every non-failed process pi adopts v, setting ei = v.This leads us to two conclusions. First, in Step 5, since every non-failed process pi has ei = v, no process can decide w in Step 5. Second, every non-failed process pi still has ei = v at the beginning of Step 7, and hence by...	{ "page_id": null, "source": 7338, "title": "from dpo" }
timely fashion, real protocols must cope with occasional asynchrony , i.e., unpredictable message delays. Thus it is considered good computing practice to plan for the worst and hope for the best. In the context of distributed computing, this translates into devising algorithms that, on the one hand tolerate asynchrony...	{ "page_id": null, "source": 7338, "title": "from dpo" }
execution is asynchronous . 4.2 Protocol Modifications. We now describe how to modify the communication-optimal consensus proto-col presented in Section 3 in order to operate safely in a partially synchronous system, while remaining efficient in synchronous executions. First, each process simulates synchronous rounds b...	{ "page_id": null, "source": 7338, "title": "from dpo" }
fallback Step 6. (Of particular note, pj sends no further responses as part of the Disseminate protocol.) Third, a process pi does not begin the fallback con-sensus protocol in Step 7 until it has received fallback request messages from at least a majority of the pro-cesses. When process pi receives a fallback request ...	{ "page_id": null, "source": 7338, "title": "from dpo" }
correct pro-cess to decide. Agreement follows from the observation that the safety of the Disseminate protocol does not depend on synchrony. As before, the dissemination D property follows from the fact that a non-failed coordinator pi always sends its initial value vi directly to every pro-cess that has not already be...	{ "page_id": null, "source": 7338, "title": "from dpo" }
© by SIAM. Unauthorized reproduction of this article is prohibited. Section 3 yield a synchronous (or partially synchronous) protocol that can solve this problem of gossip. The key observation is that the Disseminate routine can be used just as well to collect data as to distribute it. Specifically, we modify the Disse...	{ "page_id": null, "source": 7338, "title": "from dpo" }
i, coords i) → 〈 Vi, ds i〉 5. If process pi has not received the flag Done , then it sends a fallback request to every other process. Every process, on receiving such a request, sends its rumor in response. The resulting protocol ensures that every rumor origi-nating at a correct process is distributed to every non-fai...	{ "page_id": null, "source": 7338, "title": "from dpo" }
optimal communication complex-ity and almost optimal time complexity. We have also shown how to modify the algorithm so that it can tol-erate asynchronous executions, while maintaining good performance if the network is synchronous. The tech-niques we have used are quite general, and can be used to solve a variety of o...	{ "page_id": null, "source": 7338, "title": "from dpo" }
Aspnes. Randomized protocols for asynchronous consensus. Distributed Computing , 16(2-3):165–175, 2003. H. Attiya and K. Censor. Lower bounds for random-ized consensus under a weak adversary. In Proceedings of the Twenty-Seventh Symposium on Principles of Distributed Computing (PODC) , pages 315–324. ACM, 2008. H. At...	{ "page_id": null, "source": 7338, "title": "from dpo" }
in the presence of partial synchrony. Journal of the ACM ,35(2):288–323, 1988. Z. Galil, A. Mayer, and M. Yung. Resolving message complexity of byzantine agreement and beyond. In Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS) , pages 724–733, 1995. C. Georgiou, S. Gilbert, R. Guerraoui, a...	{ "page_id": null, "source": 7338, "title": "from dpo" }
SIAM. Unauthorized reproduction of this article is prohibited.	{ "page_id": null, "source": 7338, "title": "from dpo" }
Title: Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures URL Source: Markdown Content: Skip to main content Skip to article Journals & Books View PDF Download full issue Outline Abstract Keywords 1. Introduction 2. The asynchronous system S 3. The omega failure d...	{ "page_id": null, "source": 7342, "title": "from dpo" }
Byzantine failures. Previous article Next article Keywords Distributed algorithmsConsensusUnknown membershipOmega failure detectorByzantine failures 1. Introduction Consensus is a fundamental agreement problem present, as a building block, at the core of most reliable systems. Consensus states that, from the set of va...	{ "page_id": null, "source": 7342, "title": "from dpo" }
these 8 original classes). In a follow-up work, Chandra, Hadzilacos and Toueg proposed Ω as a new class of failure detectors. The Ω failure detector class guarantees that, eventually, the failure detectors of all correct processes permanently return the same correct process. It is shown in that Ω is the weakest failu...	{ "page_id": null, "source": 7342, "title": "from dpo" }
since they do not crash, they can permanently send messages that eventually and periodically will be received by the other. Conversely, a process which crashes before sending any message will be unknown to every other process in the system. Another failure model very well studied in the literature is the Byzantine fail...	{ "page_id": null, "source": 7342, "title": "from dpo" }
process p eventually suspects all processes that are mute to p with respect to 𝐴 . A process p is mute with respect to 𝐴 if p eventually stops sending 𝐴 's messages to at least one process in the system. Consensus is solved in introducing another muteness failure detector class called ◇ ◇ 𝑃 mute with muteness stro...	{ "page_id": null, "source": 7342, "title": "from dpo" }
in a pure asynchronous system augmented with this failure detector FD , , , , . Note that all previously presented failure detector classes ( ◇ ◇ 𝑃 mute , ◇ ◇ 𝑀 𝐴 , ◇ ◇ 𝑆 ( bz ) and ◇ ◇ 𝑊 ( Byz ) ) cannot be implemented when the membership is unknown because every correct process needs to know every mute (quiet or...	{ "page_id": null, "source": 7342, "title": "from dpo" }
sensor networks, etc.). This implies that every process in our system with unknown membership has to dynamically learn about the existence of other processes. Roughly speaking, a process can infer the identity of other processes from the messages it receives during the run. An important handicap to be overcome by syste...	{ "page_id": null, "source": 7342, "title": "from dpo" }
algorithms because we can focus on the properties to be fulfilled in a certain abstraction based only on the properties supplied by the other , , . So, in our model (as in ) we can interchange different algorithms of the Ω failure detector class with different algorithms of consensus that use Ω without worrying about h...	{ "page_id": null, "source": 7342, "title": "from dpo" }
Finally, a process can be alive and neither send nor receive messages. In this case we call it an autistic process. Note that mute and autistic processes are difficult to detect by an outside unit. If they never send a message, they are undetectable in a system with unknown membership. Besides, in an asynchronous syste...	{ "page_id": null, "source": 7342, "title": "from dpo" }
RFLOB primitive is to simplify the design and understanding of our consensus algorithm. Note that, in the literature, there are several implementations of broadcast primitives with different properties of reliability in systems with Byzantine processes , , , , , , but, to our knowledge, there is no implementation of a...	{ "page_id": null, "source": 7342, "title": "from dpo" }
minimum connectivity requirements necessary to implement any failure detector of Class Ω. Thus, we show that Consensus is implementable using Ω and RFLOB in a system with degenerative Byzantine failures even with unknown membership. 1.2. Structure of the rest of the paper This paper is organized as follows. Our model, ...	{ "page_id": null, "source": 7342, "title": "from dpo" }
𝑖 only knows its own identity (i.e., i) and the size n, but it does not know the identities of the other processes in the system. The only way a process has to infer the identities of other processes is from the messages it receives. Processes communicate by sending and receiving messages through links. Thus, every pr...	{ "page_id": null, "source": 7342, "title": "from dpo" }
3 processes can be faulty. We consider the following three types of failures. • Crash A process 𝑝 𝑖 ∈ Π is denoted crashed if 𝑝 𝑖 always executes every operation specified by its algorithm until 𝑝 𝑖 eventually fails by crashing permanently (i.e., 𝑝 𝑖 stops taking steps forever). The set of crashed processes is...	{ "page_id": null, "source": 7342, "title": "from dpo" }
so Crashed ⊆ Autistic . Note also that a crashed process is also a mortal Byzantine. However, since not all autistic processes crash, Autistic ⊈ MortalByz , so Deaf ⊈ MortalByz and Mute ⊈ MortalByz . Thus, Faulty = MortalByz ∪ Deaf ∪ Mute . Hence, our failure model is broader than that of . Note that in our system S we...	{ "page_id": null, "source": 7342, "title": "from dpo" }
assume that each process 𝑝 𝑖 can identify the sender process 𝑝 𝑘 of every message m (this can be done, for example, using digital signatures included in the header of m). Hence, if a correct process 𝑝 𝑖 receives a message whose sender address does not correspond to the signature, it will consider that message inv...	{ "page_id": null, "source": 7342, "title": "from dpo" }
their specification except by crashing. Therefore, since our degenerative Byzantine system S also includes the benign crash failures of , this impossibility result holds for S. To circumvent this impossibility, failure detectors were introduced . A failure detector is a distributed device that returns information relat...	{ "page_id": null, "source": 7342, "title": "from dpo" }
𝑖 , belongs to Class Ω if it satisfies the following property: let leader 𝑖 ( ) 𝜏 be the value returned to process 𝑝 𝑖 by function leader 𝑖 ( ) at time τ, then there is a time 𝜏 ′ and some process 𝑝 𝑙 ∈ Correct such that for all 𝜏 ≥ 𝜏 ′ and for all 𝑝 𝑖 ∈ Correct , 𝐷 . 𝑙 𝑒 𝑎 𝑑 𝑒 𝑟 𝑖 ( ) 𝜏 = 𝑝 𝑙 ....	{ "page_id": null, "source": 7342, "title": "from dpo" }
a correct process 𝑝 𝑘 , then RFLOB _ broadcast 𝑘 ( 𝑚 ) must have been executed previously by 𝑝 𝑘 . • Termination: If a correct process 𝑝 𝑖 executes RFLOB _ broadcast 𝑖 ( 𝑚 ) , then each correct process 𝑝 𝑘 will execute RFLOB _ delivered 𝑘 ( 𝑚 ) . • Agreement: If a correct process 𝑝 𝑖 executes RFLOB _ de...	{ "page_id": null, "source": 7342, "title": "from dpo" }
it was sent by a correct process (Termination), but the RFLOB primitive does not guarantee that a message sent by a faulty process is delivered. The RFLOB primitive in a system with Byzantine failures has been previously defined in the literature , but, to our knowledge, it has not been previously implemented in a sys...	{ "page_id": null, "source": 7342, "title": "from dpo" }
(which stores the vector clock of process 𝑝 𝑖 ). Since the membership is not known a priori, each time a new process is known, it is included in members 𝑖 and its expected sequence number is added to the vector clock next 𝑖 and set to 1. Note that next 𝑖 is a hash vector indexed by process identifiers. Since membe...	{ "page_id": null, "source": 7342, "title": "from dpo" }
, − , 𝑘 ) message from process 𝑝 𝑘 for the first time, it executes broadcast 𝑖 ( ACK , 𝑚 , 𝑠 𝑘 , next 𝑘 , 𝑘 ) , where m and next 𝑘 are the message and vector clock, respectively, received from process 𝑝 𝑘 (Lines 14–16). When process 𝑝 𝑖 has received a ( ACK , 𝑚 , 𝑠 𝑘 , next 𝑘 , 𝑘 ) message from 𝑛 − ...	{ "page_id": null, "source": 7342, "title": "from dpo" }
of algorithm 𝐴 RFLOB Lemma 1 Algorithm 𝐴 RFLOB satisfies the Validity property of the RFLOB primitive when 𝑓 < 𝑛 / 3 . Proof Note first that RFLOB _ delivered 𝑖 ( 𝑚 ) is only executed at Line 22, and it is executed only once for each process 𝑝 𝑘 and sequence number next 𝑖 [ 𝑘 ] , since next 𝑖 [ 𝑘 ] is incre...	{ "page_id": null, "source": 7342, "title": "from dpo" }
) message must have been previously received by more than 𝑛 / 3 correct processes. Correct processes may only send this message at Line 8 as a consequence of executing RFLOB _ broadcast 𝑘 ( 𝑚 ) . Hence, If RFLOB _ delivered 𝑖 ( 𝑚 ) was due to a correct process 𝑝 𝑘 , then RFLOB _ broadcast 𝑘 ( 𝑚 ) must have bee...	{ "page_id": null, "source": 7342, "title": "from dpo" }
𝑝 𝑖 receives a message from process 𝑝 𝑘 for the first time, it sets its expected sequence number next 𝑖 [ 𝑘 ] to 1 (see Lines 9–13). Then, each time it delivers a message from 𝑝 𝑘 (at Line 22), it increments its expected sequence number (Line 23). Thus, messages from a process 𝑝 𝑘 are delivered in increasing ...	{ "page_id": null, "source": 7342, "title": "from dpo" }
) before RFLOB _ broadcast 𝑖 ( 𝑚 ′ ) . Lemma 5 Algorithm 𝐴 RFLOB satisfies the Local Order property of the RFLOB primitive when 𝑓 𝑠 𝑘 when 𝑝 𝑖 executed broadcast 𝑖 ( MSG , 𝑚 ′ , seq 𝑖 , next 𝑖 , 𝑖 ) and either next 𝑘 did not contain an entry for 𝑝 𝑖 , or next 𝑘 [ 𝑖 ] ≤ next 𝑖 [ 𝑖 ] . Consider now t...	{ "page_id": null, "source": 7342, "title": "from dpo" }
21). However, since process 𝑝 𝑗 has not executed RFLOB _ delivered 𝑗 ( 𝑚 ) yet, next 𝑗 [ 𝑘 ] must be less or equal than 𝑠 𝑘 . Hence, next 𝑗 [ 𝑘 ] < next 𝑖 [ 𝑘 ] and we reach a contradiction, so 𝑝 𝑗 must execute RFLOB _ delivered 𝑗 ( 𝑚 ) before executing RFLOB _ delivered 𝑗 ( 𝑚 ′ ) . Theorem 1 Algorith...	{ "page_id": null, "source": 7342, "title": "from dpo" }
process must preserve the following three properties: • Validity The value v must be decided by each correct process when all correct processes propose the same value v. • Termination Every correct process eventually decides a value. • Agreement All correct processes decide the same value. The value proposed by a corre...	{ "page_id": null, "source": 7342, "title": "from dpo" }
three local variables: 𝑟 𝑖 to store the current round of Task T1, est 𝑖 to store the value to be proposed by process 𝑝 𝑖 at round 𝑟 𝑖 and decided 𝑖 to know if this process 𝑝 𝑖 has already diffused its wish to take a decision. Function 𝐷 . leader 𝑖 ( ) is used by process 𝑝 𝑖 to invoke the failure detector ...	{ "page_id": null, "source": 7342, "title": "from dpo" }
Note also that, eventually, a correct process will be chosen as the leader and all messages RFLOB_broadcast by correct processes are eventually RFLOB_delivered by every correct process, so a correct process will eventually stop waiting at Line 11. During the COMMIT phase, processes RFLOB_broadcast the estimations they ...	{ "page_id": null, "source": 7342, "title": "from dpo" }
valid to solve Consensus. Remark 1 At each round r, all correct processes receive the same sets of ( PROP , 𝑟 , − , − ) and ( COMMIT , 𝑟 , − ) messages, although each of them might consider a different subset at Lines 7 and 13 respectively. Proof At each round r, each correct process sends one ( PROP , 𝑟 , − , − ) /...	{ "page_id": null, "source": 7342, "title": "from dpo" }
round and phase, but only 𝑛 − 𝑓 messages are considered by the correct processes at Lines 7 and 13 respectively. Corollary 1 Among any two correct processes, the sets of messages they consider at Lines 7 and 13 have at least 𝑛 − 2 𝑓 common messages. Proof From Remark 1, all correct processes receive the same set of...	{ "page_id": null, "source": 7342, "title": "from dpo" }
that estimation in Line 6. Since there are at most f estimations which differ from est (those of the faulty processes), all of them will choose est as their best value (at Line 8) and diffuse it at Line 10. From Remark 2, BEST messages from Byzantine processes may be validated by every correct process, and may be disca...	{ "page_id": null, "source": 7342, "title": "from dpo" }
2, the sets of messages considered by processes 𝑝 𝑖 and 𝑝 𝑗 at Line 13 may only differ in up to 2f messages. However, since 𝑛 − 𝑓 > 2 𝑓 , this contradicts the initial hypothesis, and, hence, we reach a contradiction. Remark 5 If, at round r, a process 𝑝 𝑖 executes RFLOB _ broadcast 𝑖 ( DEC , 𝑣 ) at Line 19, ...	{ "page_id": null, "source": 7342, "title": "from dpo" }
same value v. Proof If all correct processes propose the same value v, then, from Remark 3, they will not change it. If all the faulty processes store other values (either the same or different) than v, then it is possible that the condition of Line 16 would not hold until all the faulty processes either crash or becom...	{ "page_id": null, "source": 7342, "title": "from dpo" }
it is impossible that two correct processes decide different values. Lemma 8 Termination: Every correct process eventually has to decide a value. Proof Note first that every wait sentence in the algorithm of Fig. 2 ends in a finite time since there are 𝑛 − 𝑓 correct processes and, from the definition of Ω, 𝐷 . leade...	{ "page_id": null, "source": 7342, "title": "from dpo" }
weak conditions to implement Ω. No failure detector can be implemented in asynchronous systems under the (benign or not) crash failure model . Thus, we need to include synchronization assumptions in the system S in order to make the implementation of a failure detector (of Class Ω) possible. We first consider a traditi...	{ "page_id": null, "source": 7342, "title": "from dpo" }
𝑖 in 𝑆 𝑠 to execute a step is bounded and known by every process, and the time needed to receive a sent message is bounded and also known. We also assume that the clocks of all processes are synchronized. We assume that, in system 𝑆 𝑠 , there may be any number of faulty processes (i.e., 𝑓 ≤ 𝑛 ), and there are no...	{ "page_id": null, "source": 7342, "title": "from dpo" }

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.