default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Jacques Pansiot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j22]Jean-Romain Luttringer
, Yves Vanaubel, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
Let There Be Light: Revealing Hidden MPLS Tunnels With TNT. IEEE Trans. Netw. Serv. Manag. 17(2): 1239-1253 (2020)
2010 – 2019
- 2019
- [c27]Yves Vanaubel, Jean-Romain Luttringer, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels. TMA 2019: 65-72 - [i3]Yves Vanaubel, Jean-Romain Luttringer, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels. CoRR abs/1901.10156 (2019) - 2018
- [j21]Pascal Mérindol, Pierre David, Jean-Jacques Pansiot, François Clad, Stefano Vissicchio:
A fine-grained multi-source measurement platform correlating routing transitions with packet losses. Comput. Commun. 129: 166-183 (2018) - 2017
- [c26]Yves Vanaubel, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
Through the wormhole: tracking invisible MPLS tunnels. Internet Measurement Conference 2017: 29-42 - 2016
- [c25]Yves Vanaubel, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
A Brief History of MPLS Usage in IPv6. PAM 2016: 359-370 - 2015
- [j20]François Clad, Stefano Vissicchio, Pascal Mérindol, Pierre François, Jean-Jacques Pansiot:
Computing Minimal Update Sequences for Graceful Router-Wide Reconfigurations. IEEE/ACM Trans. Netw. 23(5): 1373-1386 (2015) - [c24]Yves Vanaubel, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
MPLS Under the Microscope: Revealing Actual Transit Path Diversity. Internet Measurement Conference 2015: 49-62 - 2014
- [j19]François Clad, Pascal Mérindol, Jean-Jacques Pansiot, Pierre François, Olivier Bonaventure:
Graceful Convergence in Link-State IP Networks: A Lightweight Algorithm Ensuring Minimal Operational Impact. IEEE/ACM Trans. Netw. 22(1): 300-312 (2014) - 2013
- [j18]Vincent Lucas, Jean-Jacques Pansiot, Dominique Grad, Benoît Hilt:
Robust and fair Multicast Congestion Control (M2C). Comput. Networks 57(3): 699-724 (2013) - [j17]Fabien Tarissan, Bruno Quoitin, Pascal Mérindol, Benoit Donnet, Jean-Jacques Pansiot, Matthieu Latapy:
Towards a bipartite graph modeling of the internet topology. Comput. Networks 57(11): 2331-2347 (2013) - [c23]François Clad, Pascal Mérindol, Stefano Vissicchio, Jean-Jacques Pansiot, Pierre François:
Graceful router updates in link-state protocols. ICNP 2013: 1-10 - [c22]Yves Vanaubel, Jean-Jacques Pansiot, Pascal Mérindol, Benoit Donnet:
Network fingerprinting: TTL-based router signatures. Internet Measurement Conference 2013: 369-376 - 2012
- [j16]Benoit Donnet, Matthew J. Luckie, Pascal Mérindol, Jean-Jacques Pansiot:
Revealing MPLS tunnels obscured from traceroute. Comput. Commun. Rev. 42(2): 87-93 (2012) - [c21]Pietro Marchetta, Pascal Mérindol, Benoit Donnet, Antonio Pescapè, Jean-Jacques Pansiot:
Quantifying and mitigating IGMP filtering in topology discovery. GLOBECOM 2012: 1871-1876 - 2011
- [j15]Pascal Mérindol, Pierre François, Olivier Bonaventure, Stéphane Cateloin, Jean-Jacques Pansiot:
An efficient algorithm to enable path diversity in link state routing networks. Comput. Networks 55(5): 1132-1149 (2011) - [j14]Pietro Marchetta, Pascal Mérindol, Benoit Donnet, Antonio Pescapè, Jean-Jacques Pansiot:
Topology Discovery at the Router Level: A New Hybrid Tool Targeting ISP Networks. IEEE J. Sel. Areas Commun. 29(9): 1776-1787 (2011) - [c20]Vincent Lucas, Jean-Jacques Pansiot, Dominique Grad, Benoît Hilt:
Efficient Packet Sequencing for Dynamic Multicast Layers. AINA 2011: 667-674 - [c19]Pascal Mérindol, Benoit Donnet, Jean-Jacques Pansiot, Matthew J. Luckie, Young Hyun:
MERLIN: MEasure the router level of the INternet. NGI 2011: 1-8 - 2010
- [c18]Pascal Mérindol, Benoit Donnet, Olivier Bonaventure, Jean-Jacques Pansiot:
On the impact of layer-2 on node degree distribution. Internet Measurement Conference 2010: 179-191 - [c17]Jean-Jacques Pansiot, Pascal Mérindol, Benoit Donnet, Olivier Bonaventure:
Extracting Intra-domain Topology from mrinfo Probing. PAM 2010: 81-90 - [i2]Vincent Lucas, Jean-Jacques Pansiot, Dominique Grad, Benoît Hilt:
Efficient multicast data transfer with congestion control using dynamic source channels. CoRR abs/1004.4809 (2010)
2000 – 2009
- 2009
- [c16]Pascal Mérindol, Virginie Van den Schrieck, Benoit Donnet, Olivier Bonaventure, Jean-Jacques Pansiot:
Quantifying ases multiconnectivity using multicast information. Internet Measurement Conference 2009: 370-376 - [i1]Pascal Mérindol, Jean-Jacques Pansiot, Stéphane Cateloin:
The mdt algorithm. CoRR abs/0904.0217 (2009) - 2008
- [c15]Pascal Mérindol, Jean-Jacques Pansiot, Stéphane Cateloin:
Improving Load Balancing with Multipath Routing. ICCCN 2008: 54-61 - 2007
- [j13]Jean-Jacques Pansiot:
Local and dynamic analysis of Internet multicast router topology. Ann. des Télécommunications 62(3-4): 408-425 (2007) - [c14]Pascal Mérindol, Jean-Jacques Pansiot, Stéphane Cateloin:
Path Computation for Incoming Interface Multipath Routing. ECUMN 2007: 75-85 - 2005
- [c13]Mickaël Hoerdt, Jean-Jacques Pansiot:
A dynamic SSM source discovery protocol. GLOBECOM 2005: 6 - 2002
- [c12]Damien Magoni, Jean-Jacques Pansiot:
Evaluation of Internet topology generators by power law and distance indicators. ICON 2002: 401-406 - [c11]Damien Magoni, Jean-Jacques Pansiot:
Network Layer Search Service Using Oriented Multicasting. INFOCOM 2002: 1346-1355 - [c10]Damien Magoni, Jean-Jacques Pansiot:
Internet topology modeler based on map sampling. ISCC 2002: 1021-1027 - [c9]Damien Magoni, Jean-Jacques Pansiot:
Analysis and Comparison of Internet Topology Generators. NETWORKING 2002: 364-375 - 2001
- [j12]Damien Magoni, Jean-Jacques Pansiot:
Analysis of the autonomous system network topology. Comput. Commun. Rev. 31(3): 26-37 (2001) - [j11]Damien Magoni, Jean-Jacques Pansiot:
Oriented multicast routing algorithm applied to network-level agent search. Discret. Math. Theor. Comput. Sci. 4(2): 255-272 (2001) - [c8]Damien Magoni, Jean-Jacques Pansiot:
Algorithm for an oriented multicast routing protocol. ICC 2001: 2593-2597 - [c7]Damien Magoni, Jean-Jacques Pansiot:
Influence of Network Topology on Protocol Simulation. ICN (1) 2001: 762-770 - 2000
- [c6]Mouhamadou Lamine Diagne, Thomas Noël, Jean-Jacques Pansiot:
Active Networks for IPv6 Communication Redirection. MATA 2000: 139-150
1990 – 1999
- 1998
- [j10]Jean-Jacques Pansiot, Dominique Grad:
On routes and multicast trees in the Internet. Comput. Commun. Rev. 28(1): 41-50 (1998)
1980 – 1989
- 1986
- [j9]Jean-Jacques Pansiot:
Decidability of Periodicity for Infinite Words. RAIRO Theor. Informatics Appl. 20(1): 43-46 (1986) - 1985
- [j8]Jean-Jacques Pansiot:
Subword complexities and iteration. Bull. EATCS 26: 55-62 (1985) - 1984
- [j7]Jean-Jacques Pansiot:
A propos d'une conjecture de F. Dejean sur les répétitions dans les mots. Discret. Appl. Math. 7(3): 297-311 (1984) - [c5]Jean-Jacques Pansiot:
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés. ICALP 1984: 380-389 - [c4]Jean-Jacques Pansiot:
On various classes of infinite words obtained by iterated mappings. Automata on Infinite Words 1984: 188-197 - [c3]Jean-Jacques Pansiot:
Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres. STACS 1984: 230-240 - 1983
- [j6]Jean-Jacques Pansiot:
Hiérarchie et fermeture de certaines classes de tag-systèmes. Acta Informatica 20: 179-196 (1983) - [j5]Jean-Jacques Pansiot:
Mots Infinis de Fibonacci et Morphismes Itérés. RAIRO Theor. Informatics Appl. 17(2): 131-135 (1983) - [c2]Jean-Jacques Pansiot:
A Propos d'une Conjecture de F. Dejean sur les Répétitions dans les Mots. ICALP 1983: 585-596 - 1982
- [j4]Jean-Jacques Pansiot:
Nombres d'Euler et Inversions dans les Arbres. Eur. J. Comb. 3(3): 259-262 (1982) - 1981
- [j3]Jean-Jacques Pansiot:
The Morse Sequence and Iterated Morphisms. Inf. Process. Lett. 12(2): 68-70 (1981) - [j2]Jean-Jacques Pansiot:
A Note on Post's Correspondence Problem. Inf. Process. Lett. 12(5): 233 (1981) - [c1]Jean-Jacques Pansiot:
A Decidable Property of Iterated Morphisms. Theoretical Computer Science 1981: 152-158
1970 – 1979
- 1979
- [j1]John E. Hopcroft, Jean-Jacques Pansiot:
On the Reachability Problem for 5-Dimensional Vector Addition Systems. Theor. Comput. Sci. 8: 135-159 (1979) - 1976
- [b1]Jean-Jacques Pansiot:
Some Decidable Cases of the Reachability Problem for Vector Addition Systems. Cornell University, USA, 1976
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
