A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks

Abstract

The purpose of the paper is to present the first self-stabilizing algorithm for finding $$n-1$$ one-to-many node-disjoint paths in message passing model. Two paths in a network are said to be node disjoint if they do not share any nodes except for the endpoints. Our proposed algorithm works on n-dimensional star networks $$S_n$$. Given a source node s and a set of $$D = \{d_1, d_2, ...,d_{n-1} \}$$ of $$n-1$$ destination nodes in the n-dimensional star network, our algorithm constructs $$n-1$$ node-disjoints paths $$P_1, P_2,...,P_{n-1}$$, where $$P_i$$ is a path from s to $$d_i$$, $$1 \le i \le n-1$$. Since the proposed solution is self-stabilizing [7], it does not require initialization and withstands transient faults. The stabilization time of our algorithm is $$O(n^2)$$ rounds.
Fichier principal
Vignette du fichier
495624_1_En_12_Chapter.pdf (268.66 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03223260 , version 1 (10-05-2021)

Licence

Identifiers

Cite

Rachid Hadid, Vincent Villain. A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks. 20th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS), Jun 2020, Valletta, Malta. pp.186-203, ⟨10.1007/978-3-030-50323-9_12⟩. ⟨hal-03223260⟩
84 View
25 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More