3 Routing Protocols

ROUTING PROTOCOLS
EE 318 & EE 317 Data Communications Computer Networks

Outline
 Router Fundamentals
 Static Routing
 Dynamic Routing Protocol
 Internet Routing Protocols
 Border Gateway Protocol (BGP)
 RIP and RIPv2
 OSPF (Open Shortest Path First) Routing Protocol
 Hybrid Protocols –EIGRP (Enhanced Interior Gateway
Routing Protocol)
Router Fundamentals
 Special type of computer
 Connect and allow communication between two networks
 Determine the best path through the network
 Generally have two connection types:

 WAN connection (connection to ISP)
 LAN connection
Router Fundamentals
 A router passes data between multiple networks.
 It works at the OSI Network Layer3

 Must be able to understand the data packets so that it can route
them to their destination.
 Routers attempt to send packets from their source to

their destination in the fastest way possible
 Not always the absolute shortest path.
Routing
 Routers send packets according to the available routes
between networks and try to determine the shortest
possible route at any given time.
 Achieved using a routing table
All possible routes the router is Information on which

aware of connections lead to particular
groups of addresses
Routing Table
Priorities for connections to be Rules for handling both routine

used and special cases of traffic
Routing
 Process to forward packets to destination networks using
a routing table for finding best path to destination
 Routing tables are dynamic

 Updated by routing protocols such as Routing Information
Protocol (RIP) or Open Shortest Path First (OSPF) that
constantly pass messages between routers.
 The router consults them to determine whether or not it has a
route to a particular destination address.
 The routing table can be as simple as a half-dozen lines of

code in small routers
 Can grow to massive size and complexity in very large routers
that handle the bulk of Internet traffic.
Interplay Between Routing, Forwarding
Routing algorithm determines
Routing Algorithm
end-end-path through network
Forwarding table determines
Local Forwarding Table
Destination AddressOutput Link
local forwarding at this router
address-range 1 3
address-range 2 2
address-range 3 2
address-range 4 1
IP destination address in
arriving packet’s header
1
3 2
Routing Algorithm Classification
All routers have complete
topology, link cost info
Global
Link state
algorithms
Global or
Router knows physically-
Decentralized connected neighbors, link
information costs to neighbors
Iterative process of
Decentralized computation, exchange of
info with neighbors
Classification Distance vector
algorithms
Routes change
Static slowly over time
Static or Periodic
Dynamic update
Routes change
Dynamic more quickly
In response to
link cost
changes
Routing in the Global Internet
 A route propagation protocol allows one router to
exchange routing information with another
 However, such a scheme cannot scale to the entire

Internet
 If a router in the Internet attempted to exchange routing
information with all other routers, the resulting traffic would
overwhelm the Internet
The
Internet
uses a
routing
hierarchy
At least one router

Routers
(possibly more) in
each group To limit and
networks in
summarizes the routing the Internet
information before
passing it to other traffic are divided
into groups
groups
All routers
within a
group
exchange
routing
information
 The designers of the Internet routing system did not
dictate an exact size nor did they specify an exact data
representation or protocol
 Instead, the designers purposefully kept the architecture
flexible enough to handle a wide variety of organizations
 To accommodate organizations of various size

 The designers avoided specifying a min or max size for a group
 To accommodate arbitrary routing protocols

 The designers decided to permit each organization to choose a
routing protocol independently
Autonomous System Concept
 Term Autonomous System (AS) to specify groups of
routers
 One can think of an AS as a contiguous set of networks and
routers all under control of one administrative authority
 The choice of AS size can be made for economic,

technical, or administrative reasons
 Another reason for a specific size arises from the routing

protocol to be used
 A protocol may generate excessive routing traffic when used on
many routers
 routing traffic may grow as the square of the number of routers

Autonomous System
Autonomous System
Collection of networks/routers
Share a common routing

strategy
Viewed as a single entity from

the outside world
Best Path and Metric
 There will be multiple path to same destination
 Best path is selected by the routing protocol, based on a

specific value (metric)
 Each protocol uses its own rules and metrics to build and
update routing tables
 Metric is used to measure the distance to the destination

network
 Lowest metric = best path, placed in routing table
