INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Routing Protocols
10/16/2016

PROPRIETARY AND CONFIDENTIAL

This document contains trade secrets or otherwise confidential information owned by Calix, Inc. Access to and use of this information is strictly limited and controlled by Calix.
This document and the information contained herein may not be used, disclosed, or reproduced, in whole or in part, without the prior written authorization of Calix.  
The information contained in this presentation is not a commitment, promise, or legal obligation to deliver any material, code, or functionality.
The development, release, and timing of any features or functionality described for our products remain at our sole discretion.

Proprietary and Confidential 1

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

What is Routing?

• Finding path between source and destination which lie on

different networks

Position in OSI model

Proprietary and Confidential 2

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Fundamental Principle

• Longest prefix match

Example -
192.168.20.16/28 192.168.20.16/28

192.168.0.0/16
192.168.20.19

192.168.0.0/16

Destination IP – 192.168.20.19

Proprietary and Confidential 3

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Static v/s Dynamic Routing

• When a route is configured statically, to send the traffic to a

particular destination
• Typically used in small networks
• Dynamic routing is when you use routing protocols such as OSPF,
EIGRP, BGP etc. to figure out what path the traffic should take.
• Typically used in large networks

Proprietary and Confidential 4

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Classification

Dynamic
Routing

Interior Exterior
Gateway Gateway

Distance vector Link State

Hybrid Path vector
e.g. – RIP v1,v2 e.g. – OSPF, IS-
e.g. - EIGRP e.g. - BGP
IGRP IS

Proprietary and Confidential 5

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Distance vector vs Link state

Distance vector Link state

Sends the entire routing table Sends only link state information
Slow convergence Fast Convergence
Doesn’t know the network topology Knows the entire network topology
Susceptible to routing loops Less susceptible to routing loops
Simple implementation Complex implementation

Proprietary and Confidential 6

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Routing
Administrative Distance – It is the reliability of a routing protocol.

Protocol Administrative
Distance
Static route out an interface 1
External BGP 20
Internal EIGRP 90
OSPF 110
Internal BGP 200

Proprietary and Confidential 7

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Routing
Metric – Cost values used by routers to determine the best path to a
destination network.
A metric can include –
1. Hop count
2. Latency
3. Bandwidth
4. MTU

Proprietary and Confidential 8

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Open Shortest Path First (OSPF)

Features

• Link state protocol

• Metric – Cost = 100Mbps/Bandwidth
• Administrative Distance - 110
• Fast convergence than distance vector protocols
• Supports authentication
• Supports logical grouping of network segments
• Supports CIDR and VLSM

Proprietary and Confidential 9

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Understanding OSPF areas

• Areas divide routers inside a single Autonomous System

• Easy for administration
• Each area has its own link state database
• All areas connected through a backbone area i.e. area 0

Proprietary and Confidential 10

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Understanding OSPF areas

Proprietary and Confidential 11

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

OSPF tables
Each router has 3 tables

1. Neighbor table – Consists of list of all the directly connected

routers

2. Topology table – Consists of all routes to reach each network

3. Routing table – Consists of the best possible path to reach a

network

Proprietary and Confidential 12

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

OSPF Adjacency

• Before routers could exchange information, they need to establish

adjacency

• Requirements for adjacency –

• Interfaces should be in the same subnet
• Different router IDs
• Routers in the same area
• Same authentication parameters

Proprietary and Confidential 13

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Route Calculation
Uses Dijkstra’s algorithm for calculating shortest path

Proprietary and Confidential 14

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Cost Calculation
Formula
• Cost = Reference bandwidth / Interface bandwidth
• Default reference bandwidth = 100Mbps

Bandwidth OSPF Cost

40 Gbps 1
1 Gbps 1
10 Mbps 10
1.54 Mbps 64
768 Kbps 133

Proprietary and Confidential 15

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Link State Advertisement (LSA)

Proprietary and Confidential 16

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Important Terminology
Designated Router (DR) and Backup Designated Router (BDR)

• Election takes place on each multi-access broadcast network

(LAN)
• Router with the highest OSPF priority is elected as a DR
• Default priority – 1
• In case of tie, a router with the highest router ID wins
• Router with the second highest priority becomes BDR

Proprietary and Confidential 17

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

DR & BDR on Broadcast Multi-access Network

Proprietary and Confidential 18

INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Let’s configure!!!

Proprietary and Confidential 19

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Topology

Proprietary and Confidential 20

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Steps
1. Configure all the interfaces with IP address, subnet masks

2. Advertise the subnets with ‘network’ command

 network ‘subnetToBeAdvertised’ ‘WildcardMask’ ‘area number’

Proprietary and Confidential 21

 INTERNAL — DO NOT DISTRIBUTE OR COPY FOR ANYONE OUTSIDE CALIX

Assignment

Proprietary and Confidential 22