NavTalks

From Navigators

(Difference between revisions)
Jump to: navigation, search
Line 6: Line 6:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>September 2018</strong></h2>
<h2><strong>September 2018</strong></h2>
-
<table border="0.5" cellspacing="0" style="background:#89B085">
+
<table border="0.5" cellspacing="0" style="background:#89B085">
-
<tr>
+
<tr>
             <td style="width:100px">20 September</td>
             <td style="width:100px">20 September</td>
             <td style="width:200px">Alysson Bessani</td>  
             <td style="width:200px">Alysson Bessani</td>  
Line 13: Line 13:
SMaRtChain: A Principled Design for a New Generation of Blockchains</span></td>  
SMaRtChain: A Principled Design for a New Generation of Blockchains</span></td>  
             <td style="width:30px">&nbsp;</td>
             <td style="width:30px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
             <td style="width:10%">20 September</td>
+
             <td style="width:100px">20 September</td>
-
             <td style="width:30%">Rui Miguel</td>
+
             <td style="width:200px">Rui Miguel</td>
-
             <td style="width:50%"><span style="border-bottom: dashed 1px #000" title="The Internet today is mainly used for distributing content, in a fundamental departure from its original goal of enabling communication between endpoints. As a response to this change, Named Data Networking (NDN) is a new architecture rooted on the concept of naming data, in contrast to the original paradigm based on naming hosts. This radical architectural shift results in packet processing in NDN to differ substantially from IP. As a consequence, current network equipment cannot be seamlessly extended to offer NDN data-plane functions. To address this challenge, available NDN router solutions are usually software-based, and even the highly-optimised designs tailored to specific hardware platforms present limited performance, hindering adoption. In addition, these tailor-made solutions are hardly reusable in research and production networks. The emergence of programmable switching chips and of languages to program them, like P4, brings hope for the state of affairs to change. In this presentation, we present the design of an NDN router written in P4. We improve over the state-of-the-art solution by extending the NDN functionality, and by addressing its scalability limitations. A preliminary evaluation of our open-source solution running on a software target demonstrates its feasibility.">
+
             <td style="width:600px"><span style="border-bottom: dashed 1px #000" title="The Internet today is mainly used for distributing content, in a fundamental departure from its original goal of enabling communication between endpoints. As a response to this change, Named Data Networking (NDN) is a new architecture rooted on the concept of naming data, in contrast to the original paradigm based on naming hosts. This radical architectural shift results in packet processing in NDN to differ substantially from IP. As a consequence, current network equipment cannot be seamlessly extended to offer NDN data-plane functions. To address this challenge, available NDN router solutions are usually software-based, and even the highly-optimised designs tailored to specific hardware platforms present limited performance, hindering adoption. In addition, these tailor-made solutions are hardly reusable in research and production networks. The emergence of programmable switching chips and of languages to program them, like P4, brings hope for the state of affairs to change. In this presentation, we present the design of an NDN router written in P4. We improve over the state-of-the-art solution by extending the NDN functionality, and by addressing its scalability limitations. A preliminary evaluation of our open-source solution running on a software target demonstrates its feasibility.">
Named Data Networking with Programmable Switches</span></td>
Named Data Networking with Programmable Switches</span></td>
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
         </tr>
         </tr>
</table>
</table>
Line 26: Line 26:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>October 2018</strong></h2>
<h2><strong>October 2018</strong></h2>
-
<table border="0.5" cellspacing="0" style="width:800px" style="background:#89B085">
+
<table border="0.5" cellspacing="0" style="background:#89B085">
-
<tr>
+
<tr>
-
             <td style="width:10%">4 October</td>
+
             <td style="width:100px">4 October</td>
-
             <td style="width:30%">Bruno Vavala (Research Scientist in Intel Labs) </td>  
+
             <td style="width:200px">Bruno Vavala (Research Scientist in Intel Labs) </td>  
-
             <td style="width:50%"><span style="border-bottom: dashed 1px #000" title="I will present Private Data Objects (PDOs), a technology that enables mutually untrusted parties to run smart contracts over private data. PDOs result from the integration of a distributed ledger and Intel Software Guard Extensions (SGX). In particular, contracts run off-ledger in secure enclaves using Intel SGX, which preserves data confidentiality, execution integrity and enforces data access policies (as opposed to raw data access). A distributed ledger verifies and records transactions produced by PDOs, in order to provide a single authoritative instance of such objects. This allows contracting parties to retrieve and check data related to contract and enclave instances, as well as to serialize and commit contract state updates. The design and the development of PDOs is an ongoing research effort, and open source code is available and hosted by Hyperledger Labs (Linux Foundation).">Private Data Objects</span></td>  