Best Path and Metric
Hop count:
counts the
number of
Cost: routers a
determined packet must Bandwidth
by IOS or traverse : preferring
administrator the path
to indicate with highest
preference for bandwidth
a route
Metrics
Reliability Load:
: probability traffic
of a link utilization
failure Delay: on a link
time for a
packet to
traverse a
path
Path Determination
 The process of how the router determines which path to
use when forwarding a packet
Directly connected
• Forwarded directly
to the destination
No route Remote network

determined
• Forwarded to
• Packet discarded, another router
ICMP unreachable
sent
Graph Abstraction
Graph: G = (N,E)
N = set of routers = { u, v, w, x, y, z }
E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) }
Note: Graph abstraction is useful in other network contexts, e.g.,

P2P, where N is set of peers and E is set of TCP connections
Graph Abstraction: Costs
c(x,x’) = cost of link (x,x’)

e.g., c(w,z) = 5
Cost could always be 1, or

inversely related to bandwidth, or
inversely related to congestion
Cost of path (x1, x2, x3,…, xp) = c(x1, x2) + c(x2, x3) + … + c(xp-1, xp)
What is the least-cost path between u and z ?

Routing algorithm: Algorithm that finds that least cost path
Outline
 Static Routing
 RIP and RIPv2
Routing Protocol)
Static Routing
 Configured manually
 Specifies network address and subnet mask of remote

network, and IP address of next hop router or exit
interface
 Use static routes when:

 Network only consists of few routers
 Network is connected to Internet only through one ISP
Static Routing
 Static routing is straightforward and easy to specify
 It does not require extra routing software
 It does not consume bandwidth
 No CPU cycles are required to propagate routing information
 However, static routing is relatively inflexible

 It cannot accommodate network failures or changes in topology
 Most hosts use static routing

 Especially in cases where the host has one network connection
and a single router connects the network to the rest of the
Internet
Static Routing
 Static routing forwarding table is created before the
system starts to forward packets
 It does not change entries, unless manually altering them
Static routing and default

routes do not suffice for
most routers – use is
Typical connection to the Internet
limited to special
configurations
Static forwarding table used

Static Routing
 A static table with two entries suffices for a typical host
 One entry specifies the address of the directly connected
network
 The other entry specifies that router R1
 provides a default route for all other destinations
When an application generates a When a datagram is destined for any

datagram for a computer on the local other destination in the Internet
net (e.g., a local printer) • The 2nd entry in the table directs IP to send the
• The first entry in the forwarding table directs IP datagram to the router, R1
to deliver the datagram directly to its destination
Static Routing
Advantages Disadvantages
• Minimal CPU • Configuration and
processing maintenance is time
• Easy to configure consuming
• Easier for administrator • Does not scale well with
to understand growing networks
• Requires complete
knowledge of the whole
network for proper
implementation
Outline
 Static Routing
 RIP and RIPv2
Routing Protocol)
Dynamic Routing
 Added to routing table by using a dynamic routing
protocol
 Used by routers to share information about the

reachability and status of remote networks
 Perform several activities:

 Network discovery
 Updating and maintaining routing tables
Dynamic Routing
 Most routers use dynamic routing
 But in some exceptional cases static routing can be used
 When two ISPs interconnect, both need to exchange

routing information dynamically
 Each time an ISP adds a new customer's network the
information must be passed throughout the Internet
 A manual process is far too slow to accommodate network
failures and congestion in the Internet
Dynamic Routing
To insure
that each
datagram
follows an
optimum
route
Dynamic routing Route the software

begins exactly like propagation communicates
static routing by software runs on with other
loading an initial the system & systems to learn
set of routes into a continuously optimum routes
forwarding table updates the to each
when the system forwarding destination
boots table
It continually
checks for
network
failures that
cause routes
to change
Dynamic Routing
Advantages Disadvantages
• Less administrative • Router resources are
overhead when adding used (CPU cycles,
or deleting a network memory and link
• Protocols automatically bandwidth)
react to the topology • More administrator
changes knowledge is required
• More scalable for configuration,
verification and
troubleshooting
Outline
 Static Routing
 RIP and RIPv2
Routing Protocol)
Internet Routing Protocols
 Routing protocols can be classified into different groups
