GIROIRE , Frédéric

A new class of algorithms to estimate the cardinality of very large multisets using constant memory and doing only one pass on the data is introduced here. It is based on order statistics rather than on bit patterns in binary representations of numbers. Three families of estimators are analyzed. They attain a standard error of using M units of...

No description

A communication in a network is a pair of nodes (s, t). The node s is called the source source and t the destination. A communication set is a set of distinct communications, i.e. two communications might have the same source or the same destination, but they cannot have both same source and same destination. A routing of a communication (s, t)...

A communication in a network is a pair of nodes (s, t). The node s is called the source source and t the destination. A communication set is a set of distinct communications, i.e. two communications might have the same source or the same destination, but they cannot have both same source and same destination. A routing of a communication (s, t)...

Motivated by routing in telecommunication network using Software Defined Network (SDN) technologies, we consider the following problem of finding short routing lists using aggregation rules. We are given a set of communications X , which are distinct pairs (s, t) ⊆ S × T , (typically S is the set of sources and T the set of destinations), and a...

A good edge-labelling of a graph G is a labelling of its edges such that, for any ordered pair of vertices (x, y), there do not exist two paths from x to y with increasing labels. This notion was introduced in [2] to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at characterizing the class of...

A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one (u, v)-path with non-decreasing labels. This notion was introduced in [3] to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at characterizing the class of graphs that...

A {\em good edge-labelling} of a graph $G$ is a labelling of its edges such that, for any ordered pair of vertices $(x,y)$, there do not exist two paths from $x$ to $y$ with increasing labels. This notion was introduced in~\cite{BCP} to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at...

National audience

La détection d'anomalies demeure une tâche cruciale pour assurer une gestion efficace et flexible d'un réseau. Récemment, les noyaux de graphes ont connu un grand succès dans de nombreux domaines, notamment en bio-informatique et vision artificielle. Notre travail vise à étudier leur pouvoir de discrimination dans le domaine des réseaux afin de...

With the continuous growing level of dynamicity, heterogeneity, and complexity of traffic data, anomaly detection remains one of the most critical tasks to ensure an efficient and flexible management of a network. Recently, driven by their empirical success in many domains, especially bioinformatics and computer vision, graph kernels have...

Dans cette étude, nous nous penchons sur les systèmes pair-à-pair pour la diffusion de vidéo en direct. Ces systèmes peuvent être divisés en deux sous-groupes. Dans les systèmes non-structurés, le choix des liens sur lesquels transmettre la vidéo n'est pas régit par une structure et la diffusion se fait de façon opportuniste. Dans les systèmes...

—We study distributed systems for live video streaming. These systems can be of two types: structured and un-structured. In an unstructured system, the diffusion is done opportunistically. The advantage is that it handles churn, that is the arrival and departure of users, which is very high in live streaming systems, in a smooth way. On the...

no abstract

Recently, energy-aware routing has gained increasing popularity in the networking research community. The idea is that traffic demands are aggregated over a subset of the network links, allowing other links to be turned off to save energy. In this paper, we propose GreenRE - a new energy-aware routing model with the support of the new technique...

In this paper, we study the disconnection of a moving vehicle from a linear access network composed by cheap WiFi Access Points in the context of the telecommuting in massive transportation systems. In concrete, we analyze the probability for a user to experience a disconnection longer than a given time interval (t *) such that all ongoing...

In this paper, we study the disconnection of a moving vehicle from a linear access network composed by cheap WiFi Access Points in the context of the telecommuting in massive transportation systems. In concrete, we analyze the probability for a user to experience a disconnection longer than a threshold t∗, leading to a disruption of all...

The (edge) forwarding index of a graph is the minimum, over all possible routings of all the demands, of the maximum load of an edge. This metric is of a great interest since it captures the notion of global congestion in a precise way: the lesser the forwarding-index, the lesser the congestion. In this paper, we study the following design...

De récentes études montrent que la charge de trafic des routeurs n'a qu'une faible influence sur leur consommation énergétique. Par conséquent, la consommation dans les réseaux est fortement liée au nombre d'équipements du réseau activés (interfaces, chassis, etc). Dans un objectif de minimisation de l'énergie dans les réseaux, il est...

Data collection is an important mechanism for wireless sensor networks to be viable. This paper addresses the Aerial Data Collection Problem (ADCP) from a set of mobile wireless sensors located on the ground, using a fleet of flying devices. The objective is i) to deploy a set of Unmanned Aerial Vehicles (UAVs) in a 3D space to cover and...

Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peer-to-peer storage systems have been proposed. Most of them rely on the use of erasure codes to introduce redundancy to the data. This kind of system depends on many parameters...

Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redundancy is by simple replication. This strategy allows an easy and fast access to data, and a good bandwidth e ciency to repair the missing redundancy when a peer leaves or fails...

In telecommunication networks packets are carried from a source s to a destination t on a path that is determined by the underlying routing protocol. Most routing protocols belong to the class of shortest path routing protocols. In such protocols, the network operator assigns a length to each link. A packet going from s to t follows a shortest...

In this work, we address the optimization problem of covering a set of mobile sensors with a fleet of flying devices. The goal is to deploy a connected set of Unmanned Aerial Vehicles (UAVs) continuously monitoring the mobile sensors and reporting information to a fixed base station for efficient data collection. We propose an effective...

Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant fragments and distribute them among the peers. We study here the impact of different data placement strategies on the system performance when using...