Relating Two Formal Models of Path-Vector Routing March 15, 2005: IEEE INFOCOM, Miami, Florida Aaron D. Jaggard Tulane University Vijay.

Slides:



Advertisements
Similar presentations
1 Incentive-Compatible Interdomain Routing Joan Feigenbaum Yale University Vijay Ramachandran Stevens Institute of Technology Michael Schapira The Hebrew.
Advertisements

A Logical Viewpoint on Architectures
Architecture Representation
Database Systems: Design, Implementation, and Management Tenth Edition
1 Incentive-Compatible Inter-Domain Routing Joan Feigenbaum Yale University Colloquium at Cornell University; October.
Chapters 7 & 9 System Scope
August Moscow meeting1August Moscow meeting1August Moscow meeting11 Deductive tools in insertion modeling verification A.Letichevsky.
Does BGP Solve the Shortest Paths Problem? Timothy G. Griffin Joint work with Bruce Shepherd and Gordon Wilfong Bell Laboratories, Lucent Technologies.
Part IV BGP Modeling. 2 BGP Is Not Guaranteed to Converge!  BGP is not guaranteed to converge to a stable routing. Policy inconsistencies can lead to.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Foundations of Inter-Domain Routing Ph.D. Dissertation Defense Vijay Ramachandran Dissertation Director: Joan Feigenbaum Committee Members: Jim Aspnes,
SCHOOL OF INFORMATION UNIVERSITY OF MICHIGAN si.umich.edu Searching for Stability in Interdomain Routing Rahul Sami (University of Michigan) Michael Schapira.
How to Construct a Correct and Scalable iBGP Configuration Mythili Vutukuru Joint work with Paul Valiant, Swastik Kopparty and Hari Balakrishnan.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
STABLE PATH PROBLEM Presented by: Sangeetha A. J. Based on The Stable Path Problem and Interdomain Routing Timothy G. Griffin, Bruce Shepherd, Gordon Wilfong.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Towards a Lightweight Model of BGP Safety Matvey Arye Princeton University Joint work with: Rob Harrison, Richard Wang, Jennifer Rexford (Princeton) Pamela.
30 September 2003Ramachandran: OGST 1 Path-Vector Policy Systems Vijay Ramachandran Official Graduate Student Talk September 30, 2003 Advisor: Joan Feigenbaum.
Design Principles of Policy Languages for Path Vector Protocols Timothy G. Griffin (AT&T Research), Aaron D. Jaggard (Penn), and Vijay Ramachandran (Yale)
An open problem in Internet Routing --- Policy Language Design for BGP Nov 3, 2003 Timothy G. Griffin Intel Research, Cambridge UK
1 Leveraging BGP Dynamics to Reverse-Engineer Routing Policies Sridhar Machiraju Randy H. Katz UC, Berkeley OASIS Retreat, Summer 2005.
Architecture-driven Modeling and Analysis By David Garlan and Bradley Schmerl Presented by Charita Feldman.
Andrew Stone -- Colorado State University Slide 1 Andrew Stone, Michelle Strout, Steven DiBenedetto, and Daniel Massey December 5, 2009 FRACTAL Workshop.
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
1 Policy Disputes in Path-Vector Protocols A Safe Path-Vector Protocol Zacharopoulos Dimitris
Tutorial 5 Safe Routing With BGP Based on: Internet.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
On the Death of BGP MSN July 8, 2004 Timothy G. Griffin Intel Research, Cambridge UK
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
On the Stability of Rational, Heterogeneous Interdomain Route Selection Hao Wang Yale University Joint work with Haiyong Xie, Y. Richard Yang, Avi Silberschatz,
Interdomain Routing as Social Choice Ronny R. Dakdouk, Semih Salihoglu, Hao Wang, Haiyong Xie, Yang Richard Yang Yale University IBC ’ 06.
Interdomain Routing Establish routes between autonomous systems (ASes). Currently done with the Border Gateway Protocol (BGP). AT&T Qwest Comcast Verizon.
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
Data Flow Analysis Compiler Design Nov. 8, 2005.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Architectural Design Establishing the overall structure of a software system Objectives To introduce architectural design and to discuss its importance.
Towards a Logic for Wide- Area Internet Routing Nick Feamster Hari Balakrishnan.
Chapter 6 System Engineering - Computer-based system - System engineering process - “Business process” engineering - Product engineering (Source: Pressman,
Information-Centric Networks04a-1 Week 4 / Paper 1 Open issues in Interdomain Routing: a survey –Marcelo Yannuzzi, Xavier Masip-Bruin, Olivier Bonaventure.
Egress Route Selection for Interdomain Traffic Engineering Design considerations beyond BGP.
Database Systems: Design, Implementation, and Management Ninth Edition
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Chapter 10 Analysis and Design Discipline. 2 Purpose The purpose is to translate the requirements into a specification that describes how to implement.
SOFTWARE DESIGN AND ARCHITECTURE LECTURE 05. Review Software design methods Design Paradigms Typical Design Trade-offs.
Model construction and verification for dynamic programming languages Radu Iosif
What’s MPEG-21 ? (a short summary of available papers by OCCAMM)
Can the Border Gateway Protocol (BGP) be fixed? UCL Oct 15, 2003 Timothy G. Griffin Intel Research, Cambridge UK
© 2005 Prentice Hall1-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
1 Supplementary Slides for Software Engineering: A Practitioner's Approach, 5/e Supplementary Slides for Software Engineering: A Practitioner's Approach,
Pitch Patarasuk Policy Disputes in Path-Vector Protocol A Safe Path Vector Protocol The Stable Paths Problem and Interdomain routing.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Duminda WijesekeraSWSE 623: Introduction1 Introduction to Formal and Semi- formal Methods Based on A Specifier's Introduction to Formal Methods (J. Wing)
CSci5221: BGP Policies1 Inter-Domain Routing: BGP, Routing Policies, etc. BGP Path Selection and Policy Routing Stable Path Problem and Policy Conflicts.
1 Internet Routing 4/12/2012. Admin. r Exam 2 date: m Wednesday, May 2 at 2:00 p.m. m If you want to take the exam in another day (e.g. due to travel),
15-849: Hot Topics in Networking Policy and Networks Srinivasan Seshan 1.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
New Directions in Routing
An Analysis of BGP Convergence Properties
SysML v2 Formalism: Requirements & Benefits
NSI Topology Thoughts on how topology fits into the NSI architecture
L. Cittadini, G. Di Battista, M. Rimondini, S. Vissicchio
Hao Wang Yale University Joint work with
TIM 58 Chapter 8: Class and Method Design
Module Summary BGP is a path-vector routing protocol that allows routing policy decisions at the AS level to be enforced. BGP is a policy-based routing.
Inter-Domain Routing: BGP, Routing Policies, etc.
Metarouting (SIGCOMM 2005) T. G. Griffin and J. L. Sobrinho
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Parsing Unrestricted Text
Presentation transcript:

Relating Two Formal Models of Path-Vector Routing March 15, 2005: IEEE INFOCOM, Miami, Florida Aaron D. Jaggard Tulane University Vijay Ramachandran Yale University

15 March 2005Jaggard and Ramachandran — INFOCOM Introduction Two formalisms presented at SIGCOMM’03 model the behavior of path-vector protocols, e.g., BGP (the standard Internet inter-domain routing protocol): Path-Vector Policy Systems (PVPS) [GJR ’03] Path-Vector Algebras [Sobrinho ’03] Both were used to derive a mixture of local and global constraints that guarantee convergence. This paper establishes the relationship between the models and constraints.

15 March 2005Jaggard and Ramachandran — INFOCOM Problem: Protocol Divergence D BC D CD D BD CD BCD BD CBD BD CD BCD CBD

15 March 2005Jaggard and Ramachandran — INFOCOM Method: Formally Model Behavior Goal: Understand the role of input routing policies on convergence. Can policies be limited to those that guarantee convergence, and how (if at all) can that set of policies be described? What are the trade-offs? Formal models allow rigorous analysis and design at different levels of abstraction.

15 March 2005Jaggard and Ramachandran — INFOCOM Three Levels of Abstraction Path-Vector Algebras [Sob. ’03] A description of the most important criteria involved in determining best routes. Does not include implementation details, e.g., a route advertisement is considered an atomic action. Path-Vector Policy Systems (PVPS) [GJR ’03] A combination of message-passing system (protocol), policy language, and global constraint. The underlying path-vector system models import & export policies, path selection, and route data structures. Instances of the Stable Paths Problem (SPP) [GSW ’02] A routing configuration, indicating the preference order of permitted paths on a given network. Solutions are consistent assignments; unique solutions give predictable convergence to a stable assignment. Sets of Protocols Protocols Networks

15 March 2005Jaggard and Ramachandran — INFOCOM Modeling Protocol Dynamics A B C Route information to be shared Transformations during advertisement Policies affecting what is exported Policies affecting what is imported Preference settings based on local policy Path-selection procedure

15 March 2005Jaggard and Ramachandran — INFOCOM Model Components and Properties Algebra Signatures Edge Labels Path/Label Operator Weight Function Monotonicity Isotonicity PVPS Path Descriptors Policies (import + export) Policy Application Path Selection (by rank) Increasing rank on extension Order-preserving extension

15 March 2005Jaggard and Ramachandran — INFOCOM Monotonicity and Isotonicity A B C Path R has signature s 3 or descriptor d 3 Path P has signature s 1 or descriptor d 1 Path Q has signature s 2 or descriptor d 2 Edge has label l b or policies f b in, f b out Edge has label l a or policies f a in, f a out Strict Monotonicity: f ( l b + s 3 ) > f ( s 3 ) or ! ( t in ( f b in, t out ( f b out, R ))) > ! ( R ) Isotonicity: f ( s 1 ) ≥ f ( s 2 ) implies f ( l a + s 1 ) ≥ f ( l a + s 2 ); or ! ( P ) ≥ ! ( Q ) implies ! ( t in ( f a in, t out ( f a out, P ))) ≥ ! ( t in ( f a in, t out ( f a out, Q )))

15 March 2005Jaggard and Ramachandran — INFOCOM Main Convergence Results Path-vector protocols will converge robustly on network configurations in which all routes can be partially ordered consistent with nodes’ preferences and path extension (strict monotonicity). optimally on network configurations in which the preference ordering for paths extended along the same network edge is preserved (isotonicity). These results can be translated between the models’ various levels of abstraction.

15 March 2005Jaggard and Ramachandran — INFOCOM Translating Between Levels Protocols using length Protocols using local preference Both, primarily length Both, primarily loc. pref. Robust protocols Shortest Paths Shortest Paths with preference tie-breaking Monotone preferences with length tie-breaking Strictly monotone preferences BGP Monotone (or arbitrary) preferences For both, some network instances are convergent

15 March 2005Jaggard and Ramachandran — INFOCOM Mapping Between Algebras and PVPSes The expressiveness of an algebra or PVPS is the set of SPP equivalence classes representing possible network configurations. Given an algebra, we can construct a canonical PVPS that is exactly as expressive. Given a PVPS, we can construct a canonical algebra that describes the same rank criteria.

15 March 2005Jaggard and Ramachandran — INFOCOM Trade-offs in Implementation The algebra can be used to study convergence properties at an abstract level and suggest convergence constraints, independent of specific implementation details. The PVPS framework models more implementation details (e.g., built-in route transformations separate from policies). Thus, trade-offs among enforcing the convergence constraints and other desirable properties not modeled at the abstract level (e.g., autonomy and transparency) can be studied.

15 March 2005Jaggard and Ramachandran — INFOCOM Summary Algebras and PVPSes are models of path-vector protocols at different levels of abstraction. The models have been used to derive equivalent notions of constraints that guarantee certain convergence properties: Strict monotonicity gives robust convergence. Isotonicity gives optimal convergence.

15 March 2005Jaggard and Ramachandran — INFOCOM Sample Applications of our Translation Added notion of expressiveness to algebras Added optimal convergence results to PVPS Can produce canonical representation of one framework in another Demonstrated various methods to implement a convergence constraint Better understanding of the role of path preference orders, in general

15 March 2005Jaggard and Ramachandran — INFOCOM Open Questions for Future Work Analyzing interaction between eBGP and iBGP (we’re working on it!) More examples of interesting algebras and protocols and their convergence properties Describe properties using most appropriate formalism Translate between them for specific problems Necessary conditions for convergence Using constraints and implementation methods to design policy-configuration languages