Download Lecture_5_Routing Protocols

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

RapidIO wikipedia , lookup

Network tap wikipedia , lookup

Point-to-Point Protocol over Ethernet wikipedia , lookup

Backpressure routing wikipedia , lookup

Zero-configuration networking wikipedia , lookup

Piggybacking (Internet access) wikipedia , lookup

AppleTalk wikipedia , lookup

IEEE 802.1aq wikipedia , lookup

Deep packet inspection wikipedia , lookup

List of wireless community networks by region wikipedia , lookup

Internet protocol suite wikipedia , lookup

Peering wikipedia , lookup

Computer network wikipedia , lookup

Airborne Networking wikipedia , lookup

IEEE 1355 wikipedia , lookup

Wake-on-LAN wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

Multiprotocol Label Switching wikipedia , lookup

Routing in delay-tolerant networking wikipedia , lookup

Routing wikipedia , lookup

Transcript
Chapter 21
Routing Protocols
Routing
Intradomain Routing
Interdomain Routing
Autonomous System
Distance Vector Routing Protocol
Link State Routing Protocol
Path Vector Routing Protocol
Routing cont…

Autonomous System (AS)


Intradomain Routing Protocol


A group of networks & routers under the
authority of common administration
Routing inside an Autonomous system
Interdomain Routing Protocol

Routing b/w Autonomous systems
Routing cont…

Distance Vector Routing Protocol




The routing table is shared with the neighbor
router(s)
Can not be used in large networks
The size of the N/W, in each direction, can not
exceed 15 hops
Examples are RIP and IGRP
Routing cont…



Link State Routing Protocol
information about adjacencies
(neighborship) sent to all routers only
when there is a change
Examples are OSPF and IS-IS
OSPF

OSPF is designed for large, scalable
networks.

allows dividing a large internetwork into
smaller areas.
OSPF Terminology


Link - physical and electrical connection between
two network devices.
Link-state - status of a link between two routers.



information about router's interface and its
relationship to neighboring routers.
Cost - value assigned to a link (based on speed
of the network connection).
Area - collection of networks and routers (has
same area identification).

Each router in an area, called an internal router, has
the same link-state information.
OSPF Terminology cont…




Designated Router (DR) - a router elected to
represent all the routers in that network.
Backup Designated Router (BDR) - becomes the
DR, if original DR fails.
Adjacencies database - listing of all neighbors to
which a router has established communication.
Link-state database (topological database) information about all other routers in the
network.


shows the network topology.
All routers in an area have identical link-state
databases.
OSPF Packet Format

5 types of ospf packets.





1
2
3
4
5
-
Hello.
DBD – database description packets.
Link-state requests.
Link-state updates (LSUs).
Link-state acknowledgements.
OSPF Operation
Establishing Adjacencies

Done using the Hello protocol.



establish virtual point-to-point links, adjacencies.
ensure bi-directional
communication
between neighbors
before exchanging
link-state
information.
Hello packets
are multi-cast
Hello Protocol exchange process

1. Router A first comes up - OSPF in down state.




Router A sends Hello packet with its information.
2. All enabled OSPF routers receive the Hello
packet and store info locally (Init state).
3. Routers send unicast reply Hello packet back
to Router A with their own information.
4. From replies Router A adds all neighbor
routers to its own database (two-way state).

Now, all routers that have learned about each other
establish bi-directional communication.
Hello Protocol exchange process (2)

5. Neighbor routers select the DR and BDR.



(before routers can begin exchanging complete linkstate information).
6. Neighboring routers determine master/slave
relationship, exchange LSAs, and establish full
adjacency.
7. Periodically (10 seconds by default), Hello
packets ("keepalive" updates) are exchanged to
ensure communication is still working.
DR and BDR

Help reduce routing update traffic


Act as a central point of contact.
Each router establishes adjacency with DR/BDR.



DR forwards LSAs to all other routers in network.
Manage link-state synchronization


sends LSAs only to DR/BDR.
Ensure all routers have same link-state information
about the internetwork.
BDR becomes DR, only if the DR fails.
Electing DR and BDR






DR - router with highest priority.
BDR - second highest
priority.
Priority 0 cannot become
DR or BDR.
If priorities are same, the
higher Router ID is
elected.
No new election if another
router
is added.
If DR fails,
BDR becomes DR, and new BDR is elected.
Route Discovery

After DR/BDR election, routers enters
Exstart state.
OSPF Configuration
OSPF Commands

show ip ospf interface


show ip ospf


# times SPF algorithm executed, link state update
interval.
show ip ospf neighbors


Verifies interface is configured – Router ID, DR &
BDR, timer intervals, neighbors.
List of neighbors, their priorities and states.
show ip ospf database

Displays contents of topological database.
Path Vector Routing Protocol





Interdomain Routing Protocol
One node, in each autonomous system,
functions on behalf of the entire AS
The node is called speaker node (for
discussion)
The speaker node in an AS creates routing
table and advertises it to speaker node in
the neighboring ASs
Example is BGP (Border Gateway Protocol)
Thank You
Questions???