Search

Your search keyword '"Pignolet, Yvonne"' showing total 215 results
Start Over Author "Pignolet, Yvonne"
215 results on '"Pignolet, Yvonne"'

51. On Influencing the Influential

Author

Teng, Ya-Wen, primary, Chen, Hsi-Wen, additional, Yang, De-Nian, additional, Pignolet, Yvonne-Anne, additional, Li, Ting-Wei, additional, and Chen, Lydia, additional

Published
2021
Full Text
View/download PDF

53. On the Feasibility of Perfect Resilience with Local Fast Failover

Author

Foerster, Klaus-Tycho, Hirvonen, Juho, Pignolet, Yvonne-Anne, Schmid, Stefan, Tredan, Gilles, University of Vienna [Vienna], Department of Information and Computer Science [Aalto], Helsinki Institute for Information Technology (HIIT), Helsingin yliopisto = Helsingfors universitet = University of Helsinki-Aalto University-Helsingin yliopisto = Helsingfors universitet = University of Helsinki-Aalto University, DFINITY Foundation [Zurich], Équipe Tolérance aux fautes et Sûreté de Fonctionnement informatique (LAAS-TSF), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Aalto University-University of Helsinki-Aalto University-University of Helsinki, Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, and TREDAN, Gilles

Subjects
Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Distributed, Parallel, and Cluster Computing (cs.DC)
Abstract

In order to provide a high resilience and to react quickly to link failures, modern computer networks support fully decentralized flow rerouting, also known as local fast failover. In a nutshell, the task of a local fast failover algorithm is to pre-define fast failover rules for each node using locally available information only. These rules determine for each incoming link from which a packet may arrive and the set of local link failures (i.e., the failed links incident to a node), on which outgoing link a packet should be forwarded. Ideally, such a local fast failover algorithm provides a perfect resilience deterministically: a packet emitted from any source can reach any target, as long as the underlying network remains connected. Feigenbaum et al. (ACM PODC 2012) and also Chiesa et al. (IEEE/ACM Trans. Netw. 2017) showed that it is not always possible to provide perfect resilience. Interestingly, not much more is known currently about the feasibility of perfect resilience. This paper revisits perfect resilience with local fast failover, both in a model where the source can and cannot be used for forwarding decisions. We first derive several fairly general impossibility results: By establishing a connection between graph minors and resilience, we prove that it is impossible to achieve perfect resilience on any non-planar graph; furthermore, while planarity is necessary, it is also not sufficient for perfect resilience. On the positive side, we show that graph families closed under link subdivision allow for simple and efficient failover algorithms which simply skip failed links. We demonstrate this technique by deriving perfect resilience for outerplanar graphs and related scenarios, as well as for scenarios where the source and target are topologically close after failures., Comment: To appear in the proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems (APOCS) 2021

Published
2021

54. Survey on Blockchain Networking: Context, State-of-the-Art, Challenges.

Author

DOTAN, MAYA, PIGNOLET, YVONNE-ANNE, SCHMID, STEFAN, TOCHNER, SAAR, and ZOHAR, AVIV

Subjects
*BLOCKCHAINS, *TELECOMMUNICATION systems, *CRYPTOCURRENCIES, *BITCOIN, *SOCIAL networks, *COMPUTER network security, *COMMUNITY support
Abstract

Blockchains, in general, and cryptocurrencies such as Bitcoin, in particular, are realized using distributed systems and hence critically rely on the performance and security of the interconnecting network. The requirements on these networks and their usage, however, can differ significantly from traditional communication networks, with implications on all layers of the protocol stack. This article is motivated by these differences and, in particular, by the observation that many fundamental design aspects of these networks are not well-understood today. To support the networking community to contribute to this emerging application domain, we present a structured overview of the field, from topology and neighbor discovery, over block and transaction propagation, to sharding and off-chain networks, also reviewing existing empirical results from different measurement studies. In particular, for each of these domains, we provide the context, highlighting differences and commonalities with traditional networks, review the state-of-the-art, and identify open research challenges. Our article can hence also be seen as a call-to-arms to improve the foundation on top of which blockchains are built. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

59. Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology?

Author

Pignolet, Yvonne-Anne, Schmid, Stefan, Tredan, Gilles, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Aguilera, Marcos K., editor

Published
2012
Full Text
View/download PDF

60. Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally

Author

