PPT-Efficient Network Reachability Analysis using a Succinct Control Plane Representation

a Succinct Control Plane Representation Seyed K Fayaz Creativity Once again analogy after reading Batfish and HSA header space control space Asked Vyas Sekar at Seyed. Grigore. . Rosu. and Andrei . Stefanescu. University of Illinois, USA. Operational Semantics. Operational Semantics. Easy to define and understand. Can be regarded as formal “implementations”. Require little mathematical knowledge. through . Path Decompositions . Roberto . Grossi. Giuseppe . Ottaviano*. Università. di Pisa. * Part of the work done while at Microsoft Research Cambridge. t. three. trial. triangle. trie. triple. The Internet. Data Plane. Control Plane. Autonomous Systems. Core . ASes. Fringe . ASes. Transit . ASes. Border Gateway Protocol. Connects Different . ASes. Defines Route Selection. Updates. Performance of BGP. Yoav Artzi. Amit. Levy. CSE 510: HCI. Spring 2010. Project final presentation. Instance Based Network Representation. Community detection. Representing instances detection. Graph representation. *This may or may not really happened. Ganesh Gopalakrishnan. . With acknowledgements to his students and colleagues, especially Mike Kirby !. . http://. www.cs.utah.edu. /fv. University of Utah. Formal Methods. Disappear. We are in a complex world of digital designs. vine rst second Representation Heads Modiers Representation Heads Modiers Representation Heads Modiers Representation Heads Modiers First-OrderFeatureCalculation ArcLengthByPart-of-Speech ArcLeng The Internet. Data Plane. Control Plane. Autonomous Systems. Core . ASes. Fringe . ASes. Transit . ASes. Border Gateway Protocol. Connects Different . ASes. Defines Route Selection. Updates. Performance of BGP. Robert Nishihara. Data store tradeoffs. Queries on values are tricky. Low latency, high throughput. Build an index. Memory efficiency. Just store data in memory. Succinct. Achieves low latency and memory efficiency. Grigore . Rosu. , Andrei . Stefanescu. , Brandon Moore. University of Illinois at . Urbana-Champaign, USA. Stefan . Ciobaca. University . Alexadru. . Ioa. n. . Cuza. , Romania. Long-Standing Dream. Andrei Stefanescu. 1. , . Stefan Ciobaca. 2. ,. . Radu. Mereuta. 1,2. ,. Brandon Moore. 1. , . Traian. Serbanuta. 3. , . Grigore. Rosu. 1. 1 . University . of Illinois, . USA. 2 . University of Iasi, Romania. Tomas D. . Latoza. Brad . A.Myers. Summery By. Maryam Arab, Feb2017. Reachability Questions. As developers build their mental model of the code. Ask questions, read code, use design knowledge, talk to teammates. Prepared by:. Ward Ching, Vice President, Risk Management Operations, Safeway, Inc.. Loren Nickel, FCAS, CFA, MAAA, Regional Director and Actuary, Aon Global Risk Consulting. RIMS Session ERM009. Router/Switch Architecture Overview. Generalization of IP Router and Ethernet Switch Data Plane Operations. “match-action” forwarding abstraction. Openflow. and Software-Defined . N. etworking (SDN). Origin & background. Algorithm & complexity. Applications. Beyond CFL-reachability. Datalog. WPDS, NWA. Graph reachability. Dyck. -reach. LCL-reach. InterDyck. -reach. Future Directions. Theoretical developments.