OSPF and BGP State Migration for Resource-portable IP router

Slides:



Advertisements
Similar presentations
Network Layer4-1 Hierarchical Routing scale: with 200 million destinations: r can’t store all dest’s in routing tables! r routing table exchange would.
Advertisements

Lecture 9 Overview. Hierarchical Routing scale – with 200 million destinations – can’t store all dests in routing tables! – routing table exchange would.
Path Vector Routing NETE0514 Presented by Dr.Apichan Kanjanavapastit.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
4a-1 CSE401: Computer Networks Hierarchical Routing & Routing in Internet S. M. Hasibul Haque Lecturer Dept. of CSE, BUET.
Routing.
14 – Inter/Intra-AS Routing
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
Transport Layer 3-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012  CPSC.
14 – Inter/Intra-AS Routing Network Layer Hierarchical Routing scale: with > 200 million destinations: can’t store all dest’s in routing tables!
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Network Layer introduction 4.2 virtual circuit and datagram networks 4.3 what’s inside a router 4.4 IP: Internet Protocol  datagram format  IPv4.
Introduction 1 Lecture 21 Network Layer (Routing Activity) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science &
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
RSC Part II: Network Layer 6. Routing in the Internet (2 nd Part) Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are,
Introduction 1 Lecture 19 Network Layer (Routing Protocols) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science &
CS 3830 Day 29 Introduction 1-1. Announcements r Quiz 4 this Friday r Signup to demo prog4 (all group members must be present) r Written homework on chapter.
10-1 Last time □ Transitioning to IPv6 ♦ Tunneling ♦ Gateways □ Routing ♦ Graph abstraction ♦ Link-state routing Dijkstra's Algorithm ♦ Distance-vector.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
Network Layer r Introduction r Datagram networks r IP: Internet Protocol m Datagram format m IPv4 addressing m ICMP r What’s inside a router r Routing.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Network Layer4-1 Routing Algorithm Classification Global or decentralized information? Global: r all routers have complete topology, link cost info r “link.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—6-1 Scaling Service Provider Networks Scaling IGP and BGP in Service Provider Networks.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Border Gateway Protocol. Intra-AS v.s. Inter-AS Intra-AS Inter-AS.
Network Layer4-1 Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol.
Routing in the Internet
14 – Inter/Intra-AS Routing
Homework 4 Out: Fri 2/24/2017 In: Fri 3/10/2017.
Chapter 5 Network Layer: The Control Plane
Chapter 4: Network Layer
NAT – Network Address Translation
CS 5565 Network Architecture and Protocols
BGP 1. BGP Overview 2. Multihoming 3. Configuring BGP.
Homework 4 Out: Fri 2/26/2016 In: Fri 3/11/2016.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
ICMP ICMP – Internet Control Message Protocol
Chapter 4: Network Layer
Chapter 4 Network Layer A note on the use of these ppt slides:
COMP 3270 Computer Networks
Dynamic Routing Protocols part2
CS4470 Computer Networking Protocols
Introduction to Internet Routing
Routing.
Dynamic Routing Protocols
Dynamic Routing and OSPF
Part 4: Network Layer Part B: The Internet Routing Protocols
Chapter 4: Network Layer
Chapter 4: Network Layer
Dynamic Routing Protocols
Chapter 4: Network Layer
Chapter 4: Network Layer
CMPE 252A : Computer Networks
BGP Instability Jennifer Rexford
Chapter 4: Network Layer
Computer Networks Protocols
Routing.
Network Layer: Internet Inter-Domain Routing
Chapter 4 Network Layer A note on the use of these ppt slides:
Presentation transcript:

OSPF and BGP State Migration for Resource-portable IP router 2016/12/21 105598065 Speaker:Cheng-Yu Wang (王承宇) Advisor:Ke, Kai-Wei

Outline Introduction Motivation Explain Keywords → Resource-portable IP router、OSPF、BGP OSPF Sniffing & BGP masquerade Implementation & experiment result Conclusion Reference

