a distributed method for dynamic resolution of bgp
play

A Distributed Method for Dynamic Resolution of BGP Oscillations - PowerPoint PPT Presentation

Apr 03, 2023 •113 likes •497 views

BGP presentation Oscillation problem Our solution Conclusion A Distributed Method for Dynamic Resolution of BGP Oscillations Ehoud Ahronovitz, Jean-Claude K onig, Cl ement Saad University Montpellier 2 - LIRMM International Parallel

  1. BGP presentation Oscillation problem Our solution Conclusion A Distributed Method for Dynamic Resolution of BGP Oscillations Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM International Parallel & Distributed Processing Symposium 25-29 april 2006 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  2. BGP presentation Oscillation problem Our solution Conclusion 1 BGP presentation 2 Oscillation problem SPP (Stable Paths Problem) Dispute digraph 3 Our solution Maintaining path local stateful information (PLSI) Token principles Coherence between routing policies 4 Conclusion Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  3. BGP presentation Oscillation problem Our solution Conclusion 1 BGP presentation 2 Oscillation problem SPP (Stable Paths Problem) Dispute digraph 3 Our solution Maintaining path local stateful information (PLSI) Token principles Coherence between routing policies 4 Conclusion Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  4. BGP presentation Oscillation problem Our solution Conclusion BGP presentation Autonomous System (AS) is a set of machines managed by unique administration. Each AS chooses its own internal routing (RIP,OSPF,...). BGP used for external routing allows each AS to define its own routing policy. Oscillations are due to incoherences between policies . Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  5. BGP presentation Oscillation problem Our solution Conclusion BGP presentation Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  6. BGP presentation Oscillation problem Our solution Conclusion BGP presentation Autonomous System (AS) is a set of machines managed by unique administration. Each AS chooses its own internal routing (RIP,OSPF,...). BGP used for external routing allows each AS to define its own routing policy. Oscillations are due to incoherences between policies . Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  7. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion 1 BGP presentation 2 Oscillation problem SPP (Stable Paths Problem) Dispute digraph 3 Our solution Maintaining path local stateful information (PLSI) Token principles Coherence between routing policies 4 Conclusion Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  8. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  9. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  10. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  11. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  12. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  13. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  14. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  15. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion SPP (Stable Paths Problem) SPP (Stable Paths Problem) (Griffin & Wilfong [1, 2]) Each node represents an AS and each edge represents a BGP link. AS defines a list of paths ordered by preference related to its own policy. 130 10 1 0 3 2 210 320 20 30 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  16. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion Dispute digraph Each node represents a path. Dotted lines represent transmission arcs. Full lines represent dispute arcs. 130 1 10 130 320 210 0 320 210 3 2 30 20 30 20 10 Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  17. BGP presentation Oscillation problem SPP (Stable Paths Problem) Our solution Dispute digraph Conclusion Dispute digraph Theorem If the dispute digraph related to an instance S of SPP is acyclic, then S contains a stable solution. Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  18. BGP presentation Maintaining path local stateful information (PLSI) Oscillation problem Token principles Our solution Coherence between routing policies Conclusion 1 BGP presentation 2 Oscillation problem SPP (Stable Paths Problem) Dispute digraph 3 Our solution Maintaining path local stateful information (PLSI) Token principles Coherence between routing policies 4 Conclusion Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

  19. BGP presentation Maintaining path local stateful information (PLSI) Oscillation problem Token principles Our solution Coherence between routing policies Conclusion Our solution : allows to detect oscillation due to cycles in the dispute digraph. marks barred one path in the cycle, in order to break it. Ehoud Ahronovitz, Jean-Claude K¨ onig, Cl´ ement Saad University Montpellier 2 - LIRMM A Distributed Method for Dynamic Resolution of BGP Oscillati

Recommend

Ambiguity Resolution: Statistical Method Prof. Ahmed Rafea Ch.7 Ambiguity Resolution:Statistical

Ambiguity Resolution: Statistical Method Prof. Ahmed Rafea Ch.7 Ambiguity Resolution:Statistical

Ambiguity Resolution: Statistical Method Prof. Ahmed Rafea Ch.7 Ambiguity Resolution:Statistical Method 1 Outline Estimating Probability Part of Speech Tagging Obtaining Lexical Probability Probabilistic Context-free

338 views • 17 slides
Distributed Computing in Fault-Prone Dynamic Networks Philipp Brandes, Friedhelm Meyer auf der

Distributed Computing in Fault-Prone Dynamic Networks Philipp Brandes, Friedhelm Meyer auf der

Distributed Computing in Fault-Prone Dynamic Networks Philipp Brandes, Friedhelm Meyer auf der Heide ETH Zurich Distributed Computing Group www.disco.ethz.ch Introduction Moving nodes in a dynamic network with changing connections

488 views • 25 slides
Multi-Resolution Method for Ray Tracing Sung-Eui Yoon ( ) Course URL:

Multi-Resolution Method for Ray Tracing Sung-Eui Yoon ( ) Course URL:

