Section: Partnerships and Cooperations

European Initiatives

FP7 Projet

EULER

• Title: EULER (Experimental UpdateLess Evolutive Routing)

• Type: COOPERATION (ICT)

• Defi: Future Internet Experimental Facility and Experimentally-driven Research

• Instrument: Specific Targeted Research Project (STREP)

• Duration: October 2010 - September 2013

• Coordinator: ALCATEL-LUCENT (Belgium)

• Others partners:

  • Alcatel-Lucent Bell, Antwerpen, Belgium

  • 3 projects from INRIA: CEPAGE, GANG and MASCOTTE, France

  • Interdisciplinary Institute for Broadband Technology (IBBT),Belgium

  • Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre Marie Curie (UPMC), France

  • Department of Mathematical Engineering (INMA) Université Catholique de Louvain, Belgium

  • RACTI, Research Academic Computer Technology Institute University of Patras, Greece

  • CAT, Catalan Consortium: Universitat Politècnica de Catalunya, Barcelona and University of

  • Girona, Spain

• See also: http://www-sop.inria.fr/mascotte/EULER/wiki/

• Abstract: The title of this study is "Dynamic Compact Routing Scheme". The aim of this projet is to develop new routing schemes achieving better performances than current BGP protocols. The problems faced by the inter-domain routing protocol of the Internet are numerous:

  1. The underlying network is dynamic: many observations of bad configurations show the instability of BGP;

  2. BGP does not scale well: the convergence time toward a legal configuration is too long, the size of routing tables is proportional to the number of nodes of network (the network size is multiplied by 1.25 each year);

  3. The impact of the policies is so important that the many packets can oscillated between two Autonomous Systems.

  In this collaboration, we mainly focus on the scalability properties that a new routing protocol should guarantee. The main measures are the size of the local routing tables, and the time (or message complexity) to update or to generate such tables. The design of schemes achieving sub-linear space per routers, say in n where $n$ is the number of AS routers, is the main challenge. The target networks are AS-network like with more than 100,000 nodes. This project, in collaboration with the MASCOTE INRIA-project in Nice Sophia-Antipolis, makes the use of simulation, developed at both sites.

Royal Society Grant with the University of Liverpool

Participants : Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski.

International Joint Project, 2011-2013, entitled “SEarch, RENdezvous and Explore (SERENE)”, on foundations of mobile agent computing, in collaboration with the Department of Computer Science, University of Liverpool. Funded by the Royal Society, U.K. Principal investigator on the UK side: Leszek Gasieniec. Ralf Klasing is the principal investigator on the French side.

European COST Action ComplexHPC (2009-2012)

Participants : Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois.

The goal of ComplexHPC is to coordinate European groups working on the use of heterogeneous and hierarchical systems for HPC as well as the development of collaborative activities among the involved research groups, to tackle the problem at every level (from cores to large-scale environments) and to provide new integrated solutions for large-scale computing for future platforms (see http://complexhpc.org/index.php ).

Emergent Project with the University of Perugia

Participants : David Ilcinkas, Ralf Klasing, Adrian Kosowski.

International Joint Project, 2011, on foundations of mobile agent computing, in collaboration with the Department of Computer Science, University of Perugia, Italy. Principal investigator on the Italian side: Alfredo Navarra. Ralf Klasing is the principal investigator on the French side.

Major European Organizations with which you have followed Collaborations

• Marcin Markiewicz, University of Gdansk (Poland)

• Quantum distributed computing models and simulation of quantum correlations using classical information channels.

• Ashley Deflumere and Alexey Lastovetsky, University College Dublin (Ireland)

• Design of efficient distribution scheme for linear algebra kernels on modern heterogeneous architectures

• Gabriele Di Stefano, University of L'Aquila (Italy)

• Alfredo Navarra, University of Perudia (Italy)

• Mobile agent coordination in distributed computing.

• Miroslaw Korzeniowski, Technical University of Wroclaw (Poland)

• Design of distributed and randomized algorithms for P2P networks.

• Leszek Gasieniec, University of Liverpool (UK)

• Design of distributed algorithms for mobile agents in exploration and patrolling tasks.

• Guido Proetti, University of L'Aquila (Italy)

• Davide Bilo, University of Sassari (Italy)

• Network discovery and verification. ation techniques for chosen task scheduling problems.

• Tobias Mömke, KTH Royal Institute of Technology, Stockholm (Sweden)

• Centralized approximation techniques for chosen task scheduling problems.

• Thomas Sauerwald, Max-Planck-Institut für Informatik, Saarbrücken (Germany)

• Propp machine, Multiple random walks.