+
             <td style="width:600px"><span style="border-bottom: dashed 1px #000" title="I will present Private Data Objects (PDOs), a technology that enables mutually untrusted parties to run smart contracts over private data. PDOs result from the integration of a distributed ledger and Intel Software Guard Extensions (SGX). In particular, contracts run off-ledger in secure enclaves using Intel SGX, which preserves data confidentiality, execution integrity and enforces data access policies (as opposed to raw data access). A distributed ledger verifies and records transactions produced by PDOs, in order to provide a single authoritative instance of such objects. This allows contracting parties to retrieve and check data related to contract and enclave instances, as well as to serialize and commit contract state updates. The design and the development of PDOs is an ongoing research effort, and open source code is available and hosted by Hyperledger Labs (Linux Foundation).">Private Data Objects</span></td>  
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
             <td style="width:10%">4 October</td>
+
             <td style="width:100px">4 October</td>
-
             <td style="width:30%">Marcus Völp (Research Scientist, CritiX, SnT, Univ. of Luxembourg) </td>
+
             <td style="width:200px">Marcus Völp (Research Scientist, CritiX, SnT, Univ. of Luxembourg) </td>
-
             <td style="width:50%"><span style="border-bottom: dashed 1px #000" title="As you are well aware, many practical concerns in systems aiming at Byzantine fault and intrusion tolerance require reaching consensus in difficult situations. For example, to remain exhaustion safe, replacing permanently damaged replicas requires relocating the replicated functionality to a fresh set of spares, necessitating conensus on the new group of active replicas. While group membership protocols exists for this task, we are also aware of their limitations (faults in the adaptation infrastructure (recurring the problem in the servers implementing it), operation modes that cannot reach consensus (aka Cheap / ReBFT minimal mode), etc.) that make it extremely difficult (if not impossible) to perform these reconfigurations in a reliable manner. In this talk, I would like to give you an overview over some of the current (unsolved) research problems we work on in CritiX and which I would like to discuss with you while here. I would like to share my view on our hinge that in some of the above settings, there is still hidden an impossibility result, possibly rendering CheapBFT (or at least generalizations of it to arbitrary quorums) incorrect, but motivating a novel design principle, which we call reflective consensus: Rather than solving the difficult, but naturally arising consensus problem (e.g., consensus on group membership in case of exhaustion failure due to an increasing threat level), we reflect consensus to the same set of replicas where it will occur, but in a simpler version that is possibly even executed at a different time (e.g., proactively when the system is not yet exhaustion failed).">
+
             <td style="width:600px"><span style="border-bottom: dashed 1px #000" title="As you are well aware, many practical concerns in systems aiming at Byzantine fault and intrusion tolerance require reaching consensus in difficult situations. For example, to remain exhaustion safe, replacing permanently damaged replicas requires relocating the replicated functionality to a fresh set of spares, necessitating conensus on the new group of active replicas. While group membership protocols exists for this task, we are also aware of their limitations (faults in the adaptation infrastructure (recurring the problem in the servers implementing it), operation modes that cannot reach consensus (aka Cheap / ReBFT minimal mode), etc.) that make it extremely difficult (if not impossible) to perform these reconfigurations in a reliable manner. In this talk, I would like to give you an overview over some of the current (unsolved) research problems we work on in CritiX and which I would like to discuss with you while here. I would like to share my view on our hinge that in some of the above settings, there is still hidden an impossibility result, possibly rendering CheapBFT (or at least generalizations of it to arbitrary quorums) incorrect, but motivating a novel design principle, which we call reflective consensus: Rather than solving the difficult, but naturally arising consensus problem (e.g., consensus on group membership in case of exhaustion failure due to an increasing threat level), we reflect consensus to the same set of replicas where it will occur, but in a simpler version that is possibly even executed at a different time (e.g., proactively when the system is not yet exhaustion failed).">
Reflective Consensus</span></td>
Reflective Consensus</span></td>
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
         </tr>
         </tr>
-
<tr>
+
<tr>
-
             <td style="width:10%">18 October</td>
+
             <td style="width:100px">18 October</td>
