Matches in SemOpenAlex for { <https://semopenalex.org/work/W2743459855> ?p ?o ?g. }
Showing items 1 to 91 of
91
with 100 items per page.
- W2743459855 endingPage "435" @default.
- W2743459855 startingPage "411" @default.
- W2743459855 abstract "The problem of two node-disjoint paths is to identify two paths [Formula: see text] and [Formula: see text] from source [Formula: see text] to target [Formula: see text] without any common intermediate node in a communication network [Formula: see text], where each node (vertex) in [Formula: see text] denotes a process and each edge [Formula: see text] denotes a communication channel between nodes [Formula: see text] and [Formula: see text]. In this paper, we present the first adaptive stabilizing algorithm for finding a pair of node-disjoint paths in a semi-anonymous arbitrary network in [Formula: see text] rounds and the state-space complexity is [Formula: see text] bits per process, where [Formula: see text] is the diameter of the communication network. The algorithm assumes weakly fair distributed daemon and the knowledge of an upper bound on the number of processes by each process. If two disjoint paths exist between [Formula: see text] and [Formula: see text], two disjoint paths are guaranteed to be constructed. In addition, the algorithm detects if two node-disjoint paths exist or not. Since the proposed algorithm is stabilizing, it does not require initialization and is capable of withstanding transient faults. We view a fault that perturbs the state of the system but not its program as a transient fault. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks." @default.
- W2743459855 created "2017-08-17" @default.
- W2743459855 creator A5023906766 @default.
- W2743459855 creator A5037763259 @default.
- W2743459855 creator A5071637597 @default.
- W2743459855 date "2017-06-01" @default.
- W2743459855 modified "2023-09-23" @default.
- W2743459855 title "A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks" @default.
- W2743459855 cites W2013048410 @default.
- W2743459855 cites W2039287103 @default.
- W2743459855 cites W2063615214 @default.
- W2743459855 cites W2064779029 @default.
- W2743459855 cites W2064944304 @default.
- W2743459855 cites W2102722785 @default.
- W2743459855 cites W2105726668 @default.
- W2743459855 cites W2111132249 @default.
- W2743459855 cites W2154434560 @default.
- W2743459855 cites W2155061423 @default.
- W2743459855 cites W2158598102 @default.
- W2743459855 cites W2163426446 @default.
- W2743459855 cites W2171625696 @default.
- W2743459855 cites W2258129511 @default.
- W2743459855 cites W3138066533 @default.
- W2743459855 cites W4231610975 @default.
- W2743459855 cites W4247618774 @default.
- W2743459855 cites W4311017726 @default.
- W2743459855 doi "https://doi.org/10.1142/s0129054117500253" @default.
- W2743459855 hasPublicationYear "2017" @default.
- W2743459855 type Work @default.
- W2743459855 sameAs 2743459855 @default.
- W2743459855 citedByCount "6" @default.
- W2743459855 countsByYear W27434598552019 @default.
- W2743459855 countsByYear W27434598552020 @default.
- W2743459855 countsByYear W27434598552021 @default.
- W2743459855 crossrefType "journal-article" @default.
- W2743459855 hasAuthorship W2743459855A5023906766 @default.
- W2743459855 hasAuthorship W2743459855A5037763259 @default.
- W2743459855 hasAuthorship W2743459855A5071637597 @default.
- W2743459855 hasConcept C11413529 @default.
- W2743459855 hasConcept C114466953 @default.
- W2743459855 hasConcept C114614502 @default.
- W2743459855 hasConcept C118615104 @default.
- W2743459855 hasConcept C127413603 @default.
- W2743459855 hasConcept C132525143 @default.
- W2743459855 hasConcept C199360897 @default.
- W2743459855 hasConcept C33923547 @default.
- W2743459855 hasConcept C41008148 @default.
- W2743459855 hasConcept C45340560 @default.
- W2743459855 hasConcept C48103436 @default.
- W2743459855 hasConcept C62611344 @default.
- W2743459855 hasConcept C66938386 @default.
- W2743459855 hasConcept C80444323 @default.
- W2743459855 hasConcept C80899671 @default.
- W2743459855 hasConceptScore W2743459855C11413529 @default.
- W2743459855 hasConceptScore W2743459855C114466953 @default.
- W2743459855 hasConceptScore W2743459855C114614502 @default.
- W2743459855 hasConceptScore W2743459855C118615104 @default.
- W2743459855 hasConceptScore W2743459855C127413603 @default.
- W2743459855 hasConceptScore W2743459855C132525143 @default.
- W2743459855 hasConceptScore W2743459855C199360897 @default.
- W2743459855 hasConceptScore W2743459855C33923547 @default.
- W2743459855 hasConceptScore W2743459855C41008148 @default.
- W2743459855 hasConceptScore W2743459855C45340560 @default.
- W2743459855 hasConceptScore W2743459855C48103436 @default.
- W2743459855 hasConceptScore W2743459855C62611344 @default.
- W2743459855 hasConceptScore W2743459855C66938386 @default.
- W2743459855 hasConceptScore W2743459855C80444323 @default.
- W2743459855 hasConceptScore W2743459855C80899671 @default.
- W2743459855 hasFunder F4320322668 @default.
- W2743459855 hasIssue "04" @default.
- W2743459855 hasLocation W27434598551 @default.
- W2743459855 hasLocation W27434598552 @default.
- W2743459855 hasOpenAccess W2743459855 @default.
- W2743459855 hasPrimaryLocation W27434598551 @default.
- W2743459855 hasRelatedWork W1984834024 @default.
- W2743459855 hasRelatedWork W2754156570 @default.
- W2743459855 hasRelatedWork W2770134917 @default.
- W2743459855 hasRelatedWork W2940821404 @default.
- W2743459855 hasRelatedWork W2998932593 @default.
- W2743459855 hasRelatedWork W3033876040 @default.
- W2743459855 hasRelatedWork W3109685666 @default.
- W2743459855 hasRelatedWork W3185918591 @default.
- W2743459855 hasRelatedWork W4206244388 @default.
- W2743459855 hasRelatedWork W4296581269 @default.
- W2743459855 hasVolume "28" @default.
- W2743459855 isParatext "false" @default.
- W2743459855 isRetracted "false" @default.
- W2743459855 magId "2743459855" @default.
- W2743459855 workType "article" @default.