lossless migrations of link state igps
play

Lossless Migrations of Link-State IGPs Laurent Vanbever, Student - PowerPoint PPT Presentation

May 29, 2023 •110 likes •1.06k views

Lossless Migrations of Link-State IGPs Laurent Vanbever, Student Member, IEEE, Stefano Vissicchio, Cristel Pelsser, Pierre Francois, Member, IEEE, and Olivier Bonaventure, Member, IEEE Seminar in Distributed Computing Jochen Zehnder Table of

  1. Lossless Migrations of Link-State IGPs Laurent Vanbever, Student Member, IEEE, Stefano Vissicchio, Cristel Pelsser, Pierre Francois, Member, IEEE, and Olivier Bonaventure, Member, IEEE Seminar in Distributed Computing Jochen Zehnder

  2. Table of Contents 1. Topology of the Internet 2. Migration Problem 3. Evaluation 4. Summary 5. Q&A 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 2 / 32

  3. Topology of the Internet � 3 / 32

  4. Topology of the Internet http://www.cisco.com/c/en/us/td/docs/ios/12_2sr/12_2srb/feature/guide/tbgp_c/brbclns.html 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 4 / 32

  5. Autonomous System (AS) “An AS is a connected group of one or more IP prefixes run by one or more network operators which has a SINGLE and CLEARLY DEFINED routing policy.” (RFC 1930) 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 5 / 32

  6. Autonomous System (AS) • groups of IP prefixes • e.g. AS559 (ETH-NET) • 129.132.0.0/16 � 6 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  7. Autonomous System (AS) • groups of IP prefixes • e.g. AS559 (ETH-NET) • 129.132.0.0/16 • two types of protocols • Border Gateway Protocol (BGP) • Interior Gateway Protocol (IGP) � 6 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  8. Interior Gateway Protocol • flat vs. hierarchical • flat: forward packets along the shortest path • hierarchical: divided into zones � 7 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  9. Interior Gateway Protocol • flat vs. hierarchical • flat: forward packets along the shortest path • hierarchical: divided into zones • route summarization • for hierarchical IGP • zone announces available prefixes and • length of the path � 7 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  10. Migration Problem � 8 / 32

  11. next-hop function • next-hop function • : router • : destination 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 9 / 32

  12. next-hop function • next-hop function • : router • : destination • next router towards d 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 9 / 32

  13. next-hop function • next-hop function • : router • : destination • next router towards d • does not have to be 1 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 9 / 32

  14. Migration Loop 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 10 / 32

  15. Migration Loop 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 10 / 32

  16. Migration Loop 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 10 / 32

  17. Migration Loop 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 10 / 32

  18. Migration Loop 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 10 / 32

  19. Migration Loop 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 10 / 32

  20. Migration Problem • given unicast IP network 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 11 / 32

  21. Migration Problem • given unicast IP network • replace IGP configuration • from to 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 11 / 32

  22. Migration Problem • given unicast IP network • replace IGP configuration • from to • minimal configuration changes 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 11 / 32

  23. Migration Problem • given unicast IP network • replace IGP configuration • from to • minimal configuration changes • no migration loops � 11 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  24. Migration Scenarios scenario IGP configuration changes protocol protocol replacement flat2hier zone introduction hier2flat zone removal hier2hier zone reshaping summarization summarization introduction/removal 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 12 / 32

  25. ships-in-the-night • run separate routing protocols on one router 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 13 / 32

  26. ships-in-the-night • run separate routing protocols on one router • share hardware and software resources 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 13 / 32

  27. ships-in-the-night • run separate routing protocols on one router • share hardware and software resources • but do not interact on a protocol level 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 13 / 32

  28. Proposed methodology • Seamless IGP Migration Methodology 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 14 / 32

  29. Proposed methodology • Seamless IGP Migration Methodology 1. Compute a lossless router migration order 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 14 / 32

  30. Proposed methodology • Seamless IGP Migration Methodology 1. Compute a lossless router migration order 2. Introduce the final IGP configuration � 14 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  31. Proposed methodology • Seamless IGP Migration Methodology 1. Compute a lossless router migration order 2. Introduce the final IGP configuration 3. Monitor the final IGP status 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 14 / 32

  32. Proposed methodology • Seamless IGP Migration Methodology 1. Compute a lossless router migration order 2. Introduce the final IGP configuration 3. Monitor the final IGP status 4. Progressively migrate routers 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 14 / 32

  33. Proposed methodology • Seamless IGP Migration Methodology 1. Compute a lossless router migration order 2. Introduce the final IGP configuration 3. Monitor the final IGP status 4. Progressively migrate routers 5. Remove initial IGP configuration 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 14 / 32

  34. Router migration ordering • Given • initial and final next-hop functions • logical graph G • set of destinations D 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 15 / 32

  35. Router migration ordering • Given • initial and final next-hop functions • logical graph G • set of destinations D • Compute router migration • no forwarding loops in G for d ∈ D 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 15 / 32

  36. Router migration ordering • Router Migration Ordering Problem is NP-complete 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 16 / 32

  37. Router migration ordering • Router Migration Ordering Problem is NP-complete • is in NP 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 16 / 32

  38. Router migration ordering • Router Migration Ordering Problem is NP-complete • is in NP • Reduction from 3-SAT 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 16 / 32

  39. Router migration ordering • Router Migration Ordering Problem is NP-complete • is in NP • Reduction from 3-SAT • e.g. 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 16 / 32

  40. Router migration ordering • Router Migration Ordering Problem is NP-complete • is in NP • Reduction from 3-SAT • e.g. • is F satisfiable? � 16 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  41. Router migration ordering • given formula F � 17 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  42. Router migration ordering • given formula F • transform into migration ordering instance � 17 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  43. Router migration ordering • given formula F • transform into migration ordering instance • show that � 17 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  44. Router migration ordering • given formula F • transform into migration ordering instance • show that • F satisfiable ⇒ loop free migration ordering � 17 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  45. Router migration ordering • given formula F • transform into migration ordering instance • show that • F satisfiable ⇒ loop free migration ordering • F not satisfiable ⇒ no loop free migration ordering � 17 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder / 32

  46. Router migration ordering • central vertex P 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 18 / 32

  47. Router migration ordering • central vertex P • true: migrated before P 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 18 / 32

  48. Router migration ordering • central vertex P • true: migrated before P • false: migrated after P 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 18 / 32

  49. Router migration ordering 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 18 / 32

  50. Router migration ordering 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 18 / 32

  55. Loop enumeration Algorithm 05.03.2014 Seminar in Distributed Computing - Jochen Zehnder � 20 / 32

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