Multi-Resolution Method for Ray Tracing Sung-Eui Yoon ( ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/SGA/ At the Previous Class Studied LOD techniques for rasterization 2 Goal Perform an interactive ray tracing of

550 views • 43 slides
Quasi-Dynamic Network Model Contents Partition Method for Accelerating Parallel Network

Quasi-Dynamic Network Model Contents Partition Method for Accelerating Parallel Network

Quasi-Dynamic Network Model Contents Partition Method for Accelerating Parallel Network Simulation Background Research Objective Hiroyuki Ohsaki Gomez Oscar Quasi-Dynamic Network Model Partition Method Makoto Imase Basic idea

313 views • 4 slides
DISTRIBUTED SYSTEMS II REPLICATION CNT. II The Quorum consensus method for Replication To

DISTRIBUTED SYSTEMS II REPLICATION CNT. II The Quorum consensus method for Replication To

Prof Philippas Tsigas Distributed Computing and Systems Research Group DISTRIBUTED SYSTEMS II REPLICATION CNT. II The Quorum consensus method for Replication To prevent transactions in different partitions from producing inconsistent

354 views • 23 slides
How to Memorize Numbers A brief summary of the Peg System 1. Numbers are very difficult to

How to Memorize Numbers A brief summary of the Peg System 1. Numbers are very difficult to

Dynamic Memory Workshop CA Srinivas Vakati | +91 9769064199 | Srinivas@srinivasvakati.com Techniques for Memorizing 1. Linking method / Story method 2. Memory Palace Method 3. Peg Method Rules of Memory ICU 1. Imagination/ Visualization

43 views • 3 slides
DISTRIBUTED STREAMING TEXT EMBEDDING METHOD => DISTRIBUTED TRAINING WITH PYTORCH SNU 2018 - 2

DISTRIBUTED STREAMING TEXT EMBEDDING METHOD => DISTRIBUTED TRAINING WITH PYTORCH SNU 2018 - 2

DISTRIBUTED STREAMING TEXT EMBEDDING METHOD => DISTRIBUTED TRAINING WITH PYTORCH SNU 2018 - 2 BIg Data and Deep Learning 2018. 12. 18 Final Project Team 1 , , , DISTRIBUTED STREAMING TEXT EMBEDDING

195 views • 17 slides
Electrical Method: Description of the system 3% resolution arXiv:1804.05941 [physics.ins-det]

Electrical Method: Description of the system 3% resolution arXiv:1804.05941 [physics.ins-det]

Electrical Method: Description of the system 3% resolution arXiv:1804.05941 [physics.ins-det] Performance of the system Dependency on V AC and V DC Dependency on wire length Electrical Method: Setup Connector for SBND boards About 40

541 views • 15 slides
Numerical method: systems 1 Equipment performance: dynamic and non-linear Condenser temp.: 20

Numerical method: systems 1 Equipment performance: dynamic and non-linear Condenser temp.: 20

Numerical method: systems 1 Equipment performance: dynamic and non-linear Condenser temp.: 20 C, 30 C, 40 C, 50 C heat pump boiler gas turbine fuel cell wind turbine photovoltaics Issues: dynamic response, conditions monitoring, hybrid

363 views • 21 slides
Study of Higgsinvisible using kinematic fit method applied jet energy resolution of ILD Yu

Study of Higgsinvisible using kinematic fit method applied jet energy resolution of ILD Yu

Study of Higgsinvisible using kinematic fit method applied jet energy resolution of ILD Yu Kato, J.Tian, T.Tanabe, S.Yamashita The Univ. of Tokyo The 55 th General Meeting of ILC Physics Subgroup Feb. 3, 2018 2018/2/3 Outline Study of

568 views • 40 slides
An efficient hybrid method for modeling lipid membranes with molecular resolution G.J.A. (Agur)

An efficient hybrid method for modeling lipid membranes with molecular resolution G.J.A. (Agur)

An efficient hybrid method for modeling lipid membranes with molecular resolution G.J.A. (Agur) Sevink, M. Charlaganov & J.G.E.M Fraaije Japan, 2010 Soft Matter Chemistry Group, Leiden University, The Netherlands Thanks to : C.D. Chau, A.V.

979 views • 30 slides
On the O (1 / k ) Convergence of Asynchronous Distributed Alternating Direction Method of

On the O (1 / k ) Convergence of Asynchronous Distributed Alternating Direction Method of

On the O (1 / k ) Convergence of Asynchronous Distributed Alternating Direction Method of Multipliers (ADMM) Ermin Wei Asu Ozdaglar Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science

606 views • 36 slides
Late Binding; OOP as a Racket Pattern Today Dynamic dispatch aka late binding aka virtual method

Late Binding; OOP as a Racket Pattern Today Dynamic dispatch aka late binding aka virtual method

Late Binding; OOP as a Racket Pattern Today Dynamic dispatch aka late binding aka virtual method calls Call to self.m2() in method m1 defined in class C can resolve to a method m2 defined in a subclass of C Most unique characteristic of

652 views • 11 slides
Outline Analysis of Algorithms Definition Aggregate Method Accounting Method

Outline Analysis of Algorithms Definition Aggregate Method Accounting Method

Outline Analysis of Algorithms Definition Aggregate Method Accounting Method Amortized Analysis Potential Method Examples : Binary Counter and Dynamic Table http://www.cp.eng.chula.ac.th/faculty/spj Cost of A Sequence of

332 views • 14 slides
Outline Analysis of Algorithms Definition Aggregate Method Accounting Method

Outline Analysis of Algorithms Definition Aggregate Method Accounting Method

Outline Analysis of Algorithms Definition Aggregate Method Accounting Method Amortized Analysis Potential Method Examples : Binary Counter and Dynamic Table http://www.cp.eng.chula.ac.th/faculty/spj Cost of A Sequence of

379 views • 21 slides
CCP Resolution: proposal for an EU Regulation and FSB Guidance on CCP Resolution 2ND EUROPEAN

CCP Resolution: proposal for an EU Regulation and FSB Guidance on CCP Resolution 2ND EUROPEAN

CCP Resolution: proposal for an EU Regulation and FSB Guidance on CCP Resolution 2ND EUROPEAN RECOVERY AND RESOLUTION SUMMIT Frankfurt, 5 July 2017 David Blache, Deputy Director for Resolution, ACPR (Resolution Authority, France) 1

292 views • 27 slides
- Richard E. Bellman Origins A method for solving complex problems by breaking them into

- Richard E. Bellman Origins A method for solving complex problems by breaking them into

Topic 25 Dynamic Programming "Thus, I thought dynamic programming was a good name. It was something not even a Congressman could object to. So I used it as an umbrella for my activities" - Richard E. Bellman Origins A method for

770 views • 37 slides
Shape Analysis Tal Zelmanovich Seminar in automatic tools for analyzing programs with dynamic

Shape Analysis Tal Zelmanovich Seminar in automatic tools for analyzing programs with dynamic

Shape Analysis Tal Zelmanovich Seminar in automatic tools for analyzing programs with dynamic memory 2013/2014B Subjects Introducing shape analysis TVLA method Cutpoint-free method Separation logic method Conclusion &

1.38k views • 70 slides
NPFL103: Information Retrieval (3) Index construction, Distributed and dynamic indexing, Index

NPFL103: Information Retrieval (3) Index construction, Distributed and dynamic indexing, Index

Index construction Distributed indexing Dynamic indexing Index compression NPFL103: Information Retrieval (3) Index construction, Distributed and dynamic indexing, Index compression Pavel Pecina Institute of Formal and Applied Linguistics

923 views • 66 slides
Distributed Queuing in Dynamic Networks Costas Busch Louisiana State University (Joint work

Distributed Queuing in Dynamic Networks Costas Busch Louisiana State University (Joint work

Distributed Queuing in Dynamic Networks Costas Busch Louisiana State University (Joint work with Gokarna Sharma) FOMC 2013 1 Dynamic Networks Fabian Kuhn, Nancy Lynch, Rotem Oshman STOC 2010 Communication Round (Broadcast Step) Each

1.21k views • 71 slides
Study of Higgsinvisible using kinematic fit method applied jet energy resolution of ILD Yu

Study of Higgsinvisible using kinematic fit method applied jet energy resolution of ILD Yu

Study of Higgsinvisible using kinematic fit method applied jet energy resolution of ILD Yu Kato The Univ. of Tokyo Asian Physics and Software Meeting Jan. 19, 2018 Goal of this study 2018/1/19 Study of Higgsinvisible using kin-fit

585 views • 35 slides
An Application Conflict Detection and Resolution Method for Smart Homes Miki Yagita 1st year

An Application Conflict Detection and Resolution Method for Smart Homes Miki Yagita 1st year

An Application Conflict Detection and Resolution Method for Smart Homes Miki Yagita 1st year masters course @ The University of Tokyo, Japan Supervisers: Assoc. Prof. Fuyuki Ishikawa, Prof. Shinichi Honiden 1 IoT - Internet of Things A

522 views • 25 slides
A Novel Method for Predicting the Power Output of Distributed Renewable Energy Resources

A Novel Method for Predicting the Power Output of Distributed Renewable Energy Resources

A Novel Method for Predicting the Power Output of Distributed Renewable Energy Resources Athanasios Aris Panagopoulos 1 Supervisor: Georgios Chalkiadakis 1 Technical University of Crete, Greece A thesis submitted to the Department of Electronic

561 views • 30 slides
The Method of Moderation For Solving Dynamic Stochastic Optimization Problems Christopher Carroll

The Method of Moderation For Solving Dynamic Stochastic Optimization Problems Christopher Carroll

The Method of Moderation For Solving Dynamic Stochastic Optimization Problems Christopher Carroll 1 Kiichi Tokuoka 2 Weifeng Wu 3 1 Johns Hopkins University and NBER ccarroll@jhu.edu 2 International Monetary Fund ktokuoka@imf.org 3 Fannie Mae

723 views • 46 slides

More recommend