SYSKA , Michel

International audience

The objective of BigGraphs is to provide a distributed middleware for very large graphs processing.The first phase of the project consists in the evaluation of the existing middlewares such as GraphX/Spark or Giraph/Hadoop with respect to the following criteria: ease of deployment, maintenance and use, variety of programming models (Map/Reduce,...

This report introduces a JAVA library whose objective is to provide tools for solving some network optimization problems and that may be used to write prototype software. We describe here the first step of the development which concerns algorithmic graph problems. This open source library named MASCOPT includes an implementation of a generic...

In this article we generalize the concept of line digraphs to line dihypergraphs. We give some general properties in particular concerning connectivity parameters of dihypergraphs and their line dihypergraphs, like the fact that the arc connectivity of a line dihypergraph is greater than or equal to that of the original dihypergraph. Then we...

National audience

Nous présentons un algorithme de calcul de chemins de secours dans un réseau optique qui offre de meilleures performances pratiques que d'autres algorithmes connus grâce à l'application d'une technique d'arrondi aléatoire.

Given a graph $G = (V, E)$, we define $\bar{e}(X)$, the mean eccentricity of a vertex $X$, as the average distance from $X$ to all the other vertices of the graph. The computation of this parameter appears to be nontrivial in the case of the de Bruijn networks. In this paper, we consider upper and lower bounds for e(X). For the directed de...

Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be nontrivial in the case of the de Bruijn networks. In this paper we consider upper and lower bounds for e(X). For the directed de Bruijn network, we...

International audience

Dans cet article nous donnons des bornes sur le coût du groupage dans les réseaux où le trafic est un ensemble de requêtes transportées dans une hiérarchie de couches électroniques ou optiques (réseaux dorsaux SONET/SDH ou WDM). Nous nous limitons au cas du groupage entre deux couches avec un coefficient de groupage unique : on groupe au plus C...

"Communication dans les réseaux de processeurs" écrit sous le nom de jean de Rumeur

International audience