Scalable verification of border gateway protocol configurations with an SMT solver

Weitz, Konstantin; Woos, Doug; Torlak, Emina; Ernst, M.; Krishnamurthy, Arvind; Tatlock, Zachary

doi:10.1145/2983990.2984012

Cited by 41 publications

(22 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Sementara hasil penelitian [5] menggarisbawahi pentingnya mekanisme kebijakan routing untuk mengatasi permasalahan implementasi BGP bagi ISP. Selanjutnya penelitian [13] menunjukkan bahwa BGP bersifat scalable, artinya implementasi dapat dikembangkan dari skala kecil ke skala besar.…”

Section: Diskusiunclassified

Peningkatan Kinerja Jaringan Komputer dengan Border Gateway Protocol (BGP) dan Dynamic Routing (Studi Kasus PT Estiko Ramanda)

Ernawati¹,

Endrawan²

2018

khif

View full text Add to dashboard Cite

Routing dalam jaringan menjadi elemen utama karena merupakan proses pemilihan salah satu dari beberapa kemungkinan jalur pengiriman paket data dari alamat pengirim ke alamat tujuan. Protokol routing diperlukan untuk membentuk tabel routing berdasarkan informasi routing yang dipertukarkan setiap selang waktu tertentu sehingga pengalamatan pada paket data yang akan dikirim menjadi lebih jelas. Penelitian ini membangun dan mengkaji kinerja jaringan komputer (computer network performance) pada studi kasus di perusahaan yang bergerak di bidang jasa layanan internet, peningkatan kebutuhan jasa layanan internet menuntut adanya pengelolaan jaringan internal di perusahaan dalam upaya peningkatan kinerja jaringan komputer. Metode comparison testing digunakan dalam pengujian, parameter yang diuji adalah latency dan traceroute menggunakan dynamic routing Border Gateway Protocol (BGP). Hasil uji menunjukkan sistem jaringan komputer dengan BGP memiliki efisiensi jaringan yang tinggi dengan rata-rata latency 0 ms (82 ms tanpa BGP) dan traceroute (konten lokal) 4 hop (8 hop tanpa BGP), namun traceroute (konten non lokal) memiliki nilai persentase yang sama dikarenakan seluruh prefix non lokal harus diperoleh dari port backbone (port lama tanpa BGP).

show abstract

Section: Diskusiunclassified

Peningkatan Kinerja Jaringan Komputer dengan Border Gateway Protocol (BGP) dan Dynamic Routing (Studi Kasus PT Estiko Ramanda)

Ernawati¹,

Endrawan²

2018

khif

View full text Add to dashboard Cite

show abstract

“…Bagpipe is a solver-aided tool, written in Rosette, that enables ISPs to specify desirable properties of the ISP's BGP network, and automatically checks them for a given set of router configurations written in Cisco or Juniper configuration languages. This section describes our SpaceSearch-based, verified revision to the Bagpipe [Weitz et al 2016] prototype. This case study follows the same methodology as the overview: 1) We formally express the tool's specification, using a proof assistant.…”

Section: :21mentioning

confidence: 99%

“…Liveness properties, such as łthe ISP will eventually send an announcementž, cannot be checked by Bagpipe. Bagpipe's specification language is detailed in the original Bagpipe paper [Weitz et al 2016].…”

Section: :21mentioning

confidence: 99%

“…However, even solver-aided tools written in a solver-aided host language still require complex reductions, which are difficult to get right, as they typically depend on sophisticated domain knowledge [Kundu et al 2009;Sigurbjarnarson et al 2016a;Torlak et al 2010;Weitz et al 2016]. As existing solver-aided host languages do not support formal reasoning about the meaning of solver calls in terms of the tool's application domain, it is difficult to ensure that such reductions maintain the soundness of the tool.…”

Section: Introductionmentioning

confidence: 99%

“…Second, we used SpaceSearch to revise and verify a Bagpipe prototype [Weitz et al 2016]. Bagpipe is a solver-aided tool written in Rosette that checks Border Gateway Protocol (BGP) configurations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

SpaceSearch: a library for building and verifying solver-aided tools

Weitz

Lyubomirsky

Heule

et al. 2017

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

Many verification tools build on automated solvers. These tools reduce problems in a specific application domain (e.g., compiler optimization validation) to queries that can be discharged with a highly optimized solver. But the correctness of the reductions themselves is rarely verified in practice, limiting the confidence that the solver's output establishes the desired domain-level property. This paper presents SpaceSearch, a new library for developing solver-aided tools within a proof assistant. A user builds their solver-aided tool in Coq against the SpaceSearch interface, and the user then verifies that the results provided by the interface are sufficient to establish the tool's desired high-level properties. Once verified, the tool can be extracted to an implementation in a solver-aided language (e.g., Rosette), where SpaceSearch provides an efficient instantiation of the SpaceSearch interface with calls to an underlying SMT solver. This combines the strong correctness guarantees of developing a tool in a proof assistant with the high performance of modern SMT solvers. This paper also introduces new optimizations for such verified solver-aided tools, including parallelization and incrementalization. We evaluate SpaceSearch by building and verifying two solver-aided tools. The first, SaltShaker, checks that RockSalt's x86 semantics agrees with STOKE's x86 semantics for a given instruction instantiation. When run on 15,255 instruction instantiations, SaltShaker identified 7 bugs in RockSalt and 1 bug in STOKE. After these systems were patched by their developers, SaltShaker verified the semantics' agreement on these instruction instantiations in under 2h. The second tool is a verified version of Bagpipe, a Border Gateway Protocol (BGP) router configuration checker. Like the previous, unverified, version, our new Bagpipe implementation scales to checking industrial configurations spanning over 240 KLOC, identifying 19 configuration inconsistencies with no false positives. Furthermore, in the process of verifying Bagpipe, we identified and fixed 2 bugs from the unverified implementation. These results demonstrate that SpaceSearch is a practical approach to developing efficient, verified solver-aided tools.

show abstract

Fast BGP Simulation of Large Datacenters

Lopes

Rybalchenko

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Scalable verification of border gateway protocol configurations with an SMT solver

Cited by 41 publications

References 24 publications

Peningkatan Kinerja Jaringan Komputer dengan Border Gateway Protocol (BGP) dan Dynamic Routing (Studi Kasus PT Estiko Ramanda)

Peningkatan Kinerja Jaringan Komputer dengan Border Gateway Protocol (BGP) dan Dynamic Routing (Studi Kasus PT Estiko Ramanda)

SpaceSearch: a library for building and verifying solver-aided tools

Fast BGP Simulation of Large Datacenters

Contact Info

Product

Resources

About