Name
Abstract | ||
|---|---|---|
The Border Gateway Protocol (BGP) computes routes between the organizational networks that make up today's Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the leakage of sensitive information about domains' routing preferences. To overcome some of these problems, we revisit the idea of centralizing and using secure multi-party computation (MPC) for interdomain routing which was proposed by Gupta et al. ({ACM} HotNets'12). We implement two algorithms for interdomain routing with state-of-the-art MPC protocols. On an empirically derived dataset that approximates the topology of today's Internet (55809 nodes), our protocols take as little as 6s of topology-independent precomputation and only 3 s of online time. We show, moreover, that when our MPC approach is applied at country/region-level scale, runtimes can be as low as 0.17 s online time and 0.20 s pre-computation time. Our results motivate the MPC approach for interdomain routing and furthermore demonstrate that current MPC techniques are capable of efficiently tackling real-world problems at a large scale. |
Year | DOI | DocType |
|---|---|---|
2017 | 10.1515/popets-2017-0033 | Journal |
Volume | Issue | Citations |
2017 | 3 | 8 |
PageRank | References | Authors |
0.44 | 2 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilad Asharov | 1 | 414 | 23.31 |
| Daniel Demmler | 2 | 128 | 7.16 |
| Michael Schapira | 3 | 1122 | 79.89 |
| Thomas Schneider | 4 | 1540 | 69.17 |
| Gil Segev | 5 | 1335 | 51.71 |
| Scott Shenker | 6 | 29892 | 2677.04 |
| Michael Zohner | 7 | 409 | 13.44 |