Two snap-stabilizing point-to-point communication protocols in message-switched networks

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use information given by a routing algorithm. By the context of stabilization (in particular, the system starts in an arbitrary configuration), this information can be corrupted. So, the existence of a snap-stabilizing protocol for the message forwarding problem implies that we can ask the system to begin forwarding messages even if routing information are initially corrupted. In this paper, we propose two snap-stabilizing algorithms (in the state model) for the following specification of the problem: - Any message can be generated in a finite time. - Any emitted message is delivered to its destination once and only once in a finite time. This implies that our protocol can deliver any emitted message regardless of the state of routing tables in the initial configuration. These two algorithms are based on the previous work of [MS78]. Each algorithm needs a particular method to be transform into a snap-stabilizing one but both of them do not introduce a significant overcost in memory or in time with respect to algorithms of [MS78]

Sociétés minières canadiennes et violations des droits de l’homme à l’étranger : le Canada respecte-t-il les prescriptions internationales en la matière?

La présente étude a pour objectif de vérifier si le Canada respecte les prescriptions internationales en matière de droits de l’homme et d’entreprises vis-à-vis de l’encadrement qu’il exerce sur les sociétés minières canadiennes évoluant à l’étranger. En 2011, le Conseil des droits de l’homme de l’ONU a adopté des «Principes directeurs» afin de mettre en oeuvre le cadre de référence « Protéger, Respecter, Réparer » du Représentant spécial chargé de la question des droits de l’homme et des sociétés transnationales et autres entreprises. Selon ce cadre de référence, les États ont des obligations de protection et de réparation alors que les entreprises ont seulement la responsabilité de respecter les droits humains. Après six années de travail, le Représentant spécial John Ruggie, a fait le choix de formuler dans ses «Principes directeurs» des directives non contraignantes à l’égard des États et des entreprises afin de les aider à remplir leurs obligations et responsabilités vis-à-vis des droits de l’homme. Selon, l’ONU, cet instrument de portée universelle est le plus élaboré en la matière, si bien qu’il est recommandé aux entreprises et plus particulièrement aux États de s’y conformer lors de l’élaboration de leurs politiques respectives en matière d'activité économique et de droits humains. Il convient donc de vérifier d’une part si l’encadrement exercé par l’appareil législatif et gouvernemental vis-à-vis des sociétés minières canadiennes évoluant à l’étranger est conforme au principe directeur «Protéger». D’autres part, il convient de vérifier si les recours judiciaires et extrajudiciaires disponibles au Canada remplissent les exigences du principe directeur «Réparer». Cette double analyse permettra de conclure que le Canada respecte dans les grandes lignes ces «Principes directeurs» mais qu’il pourrait faire bien plus notamment en terme d’accès à des réparations effectives pour les victimes étrangères de minières canadiennes.This study propose to assess whether Canada meets the international requirements of business and human rights in relation to the supervision it has on Canadian mining companies operating abroad. In 2011, the Human rights Council adopted the Special Representative’s Guiding Principles on Business and Human Rights in order to implement the United Nations “Protect, Respect and Remedy” Framework. According to this framework, States have obligations to protect and remedy while companies only have responsibilities to respect human rights. After six years of work, the Special Representative on Business and Human rights, John Ruggie, has chosen to give in its Guiding Principles non- binding recommendations in order to help States and businesses to encounter their obligations and responsibilities towards human rights. According to the UN, this universal instrument is the most developed in the field. Thus, it is strongly recommended that companies and especially States, comply those «guiding principles» when they elaborate their respective policies on economic activity and human rights. It is therefore necessary to check first if the supervision exercised by the legislature and the government on Canadian mining companies operating abroad succeeds to comply with the "Protect" principles. On the other hand, it must be checked whether the judicial and extrajudicial remedies available in Canada meet the requirements of the «Remedy" principles. This dual analysis will led to conclude that Canada meets broadly the "Guiding Principles" but could do much more, especially in terms of access to effective remedies for foreign victims of Canadian mining companies

Snap-Stabilization in Message-Passing Systems

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach, snap-stabilization guarantees that the effect of faults is contained immediately after faults cease to occur. Our contribution is twofold: we show that (1) snap-stabilization is impossible for a wide class of problems if we consider networks with finite yet unbounded channel capacity; (2) snap-stabilization becomes possible in the same setting if we assume bounded-capacity channels. We propose three snap-stabilizing protocols working in fully-connected networks. Our work opens exciting new research perspectives, as it enables the snap-stabilizing paradigm to be implemented in actual networks

Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems

In many wireless networks, there is no fixed physical backbone nor centralized network management. The nodes of such a network have to self-organize in order to maintain a virtual backbone used to route messages. Moreover, any node of the network can be a priori at the origin of a malicious attack. Thus, in one hand the backbone must be fault-tolerant and in other hand it can be useful to monitor all network communications to identify an attack as soon as possible. We are interested in the minimum \emph{Connected Vertex Cover} problem, a generalization of the classical minimum Vertex Cover problem, which allows to obtain a connected backbone. Recently, Delbot et al.~\cite{DelbotLP13} proposed a new centralized algorithm with a constant approximation ratio of $2$ for this problem. In this paper, we propose a distributed and self-stabilizing version of their algorithm with the same approximation guarantee. To the best knowledge of the authors, it is the first distributed and fault-tolerant algorithm for this problem. The approach followed to solve the considered problem is based on the construction of a connected minimal clique partition. Therefore, we also design the first distributed self-stabilizing algorithm for this problem, which is of independent interest

Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies

In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from the sender to the receiver to forward only one message %while using D buffers (where D refers to the diameter of the network) . The only solution that uses a constant number of buffers per link was introduced in [1]. However the solution works only on a chain networks. In this paper, we propose a snap-stabilizing algorithm for the message forwarding problem that uses the same complexity on the number of buffers as [1] and works on tree topologies.Nous considérons dans ce papier le problème d'acheminement de messages qui consiste à gérer les ressources du réseau. Des Solutions ont été proposées, soit qui utilisent un nombre significatif de buffers (n buffers par processeur où n correspond au nombre de processeurs dans le réseau), ce qui rend cette solution non adaptée au réseaux à grande échelle. Soit elles doivent réserver tout les buffers de la source à la destination. La seule solution qui utilise un nombre constant de buffers par lien a été introduite dans [1], cela dit cette solution fonctionne seulement sur des topologies linéaires. Dans ce papier, nous proposons un algorithme instantanément stabilisant pour le problème d'acheminement de messages ayant la même complexité en terme de nombre de buffers que [1] et qui fonctionne sur des topologies en arbre

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of $P_4$-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the trivially perfect edge-deletion problems. For the cograph vertex deletion problem, a refined analysis of the runtime of our simple bounded search algorithm gives a faster exponential factor than those algorithms designed with the help of complicated case distinctions and non-trivial running time analysis [21] and computer-aided branching rules [11].Comment: 23 pages. Accepted in Discrete Mathematics, Algorithms and Applications (DMAA

Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree

We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of $O(n\log \Delta)$ bits per node and $O(nD)$ respectively, where $\Delta$ is the highest degree of a node, $n$ is the number of nodes and $D$ is the diameter of the network. In contrast, our algorithm has a space complexity of $O(\log n)$ bits per node, which is optimal for silent-stabilizing spanning trees and runs in $O(n)$ time. In addition, our solution is modular since it utilizes the distributed verification algorithm as an independent subtask of the overall solution. It is possible to use the verification algorithm as a stand alone task or as a subtask in another algorithm. To demonstrate the simplicity of constructing efficient DFS algorithms using the modular approach, We also present a (non-sielnt) self-stabilizing DFS token circulation algorithm for general networks based on our silent-stabilizing DFS tree. The complexities of this token circulation algorithm are comparable to the known ones

Acheminement de messages instantanément stabilisant pour arbres couvrants

International audienceNous présentons un protocole instantanément stabilisant d'acheminement de messages au sein de structures couvrantes arborescentes de réseaux. Notre protocole utilise l'information fournie par un algorithme de calcul de tables de routage auto-stabilisant s'appuyant sur cette structure. Le fait que le protocole soit instantanément stabilisant signifie que tout message émis après les fautes est acheminé à son destinataire, y compris lorsque les tables de routage ne sont pas stabilisées. Notre algorithme présente l'avantage que le nombre de tampons est indépendant de tout paramètre global du réseau comme le nombre de noeuds ou le diamètre. En effet, nous montrons que le problème peut être résolu en utilisant un nombre constant de tampons par lien de communication de la structure couvrante. Cette propriété lui confère l'avantage de tolérer le passage à l'échelle

Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems

Ability to find and get services is a key requirement in the development of large-scale distributed sys- tems. We consider dynamic and unstable environments, namely Peer-to-Peer (P2P) systems. In previous work, we designed a service discovery solution called Distributed Lexicographic Placement Table (DLPT), based on a hierar- chical overlay structure. A self-stabilizing version was given using the Propagation of Information with Feedback (PIF) paradigm. In this paper, we introduce the self-stabilizing COPIF (for Collaborative PIF) scheme. An algo- rithm is provided with its correctness proof. We use this approach to improve a distributed P2P framework designed for the services discovery. Significantly efficient experimental results are presented