according to their characteristics
 Interior Gateway Protocols (IGP)
 Used by the routers within AS to exchange routing information
 It is easy to install and operate
 May limit the size/routing complexity of AS
 Exterior Gateway Protocols (EGP)

 Used by a router within an AS to exchange routing info with a router
in another AS
 Usually more complex to install and operate
 Offers more flexibility and lower overhead
 Implements policy constraints that allow a system manager to
determine exactly the info released outside the organization
Internet Routing Protocols
Intra-AS vs Inter-AS Routing
Policy Scale Performance
• Inter-AS: Admin • Hierarchical routing • Intra-AS: can focus

wants control over saves table size, on performance
how its traffic reduced update
routed, who routes traffic • Inter-AS: policy
through its net. may dominate over
performance
• Intra-AS: Single
admin, so no policy
decisions needed
Internet Gateway Protocols
Distance vector
• Determines the direction
and distance to any link
in the internetwork
Classes
of IGP Link-state
• Recreates the exact
topology of the entire
internetwork
Link State Routing Protocol
Complex
database of
topology
More information
Knowledge
memory
of the
and
entire
processor
network
overhead
Features
Uses SPF
Fast to
Convergence calculate
Updates the best
when path
changes in
the
topology
occurs
A Link-State Routing Algorithm
Dijkstra’s algorithm
 Network topology, link costs Notations
known to all nodes
 c(x,y): link cost from node x to
 Accomplished via “link state y; = ∞ if not direct neighbors
broadcast”
 All nodes have same info  D(v): current value of cost of
 Computes least cost paths path from source to destination v
from one node (source) to all
other nodes  p(v): predecessor node along
 Gives forwarding table for that
path from source to v
node
 Iterative: After k iterations,
 N': set of nodes whose least cost
