AlgoTel et CoRes 2022
Université Paris-Saclay du 30 Mai au 3 juin 2022
KEYNOTES
L’optimisation au service des réseaux cœurs d’Orange
Eric GOURDIN, Orange Labs
Les réseaux de télécommunication connaissent actuellement des évolutions majeures qui s’accompagnent de très nombreuses promesses (hauts débit, latence réduites, agilité dans le déploiement, flexibilité dans la gestion,…). Si les architectures et les technologies d’accès et de transmissions devraient contribuer à l’atteinte de ces objectifs, les innombrables services et flux de trafic devront continuer à s’écouler et ce, de manière d’autant plus efficace, dans les réseaux cœurs des opérateurs ou autres acteurs de l’Internet mondial. Pour faire face à ces défis, de nouvelles problématiques d’optimisation de réseaux apparaissent, en partie issues d’adaptation ou de combinaisons de modèles classiques (network design, location, routing,…). Cet exposé propose un rapide survol de quelques-uns de ces problèmes et des méthodologies de résolution associée
Eric Gourdin obtained his Ph.D. in 1994 from Ecole Polytechnique de Montréal. He worked on a TMR Grant from 1996 to 1998 at ULB (Université Libre de Bruxelles) on traffic management problems. He joined Orange (former France Telecom) in 1998 where he has been working on various network optimisation problems, with a special focus on IP networks. He has been in charge of OR (Operation Research) for several years and has lead various optimisation oriented projects at Orange Labs. He has co-authored many scientific papers and contributed to several books. His latest interest lies in location, routing and packing problems, specifically in 5G and virtual networks. He is in charge of the research team MORE (Mathematical models for Optimisation and performance evaluation) at Orange Labs. He was appointed part-time Lecturer in OR at Ecole Polytechnique in June 2018.
Distributed systems as combinatorial structures
Peter KUZNETSOV, TELECOM PARIS
Our dependence on performance and reliability of distributed systems becomes more and more imminent with time. Understanding fundamentals of distributed computing is therefore of crucial importance. In this talk, we overview how the language combinatorial topology helps in characterising computability of a large class of distributed computing models by demarcating the borderline between solvable and unsolvable.
Petr is a Professor in Computer Science at Télécom Paris, Institut Polytechnique de Paris. Petr obtained Bsc and MSc in Mathematics, in 1995 and 1997, resp., from ITMO University and PhD in Computer Science in 2005 from EPFL. He worked as a postdoc at Max Planck Institute in Software Systems, and a senior research scientist at the Technical University of Berlin. Since 2013, he holds a professorship at Télécom Paris. His research interests lie at theoretical and practical aspects of distributed systems, with a visible inclination toward theory. His contributions include work on failure detectors, accountability, characterization of computability of distributed computing models, combinatorial topology in distributed computing, and transactional memory. Recently, he got deeply into the problem space of large-scale replicated systems and application-specific accountability. He was a partner of Marie-Curie ITN TransForm (2010-2015) and Euro-TM COST Action projects on the foundations of transactional memory, the princicpal investigator of the ANR-DFG DISCMAT project on mathematical methods in distributed computing (2015-2019), and currently manages TrustShare Innovation Chair (initiated in 2021) on fixing fundamental drawbacks in the blockchain technology.
Ils soutiennent l'événement