Introduction Resource-portable IP routers have the potential for achieving a sustainable network by functioning as a shared backup router. Current commercial routers was not virtualized but implemented as a proprietary hardware and software.

Motivation carrier network should provide high-grade functions such as node-internal redundancy or in-service software upgrade (ISSU), which are currently implemented only in commercial-based routers. Even if virtual machine-based technologies become mainstream, deploying them to the current network may be gradual

Resource-portable IP Router ? Network virtualization, such as ETSI network functions virtualization (NFV) , is a promising technology for next generation networks. resource portability of Internet protocol (IP) routers (e.g., routing state, traffic state, configurations) is expected to result in a sustainable network that has high availability and/or high maintainability

OSPF ? - Hierarchical routing Scale:with 600 million destinations can’t store all dest’s in routing tables! routing table exchange would swamp links! administrative autonomy each network admin may want to control routing in its own network

OSPF ? - Hierarchical routing (cont.) aggregate routers into regions, “autonomous systems”(AS) routers in same AS run same routing protocol routers in same AS run same routing protocol “intra-AS” routing protocol

OSPF ? - Hierarchical routing (cont.) forwarding table configured by both intra-and inter-AS routing algorithm intra-AS sets entries for internal dests inter-AS & intra-AS sets entries for external dests

OSPF ? – Open Shortest Path First uses link state algorithm 1. LS packet dissemination 2. topology map at each node 3. route computation using Dijkstra’s algorithm

OSPF ? – Open Shortest Path First (cont.) area border routers:“summarize” distances to nets in own area, advertise to other Area Border routers. Advertise = broadcast

OSPF ? – Open Shortest Path First (cont.) Backbone routers:run OSPF routing limited to backbone. boundary routers:connect to other AS’s. Advertise = broadcast

BGP ? – Border Gateway Protocol “glue that holds the Internet together” BGP provides each AS a means to : eBGP : obtain subnet reachability information from neighboring ASs. iBGP : propagate reachability information to all AS-internal routers.

BGP ? – Border Gateway Protocol (cont.) using eBGP session between 3a and 1c, AS3 sends prefix reachability info to AS1. 1c can then use iBGP do distribute new prefix info to all routers in AS1 1b can then re-advertise new reachability info to AS2 over 1b-to-2a eBGP session

OSPF Sniffing & BGP masquerade transport paths configured from adjacent routers to the act router are switched from adjacent routers to the backup router.

OSPF Sniffing & BGP masquerade (cont.) logical topology in the IP layer does not change, we can reuse the same configuration of the act router for the backup router.

OSPF Sniffing & BGP masquerade (cont.) For OSPF state migration, the under-layer device duplicates the traffic For BGP state migration, the SDN controller distributes proper BGP routes to the backup router. The SDN controller has a different function called BGP peer masquerade

OSPF Sniffing With OSPF sniffing, the control packets from the adjacent router to the act router is duplicated at the duplication and blocking point Then, the control packets from the adjacent router to the act router are also sent to the backup router.

OSPF Sniffing (cont.) Inversely, the control packets sent from the backup router to the adjacent router are dropped at the duplication and blocking point for consistency of data exchange

OSPF Sniffing (cont.) same IP addresses with the act router are given to the backup router the router ID (RID) of the adjacent router is set so that the RID is larger than that of the act router to regard the adjacent router as the master router

OSPF Sniffing (cont.) 4 steps: 1. graceful restart, which restarts the software of the router while maintaining the current routing table

OSPF Sniffing (cont.) 2. After the adjacent router receives the DD packet SID=#100 from the act router, the adjacent router sends the DD packet, which has a different SID (e.g., #300), to the act router. At this point, the DD packet, whose SID is #300, is also sent to the backup router by the duplication and blocking point.