-
             <td style="width:30%">Yair Amir (Professor, Johns Hopkins University) </td>
+
             <td style="width:200px">Yair Amir (Professor, Johns Hopkins University) </td>
-
             <td style="width:50%"><span style="border-bottom: dashed 1px #000" title="Emerging applications such as remote manipulation, collaborative virtual reality, or remote robotic surgery require communication that is both timely and reliable, but the Internet natively supports only communication that is either completely reliable with no timeliness guarantees (e.g. TCP) or timely with only best-effort reliability (e.g. UDP). We present an overlay transport service that can provide highly reliable communication while meeting stringent timeliness guarantees (e.g. 130ms round-trip latency across the US) over the Internet.
+
             <td style="width:600px"><span style="border-bottom: dashed 1px #000" title="Emerging applications such as remote manipulation, collaborative virtual reality, or remote robotic surgery require communication that is both timely and reliable, but the Internet natively supports only communication that is either completely reliable with no timeliness guarantees (e.g. TCP) or timely with only best-effort reliability (e.g. UDP). We present an overlay transport service that can provide highly reliable communication while meeting stringent timeliness guarantees (e.g. 130ms round-trip latency across the US) over the Internet.
To enable routing schemes that can support the necessary timeliness and reliability, we introduce dissemination graphs, providing a unified framework for specifying routing schemes ranging from a single path, to multiple disjoint paths, to arbitrary graphs. Based on an extensive analysis of real-world network data, we develop a timely dissemination-graph-based routing method that can add targeted redundancy in problematic areas of the network. We show that this approach can cover close to 99% of the performance gap between a traditional single-path approach and an optimal (but prohibitively expensive) scheme.">
To enable routing schemes that can support the necessary timeliness and reliability, we introduce dissemination graphs, providing a unified framework for specifying routing schemes ranging from a single path, to multiple disjoint paths, to arbitrary graphs. Based on an extensive analysis of real-world network data, we develop a timely dissemination-graph-based routing method that can add targeted redundancy in problematic areas of the network. We show that this approach can cover close to 99% of the performance gap between a traditional single-path approach and an optimal (but prohibitively expensive) scheme.">
Timely, Reliable, and Cost-Effective Internet Transport Service using Structured Overlay Networks</span></td>
Timely, Reliable, and Cost-Effective Internet Transport Service using Structured Overlay Networks</span></td>
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
         </tr>
         </tr>
</table>
</table>
Line 54: Line 54:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>November 2018</strong></h2>
<h2><strong>November 2018</strong></h2>
-
<table border="0.5" cellspacing="0" style="width:800px" style="background:#89B085">
+
<table border="0.5" cellspacing="0" style="background:#89B085">
<tr>
<tr>
-
             <td style="width:10%">13/11</td>
+
             <td style="width:100px">13/11</td>
-
             <td style="width:30%">Salvatore Signorello</td>
+
             <td style="width:200px">Salvatore Signorello</td>
-
             <td style="width:50%"><span style="border-bottom: dashed 1px #000" title="Today's Internet dominant usage trends motivate research on more content-oriented future network architectures. Among the future Internet proposals, the Information-Centric Networking (ICN) research paradigm aims to redesign the Internet's core protocols focusing on contents rather than on hosts. Among the ICN architectures, the Named-Data Networking (NDN) forwards and records users' content requests by their names in routers along the path from one consumer to 1-or-many content sources. The Pending Interest Table (PIT) is the NDN's router component which temporarily records forwarded requests. On one hand, the state in the PIT enables properties like requests aggregation, multicast responses delivery and native hop-by-hop control flow. On the other hand, the PIT stateful forwarding behavior can be easily abused by malicious users to mount disruptive distributed denial of service attacks (DDoS), named Interest Flooding Attacks (IFAs). In IFAs, loosely coordinated botnets flood the network with a large amount of hard-to-satisfy requests with the aim to overload both the network infrastructure and the content producers. In this talk I will summarize the state of the art on the design of countermeasures against the IFA, an NDN-specific security threat to which I devoted much of my PhD research. First, I will introduce existing defense mechanisms and main flaws in the mainstream approach to the defense against this attack. Secondly, I will present some other techniques I propose to counteract certain IFAs, whose design has not been completed yet. Finally, I will share a few more research directions that can be pursued to design more robust forwarding planes for a certain class of ICNs.">
