Previous | 
Home
Section: Partnerships and Cooperations
International Initiatives
Inria Associate Teams Not Involved in an Inria International Labs
EfDyNet
-
International Partner (Institution - Laboratory - Researcher):
-
Networks are evolving rapidly in two directions. On the one hand, new network technologies are developed for different layers, and in particular flexible optical technologies (enabling to allocate a fraction of the optical spectrum rather than a fixed wavelength), Software Defined Networks, and Network Function Virtualization. On the other hand, the traffic patterns evolve and become less predictable due to the increase of cloud and mobile traffic. In this context, there are new possibilities and needs for dynamic resource allocations. We will study this problem mainly in two directions: network reconfiguration and the allocation of virtualized resources. The associated team will build on an already fruitful collaboration between COATI and Concordia. The two teams address design and management optimization problems in networks (WDM, wireless, SDN) with complementary tools and expertise.
Inria International Partners
Informal International Partners
Apart from formal collaboration Coati members maintain strong connections with the following international teams, with regular visits of both sides.
-
Universidade Federal do Ceará (Fortaleza, Brazil), ParGO team;
-
Universidade Estadual do Ceará (Fortaleza, Brazil), Prof. Leonardo Sampaio;
-
Univ. of Southern Denmark (Odense, Denmark), Prof. Jørgen Bang-Jensen.
Participation in Other International Programs
International Initiatives
-
International Partners (Institution - Laboratory - Researcher):
-
See also: https://team.inria.fr/coati/projects/sticamsud-galop/
-
This project aims at allowing to continue the fruitful and long-standing collaboration between Inria and UFC and between Inria and UAI. Another goal is to reinforce the collaboration between UFC and UAI that has been recently initiated. Our goal is to study the Computational Complexity of several important problems arising in networks (routing, resources assignment...). In particular, we will focus on the computation of metric or structural properties and parameters of large networks (e.g., transportation and social networks...). We plan to design efficient exact algorithms for solving these problems or to theoretically prove that such algorithms cannot exist. In the latter case, we will then design approximation algorithms, or prove that none exists. In all cases, we aim at implementing our algorithms and use them on real-world instances such as large road networks or huge social networks.