Foerster, Klaus-Tycho, Hirvonen, Juho, Pignolet, Yvonne-Anne, Schmid, Stefan, Tredan, Gilles, University of Vienna [Vienna], Aalto University, DFINITY Foundation [Zurich], Équipe Tolérance aux fautes et Sûreté de Fonctionnement informatique (LAAS-TSF), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Attiya, Hagit, University of Vienna, Professorship Suomela J., DFINITY, Centre National de la Recherche Scientifique (CNRS), Department of Computer Science, and Aalto-yliopisto

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 2012 ACM Subject Classification Networks → Routing protocols, Resilience, Theory of computation → Distributed algorithms phrases Resilience, Computer systems organization → Dependable and fault-tolerant systems and networks, Theory of computation → Distributed algorithms, Networks → Routing protocols, Local Failover
Abstract

In order to provide a high resilience and to react quickly to link failures, modern computer networks support fully decentralized flow rerouting, also known as local fast failover. In a nutshell, the task of a local fast failover algorithm is to pre-define fast failover rules for each node using locally available information only. Ideally, such a local fast failover algorithm provides a perfect resilience deterministically: a packet emitted from any source can reach any target, as long as the underlying network remains connected. Feigenbaum et al. showed [Feigenbaum and others, 2012] that it is not always possible to provide perfect resilience; on the positive side, the authors also presented an efficient algorithm which achieves at least 1-resilience, tolerating a single failure in any network. Interestingly, not much more is known currently about the feasibility of perfect resilience. This brief announcement revisits perfect resilience with local fast failover, both in a model where the source can and cannot be used for forwarding decisions. By establishing a connection between graph minors and resilience, we prove that it is impossible to achieve perfect resilience on any non-planar graph; On the positive side, we can derive perfect resilience for outerplanar and some planar graphs., LIPIcs, Vol. 179, 34th International Symposium on Distributed Computing (DISC 2020), pages 46:1-46:3

Published
2020

61. Implications of Routing Coherence and Consistency on Network Optimization

Author

Pignolet, Yvonne-Anne, Schmid, Stefan, Trédan, Gilles, Dfinity Switzerland, University of Vienna [Vienna], Équipe Tolérance aux fautes et Sûreté de Fonctionnement informatique (LAAS-TSF), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), and TREDAN, Gilles

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
Abstract

International audience; In network optimization problems, from traffic engineering to network monitoring, the routing model is typically considered as something given and fixed. This paper is motivated by the fundamental question how the ability to change and optimize the routing model itself influences the efficiency at which communication networks can be operated. To this end, we identify two main dimensions of the routing model: consistency (of a single route) and coherence (of sets of routes). We present analytical results on the impact of the routing model on the achievable route diversity as well as on the runtime of solving optimization problems underlying different case studies. We also uncover that it can sometimes be beneficial to artificially restrict the routing model, to significantly reduce the computational complexity without negatively affecting the route diversity much.

Published
2020

67. SOK

Author

Dotan, Maya, primary, Pignolet, Yvonne-Anne, additional, Schmid, Stefan, additional, Tochner, Saar, additional, and Zohar, Aviv, additional

Published
2020
Full Text
View/download PDF

68. Online Payments by Merely Broadcasting Messages

Author

Collins, Daniel, primary, Guerraoui, Rachid, additional, Komatovic, Jovan, additional, Kuznetsov, Petr, additional, Monti, Matteo, additional, Pavlovic, Matej, additional, Pignolet, Yvonne-Anne, additional, Seredinschi, Dragos-Adrian, additional, Tonkikh, Andrei, additional, and Xygkis, Athanasios, additional

Published
2020
Full Text
View/download PDF

95. Algorithms for Wireless Communication (Dagstuhl Seminar 14051)

Author

Even, Guy, Halldorson, Magnus, Pignolet, Yvonne Anne, and Scheideler, Christian

Subjects
000 Computer science, knowledge, general works, Computer Science
Abstract

This report documents the talks and discussions of Dagstuhl Seminar 14051 "Algorithms for Wireless Communication". The presented talks represent a wide spectrum of work on wireless networks. The topic of wireless communication continues to grow in many domains, new applications and deployments of wireless networks in a variety of contexts are being reported. A key focus of the talks and discussions presented here is to discuss models for wireless networks as well as algorithmic results and real world deployments.

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results