#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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>γ</sup>, with constant γ < 1/2, while the maximum memory of… (More)

We present a distributed asynchronous algorithm that, for every undirected weighted n-node graphG, constructs name-independent routing tables for G. The size of each table is Õ( √ 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 Õ( √ n ). The algorithm… (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)

- Christian Glacet, Nicolas Hanusse, David Ilcinkas
- OPODIS
- 2011

In this paper, we deal with an error model in distributed networks. For a target t, every node is assumed to give an advice, ie.to point to a neighbour that take closer to the destination. Any node giving a bad advice is called a liar . Starting from a situation without any liar, we study the impact of topology changes on the number of liars. More… (More)

- Christian Glacet, Avery Miller, Andrzej Pelc
- ACM Trans. Algorithms
- 2016

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)

- Christian Glacet, Marco Fiore, Marco Gramaglia
- 2015 IEEE Vehicular Networking Conference (VNC)
- 2015

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)

- Christian Glacet
- 2013

Cet article étudie 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 nœud est prouvée comme étant bornée par √ n, et pour lequel… (More)

- Sahel Sahhaf, Wouter Tavernier, +11 authors Piet Demeester
- IEEE Network
- 2017

A wide range of social, technological and communication systems can be described as complex networks. Scale-free networks are one of the well known classes of complex networks in which nodes� degrees follow a power-law distribution. The design of scalable, adaptive and resilient routing schemes in such networks is very challenging. In this article we… (More)

- Christian Glacet, Nicolas Hanusse, David Ilcinkas
- Theor. Comput. Sci.
- 2016

In order to achieve routing in a graph, nodes need to store routing information. In the case of shortest path routing, for a given destination, every node has to store an advice that is an outgoing link toward a neighbor. If this neighbor does not belong to a shortest path then the advice is considered as an error and the node giving this advice will be… (More)

- ‹
- 1
- ›