+
             <td style="width:600px"><span style="border-bottom: dashed 1px #000" title="Today's Internet dominant usage trends motivate research on more content-oriented future network architectures. Among the future Internet proposals, the Information-Centric Networking (ICN) research paradigm aims to redesign the Internet's core protocols focusing on contents rather than on hosts. Among the ICN architectures, the Named-Data Networking (NDN) forwards and records users' content requests by their names in routers along the path from one consumer to 1-or-many content sources. The Pending Interest Table (PIT) is the NDN's router component which temporarily records forwarded requests. On one hand, the state in the PIT enables properties like requests aggregation, multicast responses delivery and native hop-by-hop control flow. On the other hand, the PIT stateful forwarding behavior can be easily abused by malicious users to mount disruptive distributed denial of service attacks (DDoS), named Interest Flooding Attacks (IFAs). In IFAs, loosely coordinated botnets flood the network with a large amount of hard-to-satisfy requests with the aim to overload both the network infrastructure and the content producers. In this talk I will summarize the state of the art on the design of countermeasures against the IFA, an NDN-specific security threat to which I devoted much of my PhD research. First, I will introduce existing defense mechanisms and main flaws in the mainstream approach to the defense against this attack. Secondly, I will present some other techniques I propose to counteract certain IFAs, whose design has not been completed yet. Finally, I will share a few more research directions that can be pursued to design more robust forwarding planes for a certain class of ICNs.">
The Past, the Present and some Future of Interest Flooding Attacks in Named-Data Networking</span></td>
The Past, the Present and some Future of Interest Flooding Attacks in Named-Data Networking</span></td>
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
         </tr>
         </tr>
         <tr>
         <tr>
Line 76: Line 76:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>November 2018</strong></h2>
<h2><strong>November 2018</strong></h2>
-
<table border="0.5" cellspacing="0" style="width:800px">
+
<table border="0.5" cellspacing="0" >
<tr>
<tr>
             <td>27/11</td>
             <td>27/11</td>
Line 82: Line 82:
             <td>&nbsp;</td>
             <td>&nbsp;</td>
             <td>&nbsp;</td>
             <td>&nbsp;</td>
-
         </tr>
+
         </tr>
-
<tr>
+
<tr>
             <td>27/11</td>
             <td>27/11</td>
             <td>Ricardo Mendes</td>
             <td>Ricardo Mendes</td>
Line 94: Line 94:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>December 2018</strong></h2>
<h2><strong>December 2018</strong></h2>
-
<table border="0" cellspacing="0" style="width:100%">
+
<table border="0" cellspacing="0" >
         <tr>
         <tr>
-
             <td style="width:10%">11/12</td>
+
             <td style="width:100px">11/12</td>
-
             <td style="width:30%">Ant&oacute;nio Casimiro</td>
+
             <td style="width:200px">Ant&oacute;nio Casimiro</td>
-
             <td style="width:50%">&nbsp;</td>
+
             <td style="width:600px">&nbsp;</td>
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
         </tr>
         </tr>
-
<tr>
+
<tr>
-
<td>11/12</td><td>Carlos Nascimento</td>
+
<td>11/12</td><td>Carlos Nascimento</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
Line 112: Line 112:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>January 2019</strong></h2>
<h2><strong>January 2019</strong></h2>
-
<table border="0" cellspacing="0" style="width:100%">
+
<table border="0" cellspacing="0" >
-
<tr>
+
<tr>
-
             <td style="width:10%">15/01</td>
+
             <td style="width:100px">15/01</td>
-
             <td style="width:30%">Fernando Alves</td>
+
             <td style="width:200px">Fernando Alves</td>
-
             <td style="width:50%">&nbsp;</td>
+
             <td style="width:600px">&nbsp;</td>
-
             <td style="width:10%">&nbsp;</td>
+
             <td style="width:100px">&nbsp;</td>
         </tr>
         </tr>