path definitively known
know least cost path to k’s
destination
Dijsktra’s Algorithm
Dijsktra’s Algorithm Example
Notes:
❖ construct shortest path tree by
tracing predecessor nodes
❖ ties can exist (can be broken
arbitrarily)
Steps N’
0
1
2
3
4
5
Steps N’
0
1
2
3
4
5
6
7
Distance Vector Routing Protocol
Periodic
updates
Distance is
defined in
Slow
terms of a
convergence
metric, such
as hop count
Features
Add Routing
distances table from
before directly
passing it connected
to other neighbor
neighbors routers
Distance Vector Algorithm
Bellman-Ford equation (dynamic programming)
let
𝑑𝑥(𝑦) = 𝑐𝑜𝑠𝑡 𝑜𝑓 𝑙𝑒𝑎𝑠𝑡 − 𝑐𝑜𝑠𝑡 𝑝𝑎𝑡ℎ 𝑓𝑟𝑜𝑚 𝑥 𝑡𝑜 𝑦
then
𝑑𝑥 (𝑦) = min𝑣 {𝑐(𝑥, 𝑣) + 𝑑𝑣 (𝑦)
cost from neighbor v to destination y

cost to neighbor v
min taken over all neighbors v of x
Bellman-Ford Example
Determine the min path

𝑑𝑣 𝑧 = 5, 𝑐 𝑢, 𝑣 = 2
cost from u to z 𝑑𝑥 𝑧 = 3, 𝑐 𝑢, 𝑥 = 1
𝑑𝑤 𝑧 = 3, 𝑐 𝑢, 𝑤 = 5
According to B-F equation:

∴ 𝑑𝑢(𝑧) = min{𝑐(𝑢, 𝑣) + 𝑑𝑣 (𝑧),
𝑐(𝑢, 𝑥) + 𝑑𝑥 (𝑧),
𝑐(𝑢, 𝑤) + 𝑑𝑤(𝑧) }
= min 2 + 5, 1 + 3, 5 + 3
∴ 𝑑𝑢 𝑧 = 4
Node achieving minimum is next hop in shortest path, used in forwarding table
 𝐷𝑥 (𝑦) = estimate of least cost from x to y
 x maintains distance vector 𝑫𝑥 = [𝐷𝑥 𝑦 : y ∈ 𝑁]
 Node x:
 Knows cost to each neighbor v: c(x,v)
 Maintains its neighbors’ distance vectors. For each neighbor v, x
maintains 𝑫𝑦 = [𝐷𝑦 𝑦 : y ∈ 𝑁]
From time-to-time, each

node sends its own distance
vector estimate to
neighbors
Key
Idea When x receives new DV
estimate from neighbor, it
updates its own DV using
B-F equation: 𝐷𝑥 (𝑦) =
min𝑣 {𝑐(𝑥, 𝑣) + 𝐷𝑣 (𝑦)
❖ Under minor, natural conditions, the estimate Dx(y)

converge to the actual least cost dx(y)
Iterative, Asynchronous
Each local iteration caused by:
Wait for
 Local link cost change If DV to any
(change in
destination
local link
 DV update message from has
cost or
changed,
neighbor message
notify
from
neighbors
neighbor)
Distributed
Each node notifies neighbors Recompute
estimates
only when its DV changes
 Neighbors then notify their
neighbors if necessary
𝑐 𝑥, 𝑦 + 𝐷𝑦 𝑧 ,
𝐷𝑥 𝑧 = min
𝑐 𝑥, 𝑧 + 𝐷𝑧 𝑧
= min 2 + 1, 7 + 0 = 3
𝑐 𝑥, 𝑦 + 𝐷𝑦 𝑦 ,
𝐷𝑥 𝑦 = min
𝑐 𝑥, 𝑧 + 𝐷𝑧 𝑦
= min 2 + 0, 7 + 1 = 2
Distance Vector: Link Cost Changes
Link cost changes:
✓ Node detects local link cost
change
✓ Updates routing info, recalculates
distance vector
✓ If DV changes, notify neighbors
Example
t0 : y detects link-cost change, updates its DV, informs its
neighbors.
t1 : z receives update from y, updates its table, computes new
least cost to x , sends its neighbors its DV.
t2 : y receives z’s update, updates its distance table. y’s least costs do not
change, so y does not send a message to z.
Distance Vector: Link Cost Changes
Link cost changes:
‼ Node detects local link cost change
‼ Bad news travels slow
‼ 44 iterations before algorithm
stabilizes
Poisoned Reverse:
t0 : y detects link-cost change, updates its DV, informs its neighbors
and continue to directly to x, with Dz(x) is set to infinity
t1 : z receives update from y, updates its table, computes new least cost
to x , shift to direct route to x , updates its neighbors its DV
t2 : y receives z’s update, updates its distance table. y’s least costs
changes and redirect through z
t3 : y sends update to neighbors saying Dy(x) is infinity
Comparison of LS and DV Algorithms
LS: with n nodes, E DV: exchange between
links, O(nE) neighbors only
messages needed to
be sent • convergence time varies
Message
DV: Complexity
• DV node can advertise
incorrect path cost
• each node’s table used by LS: O(n2) algorithm
others requires O(nE)
• error propagate thru messages
network
LS vs • may have oscillations
DV
Robustness:
what happens if
router Speed Of
malfunctions? Convergence
DV: convergence time

LS: varies
• node can advertise incorrect link cost • may be routing loops
• each node computes only its own table • count-to-infinity problem
Outline
 Static Routing
 RIP and RIPv2
Routing Protocol)
Internet Inter-AS routing: BGP
 BGP (Border Gateway Protocol): defines inter-
domain routing protocol
 It works as a “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.
 Determine “good” routes to other networks based on
reachability information and policy.
 Allows subnet to advertise its existence to rest of

Internet
Border Gateway Protocols
 Most widely used EGP
Routing among autonomous systems
• All routes are given as a path of AS

• No use of routing metrics
• Not able to provide details about routers within each AS
Provision for policies
• Allows sender & receiver to enforces policies

• Can restrict which route used for advertising to outsiders
Border Gateway Protocols
Facilities for transit routing
• Each AS classified as transit system if it agrees to pass traffic through to

another AS, else will be classified as Stub system
• Allows to distinguish between ISPs and other AS
• Allows a corporation to classify itself as a stub even if it is multi-homed
Reliable transport
• Uses TCP for all communication

• TCP ensures data arrives in the correct order & no missing data
BGP Basics
 BGP session: Two BGP routers/peers exchange BGP
messages:
 Advertising paths to different destination network prefixes (“path
vector” protocol)
 Exchanged over semi-permanent TCP connections
When AS3 advertises a prefix to AS1:

 AS3 promises it will forward datagrams
towards that prefix
 AS3 can aggregate prefixes in its advertisement
BGP
message
BGP Basics: Distributing Path Information
 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
 When router learns of new prefix, it creates entry for prefix in its
forwarding table.
Path Attributes and BGP routes
Gateway router
Advertised prefix receiving route
Two important
includes BGP advertisement
attributes:
attributes uses import policy
to accept/decline
• prefix + attributes = • AS-PATH: Contains • e.g., never route

“route” ASs through which through AS x
prefix advertisement • Policy-based routing
has passed: e.g., AS 67,
AS 17
• NEXT-HOP: Indicates
specific internal-AS
router to next-hop AS.
(may be multiple links
from current AS to
next-hop-AS)
BGP Route Selection
Router may learn about more than 1 route to
destination AS, selects route based on:
1. Local preference value attribute: Policy decision
2. Shortest AS-PATH
3. Closest NEXT-HOP router
4. Additional criteria
BGP Messages
 BGP messages exchanged between peers over TCP

connection
OPEN: opens
UPDATE:
TCP connection
advertises new
to peer and
path (or
authenticates
withdraws old)
sender
 BGP messages:
KEEPALIVE:
NOTIFICATION:
keeps
reports errors in
connection alive
previous
in absence of
message; also
UPDATES; also
used to close
ACKs OPEN
connection
request
How Does an Entry Get Into a Router’s
Forwarding Table?
Router becomes
Enter prefix-port aware of prefix
entry in • via BGP route
forwarding table advertisements
from other
routers
Determine router output

port for prefix
• Use BGP route selection to
find best inter-AS route
• Use OSPF to find best intra-
AS route leading to best
inter-AS route
• Router identifies router port
for that best route
BGP Routing Policy
❖ A,B,C are backbone provider networks

❖ W and Y are stub networks
❖ X is multi-homed stub network: Attached to 2 providers
▪ How will X be prevented from forwarding traffic from between B
and C?
▪ X will function as a stub network if it advertises (to its
neighbors B and C) that it has no paths to any other
destinations except itself
BGP Routing Policy
❖ A advertises path AW to B
❖ B advertises path BAW to X
❖ Should B advertise path BAW to C?

▪ No, because B gets no “revenue” for routing CBAW since neither
W nor C are B’s customers
▪ B wants to force C to route to W via A
▪ B wants to route only to/from its customers
Outline
 Static Routing
 RIP and RIPv2
Routing Protocol)
Routing Information Protocol (RIP)
 One of the first IGP used in the Internet
