Computing and updating the process number in trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Computing and updating the process number in trees

Résumé

The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is similar to the node search number, and thus to the pathwidth, however they are not always equal. In general determining these parameters is NP-complete. We present a distributed algorithm to compute these parameters and the edge search number, in trees. It can be executed in an asynchronous environment, requires n steps, an overall computation time of O(n log n), and n messages of size log3 n + 2. Then, we propose a distributed algorithm to update these parameters on each component of a forest after addition or deletion of any tree edge. This second algorithm requires O(D) steps, an overall computation time of O(D log n), and O(D) messages of size log3 n + 3, where D is the diameter of the new connected component.
Fichier principal
Vignette du fichier
opodis08-nostyle.pdf (73.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00429149 , version 1 (31-10-2009)

Identifiants

Citer

David Coudert, Florian Huc, Dorian Mazauric. Computing and updating the process number in trees. 12th International Conference On Principles Of DIstributed Systems (OPODIS), Dec 2008, Luxor, Egypt. ⟨10.1007/978-3-540-92221-6_37⟩. ⟨inria-00429149⟩
122 Consultations
218 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More