-
<tr>
+
<tr>
-
<td>15/01</td>
+
<td>15/01</td>
-
<td>Ib&eacute;ria Medeiros</td>
+
<td>Ib&eacute;ria Medeiros</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>29/01</td>
+
<td>29/01</td>
-
<td>Fernando Ramos</td>
+
<td>Fernando Ramos</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>29/01</td>
+
<td>29/01</td>
-
<td>Miguel Garcia</td>
+
<td>Miguel Garcia</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
Line 142: Line 142:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>February 2019</strong></h2>
<h2><strong>February 2019</strong></h2>
-
<table border="0" cellspacing="0" style="width:100%">
+
<table border="0" cellspacing="0" >
-
<tr>
+
<tr>
-
<td style="width:10%">19/02</td>
+
<td style="width:100px">19/02</td>
-
<td style="width:30%">Ana Fidalgo</td>
+
<td style="width:200px">Ana Fidalgo</td>
-
<td style="width:50%">&nbsp;</td>
+
<td style="width:600px">&nbsp;</td>
-
<td style="width:10%">&nbsp;</td>
+
<td style="width:100px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>19/02</td> <td>Jo&atilde;o Sousa</td>
+
<td>19/02</td> <td>Jo&atilde;o Sousa</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
Line 159: Line 159:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>March 2019</strong></h2>
<h2><strong>March 2019</strong></h2>
-
<table border="0" cellspacing="0" style="width:100%">
+
<table border="0" cellspacing="0" >
-
<tr>
+
<tr>
-
<td style="width:10%">12/03</td>
+
<td style="width:100px">12/03</td>
-
<td style="width:30%">Pedro Gaspar</td>
+
<td style="width:200px">Pedro Gaspar</td>
-
<td style="width:50%">&nbsp;</td>
+
<td style="width:600px">&nbsp;</td>
-
<td style="width:10%">&nbsp;</td>
+
<td style="width:100px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>12/03</td> <td>Ricardo Morgado</td>
+
<td>12/03</td> <td>Ricardo Morgado</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>26/03</td> <td>Andr&eacute; Oliveira</td>
+
<td>26/03</td> <td>Andr&eacute; Oliveira</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>26/03</td> <td>Nuno Dion&iacute;sio</td>
+
<td>26/03</td> <td>Nuno Dion&iacute;sio</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
Line 186: Line 186:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>April 2019</strong></h2>
<h2><strong>April 2019</strong></h2>
-
<table border="0" cellspacing="0" style="width:100%">
+
<table border="0" cellspacing="0" >
-
<tr>
+
<tr>
-
<td style="width:10%">09/04</td>
+
<td style="width:100px">09/04</td>
-
<td style="width:30%">Adriano Serckumecka</td>
+
<td style="width:200px">Adriano Serckumecka</td>
-
<td style="width:50%">&nbsp;</td>
+
<td style="width:600px">&nbsp;</td>
-
<td style="width:10%">&nbsp;</td>
+
<td style="width:100px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>09/04</td> <td>Tulio Ribeiro</td>
+
<td>09/04</td> <td>Tulio Ribeiro</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>30/04</td> <td>Miguel Moreira</td>
+
<td>30/04</td> <td>Miguel Moreira</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>30/04</td> <td>Pedro Ferreira</td>
+
<td>30/04</td> <td>Pedro Ferreira</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
Line 213: Line 213:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>May 2019</strong></h2>
<h2><strong>May 2019</strong></h2>
-
<table border="0" cellspacing="0" style="width:100%">
+
<table border="0" cellspacing="0" >
-
<tr>
+
<tr>
-
<td style="width:10%">14/05</td>
+
<td style="width:100px">14/05</td>
-
<td style="width:30%">Diogo Gon&ccedil;alves</td>
+
<td style="width:200px">Diogo Gon&ccedil;alves</td>
-
<td style="width:50%">&nbsp;</td>
+
<td style="width:600px">&nbsp;</td>
-
<td style="width:10%">&nbsp;</td>
+
<td style="width:100px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>14/05</td> <td>Vinicius Cogo</td>
+
<td>14/05</td> <td>Vinicius Cogo</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>28/05</td> <td>Francisco Ara&uacute;jo</td>
+
<td>28/05</td> <td>Francisco Ara&uacute;jo</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>28/05</td> <td>Miguel Matos</td>
+
<td>28/05</td> <td>Miguel Matos</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
Line 240: Line 240:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>June 2019</strong></h2>
<h2><strong>June 2019</strong></h2>
-
<table border=0 cellspacing=0  style="width:100%">
+
<table border=0 cellspacing=0  >
-
<tr>
+
<tr>
-
<td style="width:10%">11/06</td>
+
<td style="width:100px">11/06</td>
-
<td style="width:30%">Eric Vial</td>
+
<td style="width:200px">Eric Vial</td>
-
<td style="width:50%">&nbsp;</td>
+
<td style="width:600px">&nbsp;</td>
-
<td style="width:10%">&nbsp;</td>
+
<td style="width:100px">&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>11/06</td>
+
<td>11/06</td>
-
<td>Robin Vassantlal</td>
+
<td>Robin Vassantlal</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>25/06</td>
+
<td>25/06</td>
-
<td>Jo&atilde;o Pinto</td>
+
<td>Jo&atilde;o Pinto</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>25/06</td>
+
<td>25/06</td>
-
<td>Tiago Correia</td>
+
<td>Tiago Correia</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
<td>&nbsp;</td>
+
<td>&nbsp;</td>
-
</tr>
+
</tr>
</table>
</table>
Line 271: Line 271:
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<div style="background:#FFFFFF; border:1px solid #FFFFFF; padding:5px 10px">
<h2><strong>Not Scheduled</strong></h2>
<h2><strong>Not Scheduled</strong></h2>
-
<table border=1 background=#DA4848 style="width:20%">
+
<table border=1 background=#DA4848 style="width:20%">
-
<tr>
+
<tr>
-
<td>Bruno Louren&ccedil;o</td>
+
<td>Bruno Louren&ccedil;o</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Bruno Nunes</td>
+
<td>Bruno Nunes</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Cl&aacute;udio Martins</td>
+
<td>Cl&aacute;udio Martins</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Diogo Edgar Sousa</td>
+
<td>Diogo Edgar Sousa</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Gon&ccedil;alo Jesus</td>
+
<td>Gon&ccedil;alo Jesus</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Hugo Amieira</td>
+
<td>Hugo Amieira</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Jo&atilde;o Paulino</td>
+
<td>Jo&atilde;o Paulino</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Lu&iacute;z Marques</td>
+
<td>Lu&iacute;z Marques</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Paulo Antunes</td>
+
<td>Paulo Antunes</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Pedro Alves</td>
+
<td>Pedro Alves</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Rui Azevedo</td>
+
<td>Rui Azevedo</td>
-
</tr>
+
</tr>
-
<tr>
+
<tr>
-
<td>Tom&aacute;s Peixinho</td>
+
<td>Tom&aacute;s Peixinho</td>
-
</tr>
+
</tr>
</table>
</table>
</div>
</div>
-->
-->