Routing within AS • Designed as IGP used to pass info among routers within AS
• Measures distance in network hops

Hop Count metric • Each network between Source & Destination counts as a hop
• Counts a directly connected network as one hop away
Unreliable transport • Uses UDP for message transfer
• Intended for use over LAN

Broadcast/Multicast • RIP allows message broadcast
delivery
• RIPv2 allows delivery via multicast
Support for CIDR & • RIPv2 includes an address mask with each DA
subnetting
Support for default • Allows a router to advertise a default route
route propagation
Distance vector • Uses the distance-vector approach to routing
algorithm
Passive version of • Allows a host to listen passively & update its forwarding table
hosts • Useful on networks where a host selects among multiple routers
RIP Algorithm
When a
message
arrived, if the
receiver does
Each Each entry in not have a
outgoing a RIP route to an
RIP software
message advertisemen advertised
uses the list of
contains an t consists of a destination
destinations
advertisemen
to update the pair OR if an
t that lists the
local (destination advertised
networks the
forwarding network, destination is
sender can
table when an distance) shorter than
reach along • distance is the the distance
advertisemen
with a number of of current
t is received
distance to hops to the route, the
each destination receiver
replaces its
route with a
route to the
sender
RIP (Routing Information Protocol)
 Included in BSD-UNIX distribution in 1982
 Distance vector algorithm
 Distance metric: # hops (max = 15 hops), each link has cost 1
 DVs exchanged with neighbors every 30 sec in response message (aka
advertisement)
 Each advertisement: list of up to 25 destination subnets (in IP addressing
sense)
Number of hops from source

