Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilles Trédan
- > Home > Persons > Gilles Trédan
Publications
- 2022
[j17]Klaus-Tycho Foerster
, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Improved Fast Rerouting Using Postprocessing. IEEE Trans. Dependable Secur. Comput. 19(1): 537-550 (2022)- [c37]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Price of Locality in Static Fast Rerouting. DSN 2022: 215-226 - [i16]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Price of Locality in Static Fast Rerouting. CoRR abs/2204.03413 (2022) - 2021
- [j16]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Implications of Routing Models on Network Optimization. IEEE Trans. Netw. Serv. Manag. 18(4): 4756-4769 (2021) - [c36]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Feasibility of Perfect Resilience with Local Fast Failover. APOCS 2021: 55-69 - [c35]Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes. INFOCOM 2021: 1-10 - 2020
- [c33]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Implications of Routing Coherence and Consistency on Network Optimization. Networking 2020: 316-324 - [c31]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally. DISC 2020: 46:1-46:3 - [i15]Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
On the Feasibility of Perfect Resilience with Local Fast Failover. CoRR abs/2006.06513 (2020) - 2019
- [c30]Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Bonsai: Efficient Fast Failover Routing Using Small Arborescences. DSN 2019: 276-288 - [c29]Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
CASA: Congestion and Stretch Aware Static Fast Rerouting. INFOCOM 2019: 469-477 - [c26]Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Improved Fast Rerouting Using Postprocessing. SRDS 2019: 173-182 - 2018
- [j13]Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Local Fast Failover Routing With Low Stretch. Comput. Commun. Rev. 48(1): 35-41 (2018) - [j12]Michael Borokhovich, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Load-Optimal Local Fast Rerouting for Dense Networks. IEEE/ACM Trans. Netw. 26(6): 2583-2597 (2018) - [c25]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Tomographic Node Placement Strategies and the Impact of the Routing Model. SIGMETRICS (Abstracts) 2018: 75-77 - 2017
- [j11]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Tomographic Node Placement Strategies and the Impact of the Routing Model. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 42:1-42:23 (2017) - [c22]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Load-Optimal Local Fast Rerouting for Resilient Networks. DSN 2017: 345-356 - 2016
- [j9]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Upper and lower bounds for deterministic broadcast in powerline communication networks. Distributed Comput. 29(4): 239-250 (2016) - 2015
- [j8]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Adversarial topology discovery in network virtualization environments: a threat for ISPs? Distributed Comput. 28(2): 91-109 (2015) - [i7]Yvonne-Anne Pignolet, Matthieu Roy, Stefan Schmid, Gilles Trédan:
Exploring the Graph of Graphs: Network Evolution and Centrality Distances. CoRR abs/1506.01565 (2015) - 2014
- [c17]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
ColorCast: Deterministic broadcast in powerline networks with uncertainties. SmartGridComm 2014: 458-463 - 2013
- [j5]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Misleading stars: what cannot be measured in the internet? Distributed Comput. 26(4): 209-222 (2013) - [c15]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Adversarial VNet embeddings: A threat for ISPs? INFOCOM 2013: 415-419 - [c14]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Request Complexity of VNet Topology Extraction: Dictionary-Based Attacks. NETYS 2013: 190-205 - [i5]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Request Complexity of VNet Topology Extraction: Dictionary-Based Attacks. CoRR abs/1304.5799 (2013) - 2012
- [c13]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology? DISC 2012: 429-430 - 2011
- [c10]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Misleading Stars: What Cannot Be Measured in the Internet? DISC 2011: 311-325 - [i1]Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Misleading Stars: What Cannot Be Measured in the Internet? CoRR abs/1105.5236 (2011)
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-02-20 20:09 CET 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:
