<--- Back to Details
First PageDocument Content
Computing / Network architecture / Internet architecture / Internet / Internet protocols / Internet Standards / Routing protocols / Computer networking / Border Gateway Protocol / Router / Open Shortest Path First / Control plane
Date: 2016-09-29 17:15:42
Computing
Network architecture
Internet architecture
Internet
Internet protocols
Internet Standards
Routing protocols
Computer networking
Border Gateway Protocol
Router
Open Shortest Path First
Control plane

Scalable Verification of Border Gateway Protocol Configurations with an SMT Solver um e

Add to Reading List

Source URL: sandcat.cs.washington.edu

Download Document from Source Website

File Size: 447,34 KB

Share Document on Facebook

Similar Documents

1  Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

1 Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

DocID: 1xVAh - View Document

1  Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

1 Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

DocID: 1xUCT - View Document

Leveraging Router Programmability for Traffic Matrix Computation ⇤  Giacomo Balestra‡

Leveraging Router Programmability for Traffic Matrix Computation ⇤ Giacomo Balestra‡

DocID: 1xUmh - View Document

PDF Document

DocID: 1wULk - View Document

PDF Document

DocID: 1wgdG - View Document