Matches in SemOpenAlex for { <https://semopenalex.org/work/W2340770048> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2340770048 abstract "In the first part of the dissertation, we consider the agreement problem on asynchronous networks when the processors are reliable, but some of the channels are subject to failure. Fischer, Lynch, and Paterson have already shown that no algorithm can solve the agreement problem on asynchronous networks if any process fails during the execution of the algorithm. Therefore, we consider only channel failures. The type of channel failure we consider in this dissertation is Byzantine failure, that is, channels fail by altering messages, sending false information, forging messages, losing messages at will, and so on. There are no restrictions on the behavior of a faulty channel. Therefore, a faulty channel may act as an adversary who forges messages on purpose to prevent the successful completion of the algorithm. Because we assume an asynchronous network, the channel delays are arbitrary. Thus, the faulty channels may not be detectable unless the faulty channels cause garbage to be sent.We present the first known agreement and leader election algorithms for asynchronous networks in which the processors are reliable but some channels may be Byzantine faulty. The types of networks that we consider are complete networks, general networks with known sense of direction, and general networks with unknown sense of direction. When the processors terminate their corresponding algorithm, all the processors in the network will have the same correct vector, where the vector contains values that the processors wanted to broadcast. Our algorithms for the complete networks and the general networks with known sense of direction tolerate up to t Byzantine faulty channels provided that the connectivity is at least 2t + 1. The bound on the connectivity of the network is optimal. Moreover, we present two algorithms for asynchronous general networks with unknown sense of direction that require the connectivity to be at least 3t + 1. The first algorithm assumes that the processors know the total number n of processors in the network. The second algorithm assumes that n is unknown.In the second part of the dissertation, we present an algorithm that locates possible stuck-at faults in the switching subsystems of the nodes of general asynchronous fiber-optic networks and provides the nodes of such a network with reliable paths for delivering messages sent between any two nodes. The algorithm has an O($nsp2E$) message complexity, where n and E are the total number of nodes and the total number of links in the network, respectively." @default.
- W2340770048 created "2016-06-24" @default.
- W2340770048 creator A5061275647 @default.
- W2340770048 date "1995-09-01" @default.
- W2340770048 modified "2023-09-26" @default.
- W2340770048 title "Asynchronous failure location and agreement algorithms for fiber-optic and for traditional networks with Byzantine links" @default.
- W2340770048 hasPublicationYear "1995" @default.
- W2340770048 type Work @default.
- W2340770048 sameAs 2340770048 @default.
- W2340770048 citedByCount "0" @default.
- W2340770048 crossrefType "journal-article" @default.
- W2340770048 hasAuthorship W2340770048A5061275647 @default.
- W2340770048 hasConcept C11413529 @default.
- W2340770048 hasConcept C120314980 @default.
- W2340770048 hasConcept C127162648 @default.
- W2340770048 hasConcept C151319957 @default.
- W2340770048 hasConcept C168021876 @default.
- W2340770048 hasConcept C17532199 @default.
- W2340770048 hasConcept C31258907 @default.
- W2340770048 hasConcept C38652104 @default.
- W2340770048 hasConcept C41008148 @default.
- W2340770048 hasConcept C41065033 @default.
- W2340770048 hasConcept C63540848 @default.
- W2340770048 hasConcept C80444323 @default.
- W2340770048 hasConceptScore W2340770048C11413529 @default.
- W2340770048 hasConceptScore W2340770048C120314980 @default.
- W2340770048 hasConceptScore W2340770048C127162648 @default.
- W2340770048 hasConceptScore W2340770048C151319957 @default.
- W2340770048 hasConceptScore W2340770048C168021876 @default.
- W2340770048 hasConceptScore W2340770048C17532199 @default.
- W2340770048 hasConceptScore W2340770048C31258907 @default.
- W2340770048 hasConceptScore W2340770048C38652104 @default.
- W2340770048 hasConceptScore W2340770048C41008148 @default.
- W2340770048 hasConceptScore W2340770048C41065033 @default.
- W2340770048 hasConceptScore W2340770048C63540848 @default.
- W2340770048 hasConceptScore W2340770048C80444323 @default.
- W2340770048 hasLocation W23407700481 @default.
- W2340770048 hasOpenAccess W2340770048 @default.
- W2340770048 hasPrimaryLocation W23407700481 @default.
- W2340770048 hasRelatedWork W1598645236 @default.
- W2340770048 hasRelatedWork W1689816783 @default.
- W2340770048 hasRelatedWork W1970913408 @default.
- W2340770048 hasRelatedWork W1980461136 @default.
- W2340770048 hasRelatedWork W2012658742 @default.
- W2340770048 hasRelatedWork W2015556975 @default.
- W2340770048 hasRelatedWork W2016201384 @default.
- W2340770048 hasRelatedWork W2050681016 @default.
- W2340770048 hasRelatedWork W2059371135 @default.
- W2340770048 hasRelatedWork W2140749668 @default.
- W2340770048 hasRelatedWork W2152720784 @default.
- W2340770048 hasRelatedWork W2613952354 @default.
- W2340770048 hasRelatedWork W2726533958 @default.
- W2340770048 hasRelatedWork W2775875217 @default.
- W2340770048 hasRelatedWork W2952617708 @default.
- W2340770048 hasRelatedWork W2963912117 @default.
- W2340770048 hasRelatedWork W3005582769 @default.
- W2340770048 hasRelatedWork W30207158 @default.
- W2340770048 hasRelatedWork W3128350055 @default.
- W2340770048 hasRelatedWork W89820973 @default.
- W2340770048 isParatext "false" @default.
- W2340770048 isRetracted "false" @default.
- W2340770048 magId "2340770048" @default.
- W2340770048 workType "article" @default.