Statistics
| Branch: | Revision:

iof-website / index.md @ b0593369

History | View | Annotate | Download (2.74 KB)

1
---
2
layout: default
3
title: IoF - Internet on FIRE
4
---
5

    
6
<div id="home">
7
<h1>IoF - Internet on FIRE</h1>
8

    
9
The goal of the project (funded by the [Fed4FIRE+ Open Call 5](https://www.fed4fire.eu/event/5th-fed4fire-open-call-experiments/)) is to extend the concepts of "[Pop-Routing](https://ans.disi.unitn.it/users/maccari/assets/files/bibliography/Maccari2016Pop.pdf)" to the Border Gateway Protocl (BGP), the Internet routing protocol, to improve its performance in terms of convergence.
10
Pop-Routing automatically tunes the frequency of the protocol messages to guarantee the optimal trade-off between overhead and convergence speed. In Infocom 2018 we presented the first fully distributed, exact algorithm to compute centrality using Bellman-Ford (BF): Pop-Routing can now be ported to Distance/Path-Vector protocols.
11

    
12
BGP, the only Inter-AS (Autonomous System) protocol of the Internet, is the glue that binds pieces of the Internet and keeps global communications in tune. BGP has a slow convergence: two configuration parameters (timers) have a high impact on BGP convergence speed, but there is no consensus on how to change their default value to a better one. Our distributed centrality computation can effectively be used in BGP, as we have recently shown in [this thesis](http://disi.unitn.it/locigno/preprints/Milani_Mattia_laurea_2017_2018.pdf). To prove that the convergence of Internet can be speed-up exploiting Pop-Routing, we need to test the distributed centrality computation on the BGP extension supporting Pop-Routing and measure the actual speed-up on a real implementation on sufficiently large topologies.
13

    
14
To achieve this goal Internet on FIRE will pursue three goals, corresponding to three Work Packages:
15
 * Finalise, implement and test the distributed centrality computation of Pop-Routing on the BIRD daemon, the most popular open source implementation of BGP;
16
 * Perform emulations of large-scale networks (hundreds of nodes, more than one node can be set on one device of the testbeds) to verify the convergence properties of the distributed centrality computation;
17
 * Devise a strategy to optimize BGP parameters using Pop-Routing and testing it on the test-bed.
18

    
19
<h2>Team</h2>
20

    
21
The project is carried out in a cooperation between the DISI (University of Trento) and the DAIS (Ca' Foscari University of Venice) departments.
22
The team is composed by six people.
23

    
24
University of Trento Team:
25
 * **Project Manager:** [Prof. Renato Lo Cigno](https://disi.unitn.it/locigno)
26
 * **Lead Developer:** [Dr. Michele Segata](https://ans.disi.unitn.it/segata)
27
 * **Junior Developers:** [Lorenzo Ghiro](https://ans.disi.unitn.it/ghiro), Mattia Milani, Marco Nesler
28

    
29
University of Venice Team:
30
 * **Technical Project Manager:** [Prof. Leonardo Maccari](http://www.dais.unive.it/~maccari/)
31

    
32
</div>