FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4312511221> ?p ?o ?g. }

• W4312511221 abstract "We present two distributed algorithms for the Byzantine counting problem, which is concerned with estimating the size of a network in the presence of a large number of Byzantine nodes.In an n-node network (n is unknown), our first algorithm, which is deterministic, finishes in O(log n) rounds and is time-optimal. This algorithm can tolerate up to O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1−γ</sup> ) arbitrarily (adversarially) placed Byzantine nodes for any arbitrarily small (but fixed) positive constant γ. It outputs a (fixed) constant factor estimate of log n that would be known to all but o(1) fraction of the good nodes. This algorithm works for any bounded degree expander network. However, this algorithms assumes that good nodes can send arbitrarily large-sized messages in a round.Our second algorithm is randomized and most good nodes send only small-sized messages. <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sup> This algorithm works in almost all d-regular graphs. It tolerates up to $B(n) = {n^{frac{1}{2} - xi }}$ (note that n and B(n) are unknown to the algorithm) arbitrarily (adversarially) placed Byzantine nodes, where ξ is any arbitrarily small (but fixed) positive constant. This algorithm takes O(B(n) log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n) rounds and outputs a constant factor estimate of log n with probability at least 1−o(1). The said estimate is known to most nodes, i.e., ≥ (1 − β)n nodes for any arbitrarily small (but fixed) positive constant β.To complement our algorithms, we also present an impossibility result that shows that it is impossible to estimate the network size with any reasonable approximation with any non-trivial probability of success if the network does not have sufficient vertex expansion.Both algorithms are the first such algorithms that solve Byzantine counting in sparse, bounded degree networks under very general assumptions. Both algorithms are fully local and need no global knowledge.Our algorithms can be used for the design of efficient distributed algorithms resilient against Byzantine failures, where the knowledge of the network size — a global parameter — may not be known a priori." @default.
• W4312511221 created "2023-01-05" @default.
• W4312511221 creator A5017753897 @default.
• W4312511221 creator A5070507440 @default.
• W4312511221 creator A5089574654 @default.
• W4312511221 date "2022-07-01" @default.
• W4312511221 modified "2023-09-27" @default.
• W4312511221 title "Byzantine-Resilient Counting in Networks" @default.
• W4312511221 cites W1971817342 @default.
• W4312511221 cites W2003406796 @default.
• W4312511221 cites W2004422728 @default.
• W4312511221 cites W2042437235 @default.
• W4312511221 cites W2084832642 @default.
• W4312511221 cites W2087392909 @default.
• W4312511221 cites W2112090702 @default.
• W4312511221 cites W2119741407 @default.
• W4312511221 cites W2126665244 @default.
• W4312511221 cites W2170367243 @default.
• W4312511221 cites W2250039092 @default.
• W4312511221 cites W2344889835 @default.
• W4312511221 cites W2962700705 @default.
• W4312511221 cites W2971939654 @default.
• W4312511221 cites W4205300528 @default.
• W4312511221 cites W4312511221 @default.
• W4312511221 doi "https://doi.org/10.1109/icdcs54860.2022.00011" @default.
• W4312511221 hasPublicationYear "2022" @default.
• W4312511221 type Work @default.
• W4312511221 citedByCount "1" @default.
• W4312511221 countsByYear W43125112212022 @default.
• W4312511221 crossrefType "proceedings-article" @default.
• W4312511221 hasAuthorship W4312511221A5017753897 @default.
• W4312511221 hasAuthorship W4312511221A5070507440 @default.
• W4312511221 hasAuthorship W4312511221A5089574654 @default.
• W4312511221 hasBestOaLocation W43125112212 @default.
• W4312511221 hasConcept C11413529 @default.
• W4312511221 hasConcept C114614502 @default.
• W4312511221 hasConcept C118615104 @default.
• W4312511221 hasConcept C121332964 @default.
• W4312511221 hasConcept C134306372 @default.
• W4312511221 hasConcept C149629883 @default.
• W4312511221 hasConcept C178790620 @default.
• W4312511221 hasConcept C185592680 @default.
• W4312511221 hasConcept C199360897 @default.
• W4312511221 hasConcept C2777027219 @default.
• W4312511221 hasConcept C33923547 @default.
• W4312511221 hasConcept C34388435 @default.
• W4312511221 hasConcept C41008148 @default.
• W4312511221 hasConcept C62520636 @default.
• W4312511221 hasConcept C62611344 @default.
• W4312511221 hasConcept C63553672 @default.
• W4312511221 hasConceptScore W4312511221C11413529 @default.
• W4312511221 hasConceptScore W4312511221C114614502 @default.
• W4312511221 hasConceptScore W4312511221C118615104 @default.
• W4312511221 hasConceptScore W4312511221C121332964 @default.
• W4312511221 hasConceptScore W4312511221C134306372 @default.
• W4312511221 hasConceptScore W4312511221C149629883 @default.
• W4312511221 hasConceptScore W4312511221C178790620 @default.
• W4312511221 hasConceptScore W4312511221C185592680 @default.
• W4312511221 hasConceptScore W4312511221C199360897 @default.
• W4312511221 hasConceptScore W4312511221C2777027219 @default.
• W4312511221 hasConceptScore W4312511221C33923547 @default.
• W4312511221 hasConceptScore W4312511221C34388435 @default.
• W4312511221 hasConceptScore W4312511221C41008148 @default.
• W4312511221 hasConceptScore W4312511221C62520636 @default.
• W4312511221 hasConceptScore W4312511221C62611344 @default.
• W4312511221 hasConceptScore W4312511221C63553672 @default.
• W4312511221 hasLocation W43125112211 @default.
• W4312511221 hasLocation W43125112212 @default.
• W4312511221 hasOpenAccess W4312511221 @default.
• W4312511221 hasPrimaryLocation W43125112211 @default.
• W4312511221 hasRelatedWork W1481464119 @default.
• W4312511221 hasRelatedWork W1584490178 @default.
• W4312511221 hasRelatedWork W1614005058 @default.
• W4312511221 hasRelatedWork W1871156538 @default.
• W4312511221 hasRelatedWork W2131306093 @default.
• W4312511221 hasRelatedWork W2974132161 @default.
• W4312511221 hasRelatedWork W2980075598 @default.
• W4312511221 hasRelatedWork W3099735866 @default.
• W4312511221 hasRelatedWork W4291707409 @default.
• W4312511221 hasRelatedWork W985811474 @default.
• W4312511221 isParatext "false" @default.
• W4312511221 isRetracted "false" @default.
• W4312511221 workType "article" @default.