VIDEO SIGNALS Lossless coding g LOSSLESS CODING LOSSLESS CODING The goal of lossless image

VIDEO SIGNALS Lossless coding g LOSSLESS CODING LOSSLESS CODING The goal of lossless image

VIDEO SIGNALS Lossless coding g LOSSLESS CODING LOSSLESS CODING The goal of lossless image compression is to The goal of lossless image compression is to represent an image signal with the smallest possible number of bits without loss

783 views • 60 slides
Link State Routing Link State Routing Jean-Yves Le Boudec Fall 2009 1 Contents Contents 1.

Link State Routing Link State Routing Jean-Yves Le Boudec Fall 2009 1 Contents Contents 1.

COLE POLYTECHNIQUE FDRALE DE LAUSANNE Link State Routing Link State Routing Jean-Yves Le Boudec Fall 2009 1 Contents Contents 1. Link state flooding topology information finding the shortest paths (Dijkstra) 2. Hierarchical

783 views • 34 slides
Lossless compression in lossy compression systems Almost every lossy compression system

Lossless compression in lossy compression systems Almost every lossy compression system

Lossless compression in lossy compression systems Almost every lossy compression system contains a lossless compression system Lossy compression system Dequantizer Transform Lossless Lossless Inverse Quantizer Encoder Decoder

771 views • 29 slides
CS 457 Lecture 16 Routing Continued Spring 2010 Scaling Link-State Routing Overhead of

CS 457 Lecture 16 Routing Continued Spring 2010 Scaling Link-State Routing Overhead of

CS 457 Lecture 16 Routing Continued Spring 2010 Scaling Link-State Routing Overhead of link-state routing Flooding link-state packets throughout the network Running Dijkstras shortest-path algorithm Introducing hierarchy

534 views • 24 slides
Lossless compression B 0 U B 1 U 0 1 B 2 0 1 1 0 A

Lossless compression B 0 U B 1 U 0 1 B 2 0 1 1 0 A

Lossless compression B 0 U B 1 U 0 1 B 2 0 1 1 0 A B 0 1 0 1 U ! C R D CSCI 470: Web Science Keith Vertanen

670 views • 34 slides
Migrations, Brain Drain and Global Justice: What role for corporations? IX POLITEIA FORUM ON CSR

Migrations, Brain Drain and Global Justice: What role for corporations? IX POLITEIA FORUM ON CSR