Revision as of 11:37, 13 November 2018

The Navtalks is a series of informal talks given by Navigators members or some special guests about every two-weeks at Ciências, ULisboa.

Leave mouse over title's presentation to read the abstract.

Contents

September 2018

20 September Alysson Bessani SMaRtChain: A Principled Design for a New Generation of Blockchains  
20 September Rui Miguel Named Data Networking with Programmable Switches  

October 2018

4 October Bruno Vavala (Research Scientist in Intel Labs) Private Data Objects  
4 October Marcus Völp (Research Scientist, CritiX, SnT, Univ. of Luxembourg) Reflective Consensus  
18 October Yair Amir (Professor, Johns Hopkins University) Timely, Reliable, and Cost-Effective Internet Transport Service using Structured Overlay Networks  

November 2018

13/11 Salvatore Signorello The Past, the Present and some Future of Interest Flooding Attacks in Named-Data Networking  
13/11 Tiago Oliveira Vawlt - Privacy-Centered Cloud Storage  

November 2018

27/11 Nuno Neves    
27/11 Ricardo Mendes    

December 2018

11/12 António Casimiro    
11/12Carlos Nascimento      

January 2019

15/01 Fernando Alves    
15/01 Ibéria Medeiros    
29/01 Fernando Ramos    
29/01 Miguel Garcia    

February 2019

19/02 Ana Fidalgo    
19/02 João Sousa    

March 2019

12/03 Pedro Gaspar    
12/03 Ricardo Morgado    
26/03 André Oliveira    
26/03 Nuno Dionísio    

April 2019

09/04 Adriano Serckumecka    
09/04 Tulio Ribeiro    
30/04 Miguel Moreira    
30/04 Pedro Ferreira    

May 2019

14/05 Diogo Gonçalves    
14/05 Vinicius Cogo    
28/05 Francisco Araújo    
28/05 Miguel Matos    

June 2019

11/06 Eric Vial    
11/06 Robin Vassantlal    
25/06 João Pinto    
25/06 Tiago Correia    
Personal tools
Navigators toolbox