router A to various subnets
RIP: Example
Routing table in router D

A-to-D advertisement
RIP: Example Dest Next Hops
w - 1
x - 1
z C 4
…. … ...
Routing table in router D
A 5
RIP: Link Failure, Recovery
If no advertisement heard after 180 sec →
Neighbor/link declared dead
▪ Routes via neighbor invalidated
▪ New advertisements sent to neighbors
▪ Neighbors in turn send out new advertisements (if tables
changed)
▪ Link failure info quickly propagates to entire net
RIP Table Processing
 RIP routing tables managed by application-level process called
route-d (daemon)
 Advertisements sent in UDP packets, periodically repeated
Advantages
 The chief advantage is simplicity
 Requires little configuration
 A manager merely starts RIP running on each router in the
organization and allows the routers to broadcast message to
one another
 Handles the propagation of a default route

 The organization needs to configure one of its routers to have a
default
 RIP propagates the default route to all other routers in the
organization – any datagram sent to a destination outside the
organization will be forwarded to the ISP
Disadvantages
 The size of a message is proportional to the number of
networks that can be reached
 Sending RIP messages introduces delay

 Means that route changes propagate slowly, one router at a
time
 Processing RIP messages consumes many CPU cycles

Outline
 Static Routing
 RIP and RIPv2
 OSPF (Open Shortest Path First) Routing
Protocol
Routing Protocol)
OSPF Protocol
 An IGP devised to satisfy the demand for a routing
protocol that can scale to large organization
Routing within AS • IGP used within AS
• Accommodate CIDR addressing by including 32-bit address mask

CIDR support with each address
Authenticated • A pair of routers using OSPF can authenticate each message
message exchange
Imported routes • Allows a router to introduce routes learned from another means
Link-state • Uses link-state algorithm

Algorithm
Support for metrics • Allows an administrator to assign a cost to each route
• Traditional link state routing is inefficient across a multi-access

network – All routers attached to the network broadcast link
Support for multi- status
access network • Optimizes this by designating a single router to broadcast on the
network
OSPF Protocol
 OSPF is more complex and more powerful than other
protocol due to hierarchical routing
 OSPF achieved this by allowing an AS to be partitioned

for routing purposes
 Allowing OSPF to scale in handling a large number of routers
than other IGPs
 A manager can divide routers & networks in an AS into subsets
known as areas
 Each router is configured to know the area boundary
 When an OSPF runs, routers within a given area

exchange link-state messages periodically
OSPF Protocol
 OSPF also allows communication between areas
 One router in each area is configured to communicate with a
router in one or more other area(s)
 The 2 routers summarize the learned routing info from other
routers within their respective area and exchange the summary
 Instead of broadcasting to all routers in the AS, OSPF