OSPF Sniffing (cont.) 3. The act router sends the acknowledgement packet, whose SID is #300, to the adjacent router. The packets from the backup router to the adjacent router are constantly dropped during this time.

OSPF Sniffing (cont.) 4. the adjacent router sends the reply packets to the act router and the packets are duplicated to the backup router

BGP peer masquerade route collector in the SDN controller collects the state of routing table generated by OSPF and BGP from the adjacent router. the route server in the SDN controller performs BGP peer masquerade.

BGP peer masquerade (cont.) 8 steps: 1. The BGP peering #1 between the adjacent router and act router using the loopback IP address of each router is established, and BGP routes are exchanged between them

BGP peer masquerade (cont.) 2. route collector in the SDN controller listens for the OSPF control packets and creates the LSDB in the SDN controller

BGP peer masquerade (cont.) 3. The route collector also collects the BGP routes by establishing BGP peering #2 between the route collector and adjacent router

BGP peer masquerade (cont.) 4. the OSPF state of the act router is migrated to the backup router 5. For the backup router, the static route bound for the loopback IP address of the route server is configured

BGP peer masquerade (cont.) 4. the OSPF state of the act router is migrated to the backup router 5. For the backup router, the static route bound for the loopback IP address of the route server is configured

BGP peer masquerade (cont.) 6. BGP peering #1’ between the route server in the SDN controller and the backup router is established

BGP peer masquerade (cont.) 7. After the route exchange using BGP peering #1’ finishes, the static route bound for “lo0” in the backup router is deleted

BGP peer masquerade (cont.) 8. transport paths are switched from adjacent routers to the act router and from adjacent routers to the backup router

Implementation The main components of the SDN controller are the route collector and route server. The databases of the SDN controller consist of a configuration database and state database.

Implementation (Cont.) State DB IP topology is collected by the route collector as the LSDB RIBs are created from the functions of the SDN controller traffic information is collected from the NMS/EMS

Implementation (Cont.) The SDN controller, which can easily cooperate with NMS/EMS, has the traffic state of both the migration origin (act router) and migration destination (backup router).

Implementation (Cont.) For the addressing of a network, the same addressing is given to the act router and backup router, and the same loopback IP address (e.g., lo0:102.168.0.1) is given to the adjacent router and route server.

Experiment Aim For visibility of OSPF state migration, we measured the sequence number of DD packets from each router, and plot their transition to visualize our proposed sequence.

Experiment Aim (cont.) For BGP state migration, we captured the inside of the BGP peers (#1 and #1’) and verified their correspondence.

Experiment Result

Experiment Result (cont.)

Experiment Result (cont.)

Experiment Result (cont.)

Experiment Result (Cont.) BGP control packets (BGP UPDATE message) in BGP peers #1 and #1’ using the wireshark From analyzing the network layer reachability information (NLRI) in the BGP UPDATE message, we confirmed that the NLRI in peer #1 is identical to that in peer #1’

Experiment Result (Cont.) Since the act router runs in the process of OSPF and BGP state migration, we especially care the switchover time of under layer device (path).

Experiment Result (Cont.) [planned maintenance] the configuration time of L2 port blocking is about a few seconds. the switchover time of optical device using TL1 interface, and it takes about 140 milliseconds. Both of L2 switch and optical device are applicable to the planned maintenance

Experiment Result (Cont.) [unpredictable failure] recovery within 50 milliseconds is generally required, and the current method cannot satisfy the requirement.

Conclusion IP state migration is achieved by control packet sniffing of OSPF using traffic duplication function of transport layer, and BGP peer masquerade using the external SDN controller For future work, therefore, we will apply our method to an unpredictable failure restoration scenario in which faster migration is required.

References Shohei Kamamura, Hiroki Mori, Daisaku Shimazaki, Kouichi Genda, and Yoshihiko Uematsu, “OSPF and BGP State Migration for Resource-portable IP Router”, Conference: GLOBECOM December 2015