Networked Systems. Boon Thau Loo. University of Pennsylvania. NSF ExCAPE Meeting 20 Aug 2013
|
|
- Brook Pearson
- 6 years ago
- Views:
Transcription
1 Networked Systems Boon Thau Loo University of Pennsylvania NSF ExCAPE Meeting 20 Aug 2013
2 Outline Summary (activities over past year) Research highlights Conclusion
3 Year 1 in Retrospect Original proposal focus: apply synthesis techniques in (1) Internet routing and (2) wireless network protocols Scope of work has expanded over the past year: From synthesizing protocol implementations to synthesizing policies and configurations Exciting new applications in Cloud computing and Softwaredefined Networking Common themes: Deal with management complexity in cloud and highly volatile networked environments Configurations need to be modified at runtime given changes in topologies, traffic flows, etc. Meeting optimization goals (e.g. SLAs) while not violating security or ISP business constraints
4 Main Participants Faculty: Rajeev Alur (Penn), Ras Bodik (UC Berkeley), Boon Thau Loo (Penn), George Pappas (Penn), Ufuk Topcu (Penn), Madhu Parthasarathy (UIUC) Postdoc: Alexander Gurney (Penn) Students: Behnaz Arzani (Penn), Shaon Barman (UC Berkeley), Sarah Chasins (UC Berkeley), Chen Chen (Penn), Salar Moarref (Penn), Anduo Wang (Penn -> UIUC), Shambwaditya Saha (UIUC), Yifei Yuan (Penn). Mode of communication/collaboration: Weekly small group meetings, larger group sync-ups, monthly webinar, Skype (Penn/India), qualifying exams (Yifei Yuan, Alur/Madhu/Loo), papers, demos.
5 Outline Summary (activities over past year) Three Research highlights Conclusion
6 #1: Routing Constraints and Traffic Disruptions Participants: Alex Gurney, Behnaz Arzani, Roch Guerin, Boon T. Loo Last year: we presented the Formally Safe Routing (FSR) toolkit -> automatically synthesize Internet routing policies that lead to convergence (i.e. safe) This year: two additional dimensions Traffic engineering, Incremental network repair SIGCOMM 12 demonstration and CoNEXT 13 submission Alex Gurney s 5 minute lunch talk
7 Routing Policy Routing policy often ends up being characterized in terms of preferences over paths path p should be better than path q I don t care to choose between p and q Universal language for supporting various business cases, operational concerns, and so on. Example abstraction: routing algebra (in original proposal), declarative networking programs
8 Traffic Engineering We have a network, represented as a (directed, weighted) graph. Routing will establish all-pairs shortest paths over this graph. We have a demand matrix of traffic volumes for each source and destination. The shortest-paths flow yields link loads (a traffic matrix). Our job: choose weights to minimize load.
9 Challenges and Initial Approaches Routing protocol must converge Minimize congestion network-wide These goals are potentially conflicting: Some choices of link weights (minimizing congestion) lead to convergence failure. How can we ensure convergence, while ensuring we get as close as possible to an optimal TE solution? Interactive repair: if convergence invariant fails (due to operator error or router failure), how to find a shortest sequence of repairs to minimize traffic impact? Is shortest sequence of repairs always better? Techniques we explore: Max-SMT formulation (Yices), embed path preferences inside existing TE optimization algorithms Evaluated on real network topologies on Emulab
10 #2: A Synthesis Approach Towards Automated Management of SDNs Participants: Anduo Wang, Solar Moarref, Ufuk Topcu, Boon Thau Loo, Andre Scedrov Software-defined networking: Centralized controller (programmable in software) Switches can be dynamically programmed: Flow table entries <pattern, action> Used in network virtualization in data centers Traffic isolation, dynamic load balancing OpenFlow standards. Gaining significant traction in industry WRiPE 13 workshop paper
11 Challenges and Initial Approaches Given SDN configuration 1, migrate to configuration 2: Determine sequence of routers to update Need to avoid routing loops, and preserve correctness invariants (e.g. traffic isolation, deny certain classes of traffic) Solve as a reachability problem in model checker nusmv Output: an ordering of rule updates Given existing SDN configuration 1, update configurations in response to network state changes Solve as two-player temporal logic game Control logic= routing path rule (environment player)+ access control rule (system player) Find a winning strategy for access-control rules against all path changes Winning strategy: invariant preserving Dealing with state explosion: Abstraction based on grouping by nodes or flows
12 #3: Automatic Bandwidth Allocation in Data Center s Network Data Centers X 1 X 2 X 3 1G 600M 500M 450M S 1 S 2 S 3 S 4 Yifei Yuan, Anduo Wang, Rajeev Alur, Boon Thau Loo
13 Automatic Bandwidth Allocation in Data Centers Data Center s Network Virtual Network X 1 V 1 400M 400M X 2 X 3 V 2 V 3 1G 600M 500M 450M S 1 S 2 S 3 S 4
14 Automatic Bandwidth Allocation in Data Centers Data Center s Network Virtual Network X 1 V 1 10G 10G 400M 400M X 2 X 3 V 2 V 3 1G 600M 500M 450M S 1 S 2 S 3 S 4
15 Automatic Bandwidth Allocation in Data Centers Data Center s Network Virtual Network X 1 V 1 400M 400M X 2 X 3 V 2 V 3 1G 600M 500M 450M v 1 v 3 v 2 S 1 S 2 S 3 S 4
16 Automatic Bandwidth Allocation in Data Centers Data Center s Network Virtual Network X 1 V 1 400M 400M X 2 X 3 V 2 V 3 1G 600M 500M 450M v 1 v 3 v 2 S 1 S 2 S 3 S 4
17 Challenges and Initial Approaches NP-complete problem Existing heuristics are inefficient but may not find a solution (even if it exists) Our approach: SAT/SMT solving Abstraction and refinement for scalability Exploit hierarchical structure of data centers (Tree, Fat-tree) FMCAD 13 paper
18 Outline Summary (activities over past year) Research highlights Conclusion
19 ExCAPE Inspired Research Use of formal methods and programming languages has been catching on in the networking community: Domain-specific languages: Frenetic, Declarative Networking Formal methods: Formally Safe Routing toolkit Cornell Summer School on Formal Methods and Networks Workshop on Rigorous Protocol Engineering (WRiPE), 2011 onwards Network management as a synthesis problem is a new frontier to be explored We are the first group to explore this concept, and this work is made possible by ExCAPE.
20 ExCAPE Inspired Themes Network reconfiguration as a reactive synthesis problem: Environment: Network state (e.g. topology) changes System: routing protocol and configurations Strategy: Figure out a sequence of changes to System Applicable to BGP and SDN challenge problems Distributed/autonomous/asynchronous nature of networked systems may require rethink of traditional methods Solvers: Max-SMT (Yices) for the BGP problem, and Z3 for data center Optimization problem given logical constraints Dealing with state explosion: Flor or hierarchical abstractions (BGP, SDN, Data center)
21 Publication/Dissertation Highlights Automated Synthesis of Reactive Controllers for Software-Defined Networks. Anduo Wang, Salar Moarref, Ufuk Topcu, Boon Thau Loo and Andre Scedrov. 3rd International Workshop on Rigorous Protocol Engineering (WRiPE), On the Feasibility of Automation for Bandwidth Allocation Problems in Data Centers. Yifei Yuan, Anduo Wang, Rajeev Alur, and Boon Thau Loo. Formal Methods in Computer-Aided Design (FMCAD), Route Shepherd: Stability Hints for the Control Plane. Alexander J.T. Gurney, Xianglong Han, Yang Li, and Boon Thau Loo. ACM SIGCOMM Conference on Data Communication (demonstration), Helsinki, Finland, Aug, 2012.
22 Dissertation/Qualifying-Exams Automated Formal Analysis of Internet Routing Configurations. Anduo Wang University of Pennsylvania Ph.D. dissertation, (Advisor: Boon Thau Loo, committee member: Rajeev Alur) Disruption-free Network Migration Yifei Yuan UPenn s PhD qualifying exam, (Advisor: Rajeev Alur, committee chair: Boon Thau Loo, committee member: Madhu Parthasarathy
23 Plans for Year 2 Continue our current research directions Many projects in early stages Many papers and tool development in the pipeline Evolve into Ph.D. dissertation topics. Co-advising would be a plus. Cross-layer synthesis (routing, data center networking, cloud scheduling, web scripting)
Summary of Networked Systems Breakout Group
Summary of Networked Systems Breakout Group Boon Thau Loo NSF ExCAPE PI Meeting 10/11 June 2013 Outline Summary (activities over past year) Research highlights Plans for next year Year 1 in Retrospect
More informationAutomated Synthesis of Reactive Controller for Software-defined Networks
Automated Synthesis of Reactive Controller for Software-defined Networks Anduo Wang Salar Moarref Ufuk Topcu Boon Thau Loo Andre Scedrov University of Pennsylvania 1 Networks are complicated network operator
More informationDISTRIBUTION A: Distribution approved for public release.
AFRL-AFOSR-VA-TR-2015-0269 A Unified Algebraic and Logic-Based Framework towards Safe Routing Implementations Boon Loo TRUSTEES OF THE UNIVERSITY OF PENNSYLVANIA 08/13/2015 Final Report. Air Force Research
More informationBoon Thau Loo University of Pennsylvania
Summary of Networked Systems Breakout Boon Thau Loo University of Pennsylvania Networked Systems Breakout Series of 15-20 minute talks: Challenges in safe routing (Alex Gurney) Compositional network services
More informationProgramming Network Policies by Examples: Platform, Abstraction and User Studies
Programming Network Policies by Examples: Platform, Abstraction and User Studies Boon Thau Loo University of Pennsylvania NetPL workshop @ SIGCOMM 2017 Joint work with Yifei Yuan, Dong Lin, Siri Anil,
More informationExCAPE. Expeditions in Computer Augmented Program Engineering
ExCAPE Expeditions in Computer Augmented Program Engineering Rajeev Alur, Ras Bodik, Jeff Foster, Bjorn Hartmann, Lydia Kavraki, Hadas Kress-Gazit, Stephane Lafortune, Boon Loo, P. Madhusudan, Milo Martin,
More informationBoon Thau Loo Speaks Out on His SIGMOD Dissertation Award, Better Networking Through Datalog, Life as an Assistant Professor, and More
Boon Thau Loo Speaks Out on His SIGMOD Dissertation Award, Better Networking Through Datalog, Life as an Assistant Professor, and More by Marianne Winslett http:// www.cis.upenn.edu/~boonloo/ Welcome to
More informationSDN abstraction and security: a database perspective
June 17, 2016 SoSSDN SDN abstraction and security: a database perspective Anduo Wang * Jason Croft Xueyuan Mei Matthew Caesar Brighten Godfrey * Temple University University of Illinois Urbana-Champaign
More informationA Reduction-Based Approach Towards Scaling Up Formal Analysis of Internet Configurations
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science 1-1-2013 A Reduction-Based Approach Towards Scaling Up Formal Analysis of Internet Configurations
More informationLecture 10.1 A real SDN implementation: the Google B4 case. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 10.1 A real SDN implementation: the Google B4 case Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it WAN WAN = Wide Area Network WAN features: Very expensive (specialized high-end
More informationNETWORK VERIFICATION: WHEN CLARKE MEETS CERF
TOOLS FOR PUBLIC CLOUDS, PRIVATE CLOUDS, ENTERPRISE NETWORKS, ISPs,... NETWORK VERIFICATION: WHEN CLARKE MEETS CERF George Varghese UCLA (with collaborators from CMU, MSR, Stanford, UCLA) 1 Model and Terminology
More informationThe Load Balancing Research of SDN based on Ant Colony Algorithm with Job Classification Wucai Lin1,a, Lichen Zhang2,b
2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) The Load Balancing Research of SDN based on Ant Colony Algorithm with Job Classification Wucai Lin1,a, Lichen Zhang2,b
More informationAutomated Bug Removal for Software-Defined Networks
Automated Bug Removal for Software-Defined Networks Yang Wu* Ang Chen* Andreas Haeberlen* Wenchao Zhou + Boon Thau Loo* * University of Pennsylvania + Georgetown University 1 Motivation: Automated repair
More informationFOUNDATIONS OF INTENT- BASED NETWORKING
FOUNDATIONS OF INTENT- BASED NETWORKING Loris D Antoni Aditya Akella Aaron Gember Jacobson Network Policies Enterprise Network Cloud Network Enterprise Network 2 3 Tenant Network Policies Enterprise Network
More informationAutomated Refinement Checking of Asynchronous Processes. Rajeev Alur. University of Pennsylvania
Automated Refinement Checking of Asynchronous Processes Rajeev Alur University of Pennsylvania www.cis.upenn.edu/~alur/ Intel Formal Verification Seminar, July 2001 Problem Refinement Checking Given two
More informationRobust validation of network designs under uncertain demands and failures
Robust validation of network designs under uncertain demands and failures Yiyang Chang, Sanjay Rao, and Mohit Tawarmalani Purdue University USENIX NSDI 2017 Validating network design Network design today
More informationSeamless Network-Wide IGP Migrations
Seamless Network-Wide IGP Migrations Laurent Vanbever, Stefano Vissicchio, Cristel Pelsser, Pierre Francois, and Olivier Bonaventure laurent.vanbever@uclouvain.be SIGCOMM August 8, 20 It is not the strongest
More informationOptimal Simplification of Building Ground Plans
XXI ISPRS Congress 7 July 2008 Beijing, China Optimal Simplification of Building Ground Plans Jan-Henrik Haunert Institute of Cartography and Geoinformatics Leibniz Universität Hannover Germany Alexander
More informationAbstraction-Driven Network Verification and Design (a personal odyssey) Geoffrey Xie Naval Postgraduate School
Abstraction-Driven Network Verification and Design (a personal odyssey) Geoffrey Xie Naval Postgraduate School xie@nps.edu It started in 2004 A sabbatical at CMU Joined a collaborative project with AT&T
More informationControl Improvisation
Control Improvisation Sanjit A. Seshia Professor EECS, UC Berkeley Joint work with: Daniel Fremont, Tommaso Dreossi, Rafael Valle, Sophie Libkind, Alexandre Donze, David Wessel December 11, 2017 Diversity
More informationExCAPE Kick off Meeting. Leads: Stéphane Lafortune and Steve Zdancewic
Education and Outreach ExCAPE Kick off Meeting Monday June 4, 4:30 5:30pm Leads: Stéphane Lafortune and Steve Zdancewic Education and Outreach 2013 Summer School Programs for High SchoolStudents Students
More informationSoftware-Defined Networking:
Software-Defined Networking: OpenFlow and Frenetic Mohamed Ismail Background Problem: Programming Networks is Hard 3/39 Network Stack Pros Key to the success of the Internet Layers and layers of abstraction
More informationProgrammable Networks with Synthesis
Programmable Networks with Synthesis Ahmed ElHassany Petar Tsankov Laurent Vanbever Martin Vechev Network Misconfigurations are Common What Example Makes Network Configuration Hard? Low-level, local router
More informationCentralization of Network using Openflow Protocol
Indian Journal of Science and Technology, Vol 8(S2), 165 170, January 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 DOI : 10.17485/ijst/2015/v8iS2/61217 Centralization of Network using Openflow
More informationReViNE: Reallocation of Virtual Network Embedding to Eliminate Substrate Bottleneck
ReViNE: Reallocation of Virtual Network Embedding to Eliminate Substrate Bottleneck Shihabur R. Chowdhury, Reaz Ahmed, Nashid Shahriar, Aimal Khan, Raouf Boutaba Jeebak Mitra, Liu Liu Virtual Network Embedding
More informationFormal Verification of Computer Switch Networks
Formal Verification of Computer Switch Networks Sharad Malik; Department of Electrical Engineering; Princeton Univeristy (with Shuyuan Zhang (Princeton), Rick McGeer (HP Labs)) 1 SDN: So what changes for
More informationModel Checking Dynamic Datapaths
Model Checking Dynamic Datapaths Aurojit Panda, Katerina Argyraki, Scott Shenker UC Berkeley, ICSI, EPFL Networks: Not Just for Delivery Enforce a variety of invariants: Packet Isolation: Packets from
More informationFSR: Formal Analysis and Implementation Toolkit for Safe Inter-domain Routing
FSR: Formal Analysis and Implementation Toolkit for Safe Inter-domain Routing Wenchao Zhou supervised by Prof. Boon Thau Loo CIS Department, University of Pennsylvania Philadelphia, PA, 19104 wenchaoz@cis.upenn.edu
More informationProvenance-aware Secure Networks
Provenance-aware Secure Networks Wenchao Zhou Eric Cronin Boon Thau Loo University of Pennsylvania Motivation Network accountability Real-time monitoring and anomaly detection Identifying and tracing malicious
More informationOpenCache. A Platform for Efficient Video Delivery. Matthew Broadbent. 1 st Year PhD Student
OpenCache A Platform for Efficient Video Delivery Matthew Broadbent 1 st Year PhD Student Motivation Consumption of video content on the Internet is constantly expanding Video-on-demand is an ever greater
More informationSoftware Defined Networking Security: Security for SDN and Security with SDN. Seungwon Shin Texas A&M University
Software Defined Networking Security: Security for SDN and Security with SDN Seungwon Shin Texas A&M University Contents SDN Basic Operation SDN Security Issues SDN Operation L2 Forwarding application
More informationCombining Induction, Deduction and Structure for Synthesis
Combining Induction, Deduction and Structure for Synthesis Sanjit A. Seshia Associate Professor EECS Department UC Berkeley Students: S. Jha, B. Brady, J. Kotker, W.Li Collaborators: R. Bryant, S. Gulwani,
More informationFSR: Formal Analysis and Implementation Toolkit for Safe Inter-Domain Routing
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science 1-1-2011 FSR: Formal Analysis and Implementation Toolkit for Safe Inter-Domain Routing Anduo
More informationMulti-resource Energy-efficient Routing in Cloud Data Centers with Network-as-a-Service
in Cloud Data Centers with Network-as-a-Service Lin Wang*, Antonio Fernández Antaº, Fa Zhang*, Jie Wu+, Zhiyong Liu* *Institute of Computing Technology, CAS, China ºIMDEA Networks Institute, Spain + Temple
More informationTime and Place. Course Web Site. Grading Policy. Advanced Computer Networks. Lecture 1: Introduction to Course
Time and Place Advanced Computer Networks Lecture 1: Introduction to Course Lecture: TuTh 10:30-12:00, Fr 9:30-10:30 Discussion: after paper discussion on Tue and/or Thu Room:1690 BBB Instructor: Sugih
More informationA Brief History of Synthesis From Church to ExCAPE. Rajeev Alur. University of Pennsylvania
A Brief History of Synthesis From Church to ExCAPE Rajeev Alur University of Pennsylvania 1 Software Design Libraries Program Specifications Tests Compiler Analysis Tool Executable Platform 2 Programming
More informationFormally Verifiable Networking
Formally Verifiable Networking Anduo Wang 1 Limin Jia 1 Changbin Liu 1 Boon Thau Loo 1 Andre Scedrov 1 Oleg Sokolsky 1 Prithwish Basu 2 1 University of Pennsylvania 2 BBN technologies Protocol exchange
More informationKey words: TCP/IP, IGP, OSPF Routing protocols, MRC, MRC System.
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume2 Issue 8 August, 2013 Page No. 2628-2634 Multiple Routing Configurations For Fast Ip Network Recovery Sk.Meeravali
More informationScalable Constraint-based Virtual Data Center Allocation
Scalable Constraint-based Virtual Data Center Allocation Sam Bayless Nodir Kodirov Ivan Beschastnikh Holger H. Hoos Alan J. Hu Computer Science University of British Columbia Data centers, data centers,
More informationVirtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing
Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing Zhi Li, Prasant Mohapatra, and Chen-Nee Chuah University of California, Davis, CA 95616, USA {lizhi, prasant}@cs.ucdavis.edu,
More informationCengiz Alaettinoglu. SDN Traffic Engineering A Natural Evolution
Cengiz Alaettinoglu SDN Traffic Engineering A Natural Evolution What is Traffic Engineering (TE)? Minimizes the worst link utilization Alleviates traffic congestion Better/longer use of capital expenditure
More informationA configuration-only approach to shrinking FIBs. Prof Paul Francis (Cornell)
A configuration-only approach to shrinking FIBs Prof Paul Francis (Cornell) 1 Virtual Aggregation An approach to shrinking FIBs (and RIBs) In routers, not in route reflectors Works with legacy routers
More informationCQNCR: Optimal VM Migration Planning in Cloud Data Centers
CQNCR: Optimal VM Migration Planning in Cloud Data Centers Presented By Md. Faizul Bari PhD Candidate David R. Cheriton School of Computer science University of Waterloo Joint work with Mohamed Faten Zhani,
More informationSyntax-Guided Program Synthesis. Rajeev Alur. University of Pennsylvania
Syntax-Guided Program Synthesis Rajeev Alur University of Pennsylvania 1 Goal: Programming computers easier than communicating with people Can programming be liberated, period. David Harel, IEEE Computer,
More informationSyntax-Guided Program Synthesis. Rajeev Alur
Syntax-Guided Program Synthesis Rajeev Alur University of Pennsylvania 1 Goal: Programming computers easier than communicating with people Can programming be liberated, period. David Harel, IEEE Computer,
More informationDemocratically Finding The Cause of Packet Drops
Democratically Finding The Cause of Packet Drops Behnaz Arzani, Selim Ciraci, Luiz Chamon, Yibo Zhu, Hongqiang (Harry) Liu, Jitu Padhye, Geoff Outhred, Boon Thau Loo 1 Marple- SigComm 2017 Sherlock- SigComm
More informationA framework to evaluate 5G networks for smart and fail-safe communications
A framework to evaluate 5G networks for smart and fail-safe communications in ERTMS/ETCS Roberto Canonico (*), Stefano Marrone (**), Roberto Nardone (*), and Valeria Vittorini (*) (*) Università degli
More informationDesign and development of the reactive BGP peering in softwaredefined routing exchanges
Design and development of the reactive BGP peering in softwaredefined routing exchanges LECTURER: HAO-PING LIU ADVISOR: CHU-SING YANG (Email: alen6516@gmail.com) 1 Introduction Traditional network devices
More informationData Plane Verification and Anteater
Data Plane Verification and Anteater Brighten Godfrey University of Illinois Work with Haohui Mai, Ahmed Khurshid, Rachit Agarwal, Matthew Caesar, and Sam King Summer School on Formal Methods and Networks
More informationIntroduction to Segment Routing
Segment Routing (SR) is a flexible, scalable way of doing source routing. Overview of Segment Routing, page 1 How Segment Routing Works, page 2 Examples for Segment Routing, page 3 Benefits of Segment
More informationConsistent SDN Flow Migration aided by Optical Circuit Switching. Rafael Lourenço December 2nd, 2016
Consistent SDN Flow Migration aided by Optical Circuit Switching Rafael Lourenço December 2nd, 2016 What is Flow Migration? Installation/update of new rules on [multiple] [asynchronous] SDN switches to
More informationSDN SEMINAR 2017 ARCHITECTING A CONTROL PLANE
SDN SEMINAR 2017 ARCHITECTING A CONTROL PLANE NETWORKS ` 2 COMPUTER NETWORKS 3 COMPUTER NETWORKS EVOLUTION Applications evolve become heterogeneous increase in traffic volume change dynamically traffic
More informationImportant Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)
Important Lessons From Last Lecture 15-441 Computer Networking Inter-Domain outing BGP (Border Gateway Protocol) Every router needs to be able to forward towards any destination Forwarding table must be
More informationTopic 6: SDN in practice: Microsoft's SWAN. Student: Miladinovic Djordje Date:
Topic 6: SDN in practice: Microsoft's SWAN Student: Miladinovic Djordje Date: 17.04.2015 1 SWAN at a glance Goal: Boost the utilization of inter-dc networks Overcome the problems of current traffic engineering
More informationSciduction: Combining Induction, Deduction and Structure for Verification and Synthesis
Sciduction: Combining Induction, Deduction and Structure for Verification and Synthesis (abridged version of DAC slides) Sanjit A. Seshia Associate Professor EECS Department UC Berkeley Design Automation
More informationParticipatory Networking: An API for Application Control of SDNS SIGCOMM 13
Participatory Networking: An API for Application Control of SDNS SIGCOMM 13 Ferguson, Guha, Liang, Fonseca, Krishnamurthi MAURICIO DE OLIVEIRA 1 The idea behind participatory networking There is a lot
More informationImproving Network Agility with Seamless BGP Reconfigurations
Improving Network Agility with Seamless BGP Reconfigurations Corneliu Claudiu Prodescu School of Engineering and Sciences Jacobs University Bremen Campus Ring 1, 28759 Bremen, Germany Monday 18 th March,
More informationSWAN: Software-driven wide area network. Ratul Mahajan
SWAN: Software-driven wide area network Ratul Mahajan Partners in crime Vijay Gill Chi-Yao Hong Srikanth Kandula Ratul Mahajan Mohan Nanduri Ming Zhang Roger Wattenhofer Rohan Gandhi Xin Jin Harry Liu
More informationCS118 Discussion 1A, Week 7. Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m.
CS118 Discussion 1A, Week 7 Zengwen Yuan Dodd Hall 78, Friday 10:00 11:50 a.m. 1 Outline Network control plane Routing Link state routing (OSPF) Distance vector routing (RIP) BGP ICMP Midterm/Project 2
More informationDissemination of Paths in Path-Aware Networks
Dissemination of Paths in Path-Aware Networks Christos Pappas Network Security Group, ETH Zurich IETF, November 16, 2017 PANRG Motivation How does path-awareness extend to the edge? 2 PANRG Motivation
More informationCloud 3.0 and Software Defined Networking October 28, Amin Vahdat on behalf of Google Technical Infratructure Google Fellow
Cloud 3.0 and Software Defined Networking October 28, 2016 Amin Vahdat on behalf of Google Technical Infratructure Google Fellow Overview This talk: example of the Google research model Driven by novel
More informationVirtual Links Mapping in Future SDN-enabled Networks
Security Level: Virtual Links Mapping in Future SDN-enabled Networks R. Trivisonno, I. Vaishnavi, R. Guerzoni, Z. Despotovic A. Hecker, S. Beker, D. Soldani www.huawei.com SDN4FNS, Trento, Italy 11 th
More informationFG INET: Intelligent Networks
FG INET: Intelligent Networks An-Institut Deutsche Telekom Laboratories Prof. Anja Feldmann, Ph.D. anja@net.t-labs.tu-berlin.de http://www.net.t-labs.tu-berlin.de/ 1 INET: Research Group Location Telefunkenhochhaus,
More informationNetwork utilization with SDN in on-demand application-specific networks
Network utilization with SDN in on-demand application-specific networks Ioannis Grafis Ioannis.Grafis@os3.nl Supervised by: Marc X. Makkes M.X.Makkes@uva.nl System and Network Engineering Universiteit
More informationTHE CHANGING WAN MATCHING THE WAN TO BUSINESS NEEDS. James Walker, Vice President Managed Network Services WAN Summit 7th October 2015
THE CHANGING WAN MATCHING THE WAN TO BUSINESS NEEDS James Walker, Vice President Managed Network Services WAN Summit 7th October 2015 tatacommunications.com @tata_comm tatacommunications-newworld.com youtube.com/user/tatacomms
More informationDebugging the Data Plane with Anteater
Debugging the Data Plane with Anteater Haohui Mai, Ahmed Khurshid Rachit Agarwal, Matthew Caesar P. Brighten Godfrey, Samuel T. King University of Illinois at Urbana-Champaign Network debugging is challenging
More informationLecture 13: Traffic Engineering
Lecture 13: Traffic Engineering CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Mike Freedman, Nick Feamster Lecture 13 Overview Evolution of routing in the ARPAnet Today s TE: Adjusting
More informationHIRP OPEN 2018 Compiler & Programming Language. An Efficient Framework for Optimizing Tensors
An Efficient Framework for Optimizing Tensors 1 Theme: 2 Subject: Compiler Technology List of Abbreviations NA 3 Background Tensor computation arises frequently in machine learning, graph analytics and
More informationInternet Technology. 15. Things we didn t get to talk about. Paul Krzyzanowski. Rutgers University. Spring Paul Krzyzanowski
Internet Technology 15. Things we didn t get to talk about Paul Krzyzanowski Rutgers University Spring 2016 May 6, 2016 352 2013-2016 Paul Krzyzanowski 1 Load Balancers Load Balancer External network NAT
More information"Charting the Course... MOC A Deploying Voice Workloads for Skype for Business Online and Server Course Summary
Description Course Summary This five-day instructor-led course teaches how to design, plan, and deploy the various voice solutions available with Skype for Business Online and Skype for Business Server
More informationSelf-Managed Systems: an Architectural Challenge
Self-Managed Systems: an Architectural Challenge Kramer, Jeff and Magee, Jeff FOSE 07: 2007 Future of Software Engineering Summarized by Jason Porter Introduction A self-managed system is a system which
More informationCOM-208: Computer Networks - Homework 6
COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each
More informationIEEE ComSoc Distinguished Lecture Tour Australia, June 8-18, 2014 Ying-Dar Lin, IEEE Fellow National Chiao Tung University, TAIWAN July 5, 2014
IEEE ComSoc Distinguished Lecture Tour Australia, June 8-18, 2014 Ying-Dar Lin, IEEE Fellow National Chiao Tung University, TAIWAN July 5, 2014 DLT Planning This was my first DLT (Distinguished Lecture
More informationBGP#: A System for Dynamic Route Control In Data Centers
BGP#: A System for Dynamic Route Control In Data Centers Chao-Chih Chen UC Davis* Lihua Yuan Albert Greenberg Randy Kern Tao Zhang Parantap Lahiri John Arnold Kevin Grady Microsoft *Also a Microsoft Intern
More informationData Provenance at Internet Scale: Architecture, Experiences, and the Road Ahead. Ang Chen, Yang Wu, Andreas Haeberlen, Boon Thau Loo, Wenchao Zhou
Data Provenance at Internet Scale: Architecture, Experiences, and the Road Ahead Ang Chen, Yang Wu, Andreas Haeberlen, Boon Thau Loo, Wenchao Zhou Motivation D E Alice A B C foo.com An example scenario:
More informationLecture 14 SDN and NFV. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 14 SDN and NFV Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Traditional network vs SDN TRADITIONAL Closed equipment Software + hardware Cost Vendor-specific management.
More informationSoftware-Defined Networking (SDN) Overview
Reti di Telecomunicazione a.y. 2015-2016 Software-Defined Networking (SDN) Overview Ing. Luca Davoli Ph.D. Student Network Security (NetSec) Laboratory davoli@ce.unipr.it Luca Davoli davoli@ce.unipr.it
More informationAdvanced Topics in Routing
Advanced Topics in Routing EE122 Fall 2012 Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other colleagues at Princeton and UC
More informationTowards Systematic Design of Enterprise Networks
Towards Systematic Design of Enterprise Networks Geoffrey Xie Naval Postgraduate School In collaboration with: Eric Sung, Xin Sun, and Sanjay Rao (Purdue Univ.) David Maltz (MSR) Copyright 2008 AT&T. All
More informationAutomated Software Synthesis for Complex Robotic Systems
Automated Software Synthesis for Complex Robotic Systems Indranil Saha Department of Computer Science and Engineering Indian Institute of Technology Kanpur Indranil Saha Automated Software Synthesis for
More informationFormalizing Metarouting in PVS
Formalizing Metarouting in PVS ABSTRACT Anduo Wang Department of Computer and Information Science University of Pennsylvania Philadelphia, USA anduo@seas.upenn.edu In this paper, we extend PVS specification
More informationA Framework for Fine-Grained Inter-Domain Routing Diversity Via SDN
A Framework for Fine-Grained Inter-Domain Routing Diversity Via SDN Yangyang Wang, Jun Bi, Keyao Zhang Institute for Network Sciences and Cyberspace, Tsinghua University Department of Computer Science,
More informationTBGP: A more scalable and functional BGP. Paul Francis Jan. 2004
TBGP: A more scalable and functional BGP Paul Francis Jan. 2004 BGP: Border Gateway Protocol BGP is the top-level routing protocol in the Internet It holds the Internet together BGP allows routers to tell
More informationModel Checking and Its Applications
Model Checking and Its Applications Orna Grumberg Technion, Israel Verification and Deduction Mentoring Workshop July 13, 2018 1 Personal data Ph.d. in (non-automated) verification Postdoc in Model Checking
More informationInternet Anycast: Performance, Problems and Potential
Internet Anycast: Performance, Problems and Potential Zhihao Li, Dave Levin, Neil Spring, Bobby Bhattacharjee University of Maryland 1 Anycast is increasingly used DNS root servers: All 13 DNS root servers
More informationIs Power State Table Golden?
Is Power State Table Golden? Harsha Vardhan #1, Ankush Bagotra #2, Neha Bajaj #3 # Synopsys India Pvt. Ltd Bangalore, India 1 dhv@synopsys.com 2 ankushb@synopsys.com 3 nehab@synopsys.com Abstract: Independent
More informationLecture 7: Data Center Networks
Lecture 7: Data Center Networks CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Nick Feamster Lecture 7 Overview Project discussion Data Centers overview Fat Tree paper discussion CSE
More informationIQ for DNA. Interactive Query for Dynamic Network Analytics. Haoyu Song. HUAWEI TECHNOLOGIES Co., Ltd.
IQ for DNA Interactive Query for Dynamic Network Analytics Haoyu Song www.huawei.com Motivation Service Provider s pain point Lack of real-time and full visibility of networks, so the network monitoring
More informationDynamic Graph Query Primitives for SDN-based Cloud Network Management
Dynamic Graph Query Primitives for SDN-based Cloud Network Management Ramya Raghavendra, Jorge Lobo, Kang-Won Lee IBM T. J. Watson Research Center Network as a Service Model High-level VM and network description
More informationHECTOR: Formal System-Level to RTL Equivalence Checking
ATG SoC HECTOR: Formal System-Level to RTL Equivalence Checking Alfred Koelbl, Sergey Berezin, Reily Jacoby, Jerry Burch, William Nicholls, Carl Pixley Advanced Technology Group Synopsys, Inc. June 2008
More informationCSE 473 Introduction to Computer Networks. Final Exam Review
CSE 473 Introduction to Computer Networks Final Exam Review Roch Guérin 12/4/2014 1) The diagram at right shows a switched Ethernet LAN with two routers (labeled Q and R), seven switches and five hosts.
More informationNetFPGA Update at GEC4
NetFPGA Update at GEC4 http://netfpga.org/ NSF GENI Engineering Conference 4 (GEC4) March 31, 2009 John W. Lockwood http://stanford.edu/~jwlockwd/ jwlockwd@stanford.edu NSF GEC4 1 March 2009 What is the
More informationGrowing Solver-Aided Languages with ROSETTE
Growing Solver-Aided Languages with ROSETTE Emina Torlak & Rastislav Bodik U.C. Berkeley ExCAPE June 10, 2013 solver-aided domain-specific language Solver-aided DSL (SDSL) Noun 1. A high-level language
More informationDeploying Voice Workloads for Skype for Business Online and Server 2015
Deploying Voice Workloads for Skype for Business Online and Server 2015 40409; 5 Days, Instructor-led Course Description This five-day instructor-led course teaches how to design, plan, and deploy the
More informationLecture 18: Border Gateway Protocol
Lecture 18: Border Gateway Protocol CSE 123: Computer Networks Alex C. Snoeren HW 3 due Wednesday Some figures courtesy Mike Freedman & Craig Labovitz Lecture 18 Overview Path-vector Routing Allows scalable,
More informationLecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011
Lecture 4: Intradomain Routing CS 598: Advanced Internetworking Matthew Caesar February 1, 011 1 Robert. How can routers find paths? Robert s local DNS server 10.1.8.7 A 10.1.0.0/16 10.1.0.1 Routing Table
More informationOutline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006
EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering
More informationApplication of SDN: Load Balancing & Traffic Engineering
Application of SDN: Load Balancing & Traffic Engineering Outline 1 OpenFlow-Based Server Load Balancing Gone Wild Introduction OpenFlow Solution Partitioning the Client Traffic Transitioning With Connection
More informationTechniques and Protocols for Improving Network Availability
Techniques and Protocols for Improving Network Availability Don Troshynski dtroshynski@avici.com February 26th, 2004 Outline of Talk The Problem Common Convergence Solutions An Advanced Solution: RAPID
More informationNetComplete: Practical Network-Wide Configuration Synthesis with Autocompletion. Ahmed El-Hassany Petar Tsankov Laurent Vanbever Martin Vechev
NetComplete: Practical Network-Wide Configuration Synthesis with Autocompletion Ahmed El-Hassany Petar Tsankov Laurent Vanbever Martin Vechev I shouldn t be the one giving this talk Third year PhD student
More information