Christian Glacet

Learn More
Leader election is one of the fundamental problems in distributed computing. It calls for all nodes of a network to agree on a single node, called the <i>leader</i>. If the nodes of the network have distinct labels, then agreeing on a single node means that all nodes have to output the label of the elected leader. If the nodes of the network are anonymous,(More)
Many articles deal with the problem of maintaining a rooted shortest-path tree However, after some edge deletions, some nodes can be disconnected from the connected component Vr of distinguished node r. In this case, an additional objective is to ensure the detection of the disconnection by the nodes that no longer belong to Vr. Without any assumption on(More)
We present a distributed asynchronous algorithm that for every undirected weighted graph G with n nodes constructs name-independent routing tables for G. The size of each table is˜O(√ n) whereas the length of any route is stretched by a factor of at most 7 w.r.t. the shortest path. At any step, the memory space of each node is˜O(√ n). The algorithm(More)
This paper investigates compact routing schemes that are very efficient with respect to the memory used to store routing tables in internet-like graphs. We propose a new compact name-independent routing scheme whose theoretically proven average memory per node is upper-bounded by n<sup>&#947;</sup>, with constant &#947; < 1/2, while the maximum memory of(More)
Store-carry-and-forward is extensively used in vehicular environments for many and varied purposes, including routing, disseminating, downloading, uploading, or offloading delay-tolerant content. The performance gain of store-carry-and-forward over traditional connected forwarding is primarily determined by the fact that it grants a much improved network(More)
Cet articlé etudie les schémas de routage compacts qui sont très efficaces en termes de mémoires utilisées pour le stockage des tables de routage dans les graphes de type Internet. Nous proposons un nouveau schéma de routage compact avec indépendance des noms, dont la mémoire moyenne par noeud est prouvée commé etant bornée par √ n, et pour lequel l'´(More)
Pour permettre le routage dans un graphe, les noeuds doivent connaˆıtre des portions de route. La dynamique du graphe peut rendre les informations stockées erronées. Cet article s'intéressè a la caractérisation de la quantité d'informations erronées, ainsi qu'aux nombre de changements de distances dans le graphe suitè a M suppressions d'arêtes et M(More)
Nous présentons un algorithme distribué construisant des tables de routage de taille sous-linéaire en n, le nombre de noeuds du réseau. Le temps de convergence est proportionnel au diamètre, ce qui est optimal. Par rapportà BGP, la complexité du nombre de messageséchangés est améliorée jusqu'` a un facteur √ n, alors que la longueur des routes induites par(More)