F. Coras, D. Saucez, L. Iannone, and A. Cabellos-aparicio, Locator/id separation protocol (lisp) impact, p.2016
URL : https://hal.archives-ouvertes.fr/hal-01423163

P. Godfrey, M. Caesar, I. Haken, Y. Singer, S. Shenker et al., Stabilizing Route Selection in BGP, IEEE/ACM Transactions on Networking, vol.23, issue.1, pp.282-299, 2015.
DOI : 10.1109/TNET.2014.2299795
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.9112

C. Gavoille, C. Glacet, N. Hanusse, and D. Ilcinkas, On the Communication Complexity of Distributed Name-Independent Routing Schemes, International Symposium on Distributed Computing, pp.418-432, 2013.
DOI : 10.1007/978-3-642-41527-2_29
URL : https://hal.archives-ouvertes.fr/hal-00851217

D. Careglio, D. Papadimitriou, F. Agraz-bujan, S. Sahhaf, J. Perelló-muntan et al., Development and experimentation towards a multicast-enabled Internet, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.79-84, 2014.
DOI : 10.1109/INFCOMW.2014.6849172
URL : https://biblio.ugent.be/publication/7144253/file/7144271.pdf

S. Sahhaf, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, Experimental validation of resilient tree-based greedy geometric routing, Computer Networks, vol.82, pp.156-171, 2015.
DOI : 10.1016/j.comnet.2015.02.022

M. Camelo, D. Papadimitriou, L. , and P. Viì, Geometric Routing With Word-Metric Spaces, IEEE Communications Letters, vol.18, issue.12, pp.2125-2128, 2014.
DOI : 10.1109/LCOMM.2014.2364213

S. Sahhaf, D. Papadimitriou, W. Tavernier, D. Colle, and M. Pickavet, Experimentation of Geometric Information Routing on Content Locators, 2014 IEEE 22nd International Conference on Network Protocols, pp.518-524, 2014.
DOI : 10.1109/ICNP.2014.82

T. E. Ng and H. Zhang, Predicting Internet network distance with coordinates-based approaches, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp.170-179, 2002.
DOI : 10.1109/INFCOM.2002.1019258
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1445

Y. Cao and Z. Sun, Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges, IEEE Communications Surveys & Tutorials, vol.15, issue.2, pp.654-677, 2013.
DOI : 10.1109/SURV.2012.042512.00053

A. Malatras, State-of-the-art survey on P2P overlay networks in pervasive computing environments, Journal of Network and Computer Applications, vol.55, pp.1-23, 2015.
DOI : 10.1016/j.jnca.2015.04.014

C. Gavoille, C. Glacet, N. Hanusse, and D. Ilcinkas, Brief Announcement, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.33-35, 2015.
DOI : 10.1016/j.comcom.2012.09.009
URL : https://hal.archives-ouvertes.fr/hal-00369644

I. Abraham, D. Malkhi, and D. Ratajczak, Compact Multicast Routing, International Symposium on Distributed Computing, pp.364-378, 2009.
DOI : 10.1007/978-3-642-04355-0_40

S. Sahhaf, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, Efficient geometric routing in large-scale complex networks with lowcost node design, IEICE Transactions on Communications, vol.99, issue.3, pp.666-674, 2016.

R. Houthooft, S. Sahhaf, W. Tavernier, F. De-turck, D. Colle et al., Robust geometric forest routing with tunable load balancing, 2015 IEEE Conference on Computer Communications (INFOCOM), pp.1382-1390, 2015.
DOI : 10.1109/INFOCOM.2015.7218515

A. Anisul and H. Flinck, A Compact Routing based Mapping System for the Locator/ID Separation Protocol (LISP), International Journal of Computer Applications, vol.127, issue.5, pp.1-8, 2015.
DOI : 10.5120/ijca2015906380

N. Nisse-received-his and M. S. Ph, degrees in computer science from Univ Paris-Sud (France) Chile) in 2007-08, and at Inria Sophia Antipolis (France) in 2008-09. Since 2009, he is full time researcher at Inria Sophia Antipolis. He received his HabilitationàHabilitation`Habilitationà Diriger la Recherche (HdR) in computer science from Univ His research interests include Graph Algorithms, Graph Theory and Combinatorial Optimization, mainly focusing on the spreading of information/routing in networks and pursuit-evasion games in graphs, He was a postdoctoral research associate in Departamento de Ingenieria Matematica Llú is F` abrega is Associate Professor in Computer Science, 2004.