GIULIA MEZZETTI Migrations, Brain Drain and Global Justice: What role for corporations? IX POLITEIA FORUM ON CSR Milan, 14 December 2012 In what way are CSR and international migrations related? NEGATIVE OBLIGATIONS Migrants' rights

265 views • 8 slides
Network layer Distributed Routing: Link State Routing Link State Routing A very frequently

Network layer Distributed Routing: Link State Routing Link State Routing A very frequently

IN2140: Introduction to Operating Systems and Data Communication Network layer Distributed Routing: Link State Routing Link State Routing A very frequently use routing protocol IS-IS (Intermediate System-Intermediate System) OSPF

239 views • 8 slides
Migrations in the 21 st Century 2015/2016 Two countries. Two schools. One community. Lisboa /

Migrations in the 21 st Century 2015/2016 Two countries. Two schools. One community. Lisboa /

Migrations in the 21 st Century 2015/2016 Two countries. Two schools. One community. Lisboa / Wien Migrations in the 21st Century The Project Questions Participants Guidelines Aims and objectives Project methodology

324 views • 18 slides
Lossless Congestion Control Motivation Control packet retransmissions, which is undesirable for

Lossless Congestion Control Motivation Control packet retransmissions, which is undesirable for

dirceu@ndrc.kyutech.ac.jp Dirceu Cavendish UCLA /KIT Lossless Congestion Control Motivation Control packet retransmissions, which is undesirable for networks and applications Lossless Congestion Control alike. Delay based LCC Benefits

291 views • 8 slides
Advertising MPLS labels in IGPs draft-gredler-rtgwg-igp-label-advertisement IETF86 Hannes

Advertising MPLS labels in IGPs draft-gredler-rtgwg-igp-label-advertisement IETF86 Hannes

Advertising MPLS labels in IGPs draft-gredler-rtgwg-igp-label-advertisement IETF86 Hannes Gredler March 2013 <hannes@juniper.net> Motivation and Rationale R-LFA implementation requires IS-IS LDP more tight integration of LDP and

178 views • 14 slides
Taming Wireless Link Fluctuations by Predictive Queuing Using a Sparse-Coding Link-State Model

Taming Wireless Link Fluctuations by Predictive Queuing Using a Sparse-Coding Link-State Model

Taming Wireless Link Fluctuations by Predictive Queuing Using a Sparse-Coding Link-State Model Stephen J. Tarsa , Marcus Comiter, Michael Crouse, Brad McDanel, HT Kung ACM MobiHoc, June 25, 2015 Hangzhou, CN 1 Summary & Results We predict

833 views • 25 slides
Overview q Review of theoretical routing algorithms v Link state & Dijkstras algorithm v

Overview q Review of theoretical routing algorithms v Link state & Dijkstras algorithm v

Smith College, CSC 249 March 8, 2017 1 Overview q Review of theoretical routing algorithms v Link state & Dijkstras algorithm v Distance vector & Bellman-Ford equation q Routing in the Internet v Implementation of Link-state and

739 views • 14 slides
Link State Routing Principles The Goal is to avoid the routing loops typical of DV routing and to

Link State Routing Principles The Goal is to avoid the routing loops typical of DV routing and to

Link State Routing Principles The Goal is to avoid the routing loops typical of DV routing and to scale to bigger networks and to varying topologies. 5-1 S38.121/RKa s-01 Open Shortest Path First(OSPF) is a recommended link state protocol for

580 views • 35 slides
8 TH GRADE PARENT NIGHT AND IGPS Individual Graduation Plans Class of 2022 Engaging Education

8 TH GRADE PARENT NIGHT AND IGPS Individual Graduation Plans Class of 2022 Engaging Education

8 TH GRADE PARENT NIGHT AND IGPS Individual Graduation Plans Class of 2022 Engaging Education Career Clusters Student choice in electives Individual Graduation Plans Driven by Goals for the Future Conference with student,

777 views • 30 slides
Integrating a database migration framework Jeff Trawick January 23, 2020 TriPython Triangle

Integrating a database migration framework Jeff Trawick January 23, 2020 TriPython Triangle

What are migrations? Integrating with deployment Alembic migrations for SQLAlchemy References Integrating a database migration framework Jeff Trawick January 23, 2020 TriPython Triangle Python Users Group What are migrations?

729 views • 44 slides
British Roots 1 Four Colonial Migrations as Clues to British Ancestry Martha Teeter, Davis, CA

British Roots 1 Four Colonial Migrations as Clues to British Ancestry Martha Teeter, Davis, CA

