INRIA project-team


Leader


External website

Research themes

Joined Inria team with IRIF (Distributed algorithms and graphs team, UMR 8243, Paris Diderot University and CNRS).

GANG focuses on algorithm design for large scale networks using structural properties of these networks. Application domains include the development of optimized protocols for large dynamic networks such as mobile networks or overlay networks over Internet. This includes for instance peer-to-peer applications, or the navigability of social networks. GANG tools come from recent advances in the field of graph algorithms, both in centralized and distributed settings. In particular, this includes graph decomposition and geometric properties (such as low doubling dimension, low dimension embedding, etc.).

Today, the management of large networks, Internet being the reference, is best effort. However, the demand for mobility (ad hoc networks, wireless connectivity, etc.) and for dynamicity (node churn, fault tolerance, etc.) is increasing. In this distributed setting, it becomes necessary to design a new generation of algorithms and protocols to face the challenge of large scale mobility and dynamicity.

In the mean time, recent and sophisticated theoretical results have emerged, offering interesting new tracks for managing large networks. These results concern centralized and decentralized algorithms for solving key problems in communication networks, including routing, but also information retrieval, localization, or load balancing. They are mainly based on structural properties observed in most of real networks: approximate topology with low dimension metric spaces, low treewidth, low doubling dimension, graph minor freeness, etc. In addition, graph decomposition techniques have recently progressed. The scientific community has now tools for optimizing network management. First striking results include designing overlay networks for peer-to-peer systems and understanding the navigability of large social networks.


Members

Name@PhoneOfficePositionPoleTeam
Boufkhad Yacine @ 01 57 27 94 05 4011 Maître.sse de conférence ASD compsys , gang
Charbit Pierre @ 0157279224 4030 Maître.sse de conférence ASD gang , graphes
Collet Simon @ 3010 Doctorant.e ASD algocomp , compsys , gang
Delporte Carole @ 01 57 27 92 25 4006 Professeur.e - directrice adjointe UFR informatique ASD gang , compsys
Feuilloley Laurent @ 3010 Doctorant.e ASD compsys , gang , graphes
Fraigniaud Pierre @ 01 57 27 92 60 4019 Directeur.rice de recherche - CNRS ASD algocomp , compsys , gang
Habib Michel @ 01 57 27 94 42 3042a Professeur.e ASD compsys , gang , graphes
Kosowski Adrian @ 4011 Chargé.e de recherche - INRIA ASD gang , compsys
Viennot Laurent @ 01 57 27 92 50 3016 Directeur.rice de recherche - INRIA ASD gang , compsys , graphes
ZOU Mengchuan @ 4057 Doctorant.e ASD gang , compsys , graphes
de Montgolfier Fabien @ 01 57 27 92 32 4018 Maître.sse de conférence ASD gang , compsys , graphes