limits link-state broadcast to routers within area
OSPF (Open Shortest Path First)
 “Open”: Publicly available
 Uses link state algorithm

 LS packet dissemination
 Topology map at each node
 Route computation using Dijkstra’s algorithm
 OSPF advertisement carries one entry per neighbor
 Advertisements flooded to entire AS

 Carried in OSPF messages directly over IP (rather than TCP or
UDP
OSPF “Advanced” Features (Not in RIP)
Security: all OSPF
messages
authenticated (to
prevent malicious
intrusion)
Multiple same-cost
Hierarchical paths allowed
OSPF in large
• Only one path in RIP
domains.
Integrated unicast and

multicast support:
• Multicast OSPF (MOSPF)
uses same topology data
base as OSPF
Hierarchical OSPF
Boundary Router
Backbone Router
Backbone
Area
Border
Routers
Area 3
Internal
Routers
Area 1
Area 2
Hierarchical OSPF
 Two-level hierarchy: local area, backbone.
 Link-state advertisements only in area
 Each nodes has detailed area topology; only know direction
(shortest path) to nets in other areas.
 Area border routers: “summarize” distances to nets in

own area, advertise to other area border routers.
 Backbone routers: run OSPF routing limited to

backbone.
 Boundary routers: connect to other AS’s.

Outline
 Static Routing
 RIP and RIPv2
 Hybrid Protocols –EIGRP (Enhanced
Interior Gateway Routing Protocol)
EIGRP
 Enhanced Interior Gateway Routing Protocol (EIGRP) is
an interior gateway protocol suited for many different
topologies and media.
 In a well designed network, EIGRP scales well and

provides extremely quick convergence times with
minimal network traffic.
 An enhanced distance vector protocol, relying on the

Diffused Update Algorithm (DUAL) to calculate the
shortest path to a destination within a network.
EIGRP
 EIGRP builds a topology table from each of its neighbor's
advertisements and converges by either looking for a
likely loop-free route in the topology table, or, if it knows
of no other route, by querying its neighbors.
EIGRP must
provide:
A system where it sends

A process for querying only the updates needed
neighbors to find paths at a given time
to lost destinations • This is accomplished through
neighbor discovery and
maintenance
A process to clear bad

A way of determining
routes from the topology
which paths a router has
tables of all routers on
learned are loop-free
the network
SUMMARY
ROUTING PROTOCOLS
Router Fundamentals
You should be able to •
Static Routing
 Explain on the fundamentals in routing within a •
network • Dynamic Routing Protocol
 Apply static routing and dynamic routing in a • Internet Routing Protocols

network
• Border Gateway Protocol
 Differentiate between EGP and BGP, as well as (BGP)
eBGP and iBGP routing
• RIP and RIPv2
 Identify and characterize the routing protocols
• OSPF (Open Shortest Path
that is classified as eBGP and iBGP First) Routing Protocol
• Hybrid Protocols –EIGRP

(Enhanced Interior Gateway
Routing Protocol)

3 Routing Protocols

Diunggah oleh

Informasi Dokumen

Deskripsi Asli:

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

3 Routing Protocols

Diunggah oleh

Hak Cipta:

Format Tersedia

ROUTING PROTOCOLS

EE 318 & EE 317 Data Communications Computer Networks

 Connect and allow communication between two networks

 Determine the best path through the network

 Generally have two connection types:

 It works at the OSI Network Layer3

 Routers attempt to send packets from their source to

 Achieved using a routing table

All possible routes the router is Information on which

Priorities for connections to be Rules for handling both routine

 Routing tables are dynamic

 The routing table can be as simple as a half-dozen lines of

 However, such a scheme cannot scale to the entire

At least one router

 To accommodate organizations of various size

 To accommodate arbitrary routing protocols

 The choice of AS size can be made for economic,

 Another reason for a specific size arises from the routing

Share a common routing

Viewed as a single entity from

 Best path is selected by the routing protocol, based on a

 Metric is used to measure the distance to the destination

No route Remote network

Note: Graph abstraction is useful in other network contexts, e.g.,

c(x,x’) = cost of link (x,x’)

Cost could always be 1, or

What is the least-cost path between u and z ?

 Specifies network address and subnet mask of remote

 Use static routes when:

 However, static routing is relatively inflexible

 Most hosts use static routing

Static routing and default

Static forwarding table used

When an application generates a When a datagram is destined for any

 Used by routers to share information about the

 Perform several activities:

 When two ISPs interconnect, both need to exchange

Dynamic routing Route the software

 Exterior Gateway Protocols (EGP)

Policy Scale Performance

• Inter-AS: Admin • Hierarchical routing • Intra-AS: can focus

Bellman-Ford equation (dynamic programming)

cost from neighbor v to destination y

Determine the min path

According to B-F equation:

From time-to-time, each

❖ Under minor, natural conditions, the estimate Dx(y)

DV: convergence time

 BGP provides each AS a means to:

 Allows subnet to advertise its existence to rest of

Routing among autonomous systems

• All routes are given as a path of AS

Provision for policies

• Allows sender & receiver to enforces policies

Facilities for transit routing

• Each AS classified as transit system if it agrees to pass traffic through to

• Uses TCP for all communication

When AS3 advertises a prefix to AS1:

• prefix + attributes = • AS-PATH: Contains • e.g., never route

 BGP messages exchanged between peers over TCP

Determine router output

❖ A,B,C are backbone provider networks

❖ Should B advertise path BAW to C?