Computing and Updating the Process Number in Trees
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(nlogn), and n messages of size log3n + 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(Dlogn), and O(D) messages of size log3n + 3, where D is the diameter of the new connected component.
KeywordsPathwidth process number distributed algorithm
Unable to display preview. Download preview PDF.
- 8.Coudert, D., Perennes, S., Pham, Q.C., Sereni, J.S.: Rerouting requests in wdm networks. In: AlgoTel 2005, Presqu’île de Giens, France, pp. 17–20 (2005)Google Scholar
- 9.Coudert, D., Sereni, J.S.: Characterization of graphs and digraphs with small process number. Research Report 6285, INRIA (2007)Google Scholar
- 12.Coudert, D., Huc, F., Mazauric, D.: A distributed algorithm for computing and updating the process number of a forest. Research Report 6560, INRIA (2008)Google Scholar