!"#$"#%& British Roots 1 Four Colonial Migrations as Clues to British Ancestry Martha Teeter, Davis, CA teeter@ucdavis.edu Main Migrations 1629-1775 2 ! The East Anglia Puritans, 1629 ! 1640 (about 21,000 immigrants) 1 ! The

489 views • 7 slides
September 11, 2019 5:30pm 7:30pm 2 Ingrid Jackson 3 Wilfred Wright KEY TERMS TERM

September 11, 2019 5:30pm 7:30pm 2 Ingrid Jackson 3 Wilfred Wright KEY TERMS TERM

September 11, 2019 5:30pm 7:30pm 2 Ingrid Jackson 3 Wilfred Wright KEY TERMS TERM DEFINITION The successful completion of a semester of a course Unit of Credit (18 weeks on 4x4 block) Enrolled in subject for 2 consecutive semesters

482 views • 22 slides
Jen-Hsun Huang NVIDIA Update September 6, 2011 NVIDIA Confidential Before We Start During

Jen-Hsun Huang NVIDIA Update September 6, 2011 NVIDIA Confidential Before We Start During

Jen-Hsun Huang NVIDIA Update September 6, 2011 NVIDIA Confidential Before We Start During todays presentations, we will discuss non -GAAP financial measures. You can find a reconciliation of these non-GAAP financial measures to GAAP

848 views • 38 slides
Saltmans Generic Galois Extensions and Problems in Field Theory David Harbater May 16, 2011

Saltmans Generic Galois Extensions and Problems in Field Theory David Harbater May 16, 2011

Saltmans Generic Galois Extensions and Problems in Field Theory David Harbater May 16, 2011 Motivation from Inverse Galois Problem Saltman, Advances in Math. (1982) Motivated by (inverse) Galois theory; has motivated further work. IGP: Is

614 views • 29 slides
ROUTING vs. FORWARDING www.sorin-schwartz.com ROUTERS EVOLUTION Serial processing Parallel

ROUTING vs. FORWARDING www.sorin-schwartz.com ROUTERS EVOLUTION Serial processing Parallel

IP Traffic Engineering by Sorin M. SCHWARTZ ROUTING vs. FORWARDING www.sorin-schwartz.com ROUTERS EVOLUTION Serial processing Parallel processing (S/W based routing) (routing / forwarding separation) Routing table Switch fabric (RT)

306 views • 6 slides
3 x Vollenhoven Friso van @fzk Samstag, 15. Oktober 11 Samstag, 15. Oktober 11 Samstag, 15.

3 x Vollenhoven Friso van @fzk Samstag, 15. Oktober 11 Samstag, 15. Oktober 11 Samstag, 15.

3 x Vollenhoven Friso van @fzk Samstag, 15. Oktober 11 Samstag, 15. Oktober 11 Samstag, 15. Oktober 11 Millions of these, each day 86.88.37.142 - - [26/Jul/2011:00:01:46 +0200] "GET /nl/index.html? Referrer=ADVNLGOO22901030000bsl

601 views • 35 slides
CS 598: Network Security Matthew Caesar February 26, 2013 1 Part 1: How the Internet works 2

CS 598: Network Security Matthew Caesar February 26, 2013 1 Part 1: How the Internet works 2

Lecture 5: Network Configuration and Defense CS 598: Network Security Matthew Caesar February 26, 2013 1 Part 1: How the Internet works 2 How can two hosts communicate? 0.7 Volts -0.7 Volts Encode information on modulated Carrier

1.02k views • 84 slides
Building interdom ain traffic engineering tools Steve UHLIG suh@ info.ucl.ac.be

Building interdom ain traffic engineering tools Steve UHLIG suh@ info.ucl.ac.be

Building interdom ain traffic engineering tools Steve UHLIG suh@ info.ucl.ac.be http://www.info.ucl.ac.be/~suh/ Universit catholique de Louvain, Belgium 1/12 Internet architectures W G, Cam bridge (M A), 26/1/05 Context 2/12

140 views • 12 slides
QGP from the quantum ground-state of QCD? beautiful math or New Physics of QCD? Roman

QGP from the quantum ground-state of QCD? beautiful math or New Physics of QCD? Roman

QGP from the quantum ground-state of QCD? beautiful math or New Physics of QCD? Roman Pasechnik 1 Summary: stages of the micro Big Bang L eff / 4 ( 10 3 ) L eff / 4 ( 10 3 ) L eff / 4 ( 10 3 ) 1.0

511 views • 18 slides

More recommend