Users Guide

Table Of Contents
Parameters
all—(Optional) Displays all routes including nonactive routes.
bgp—(Optional) Displays BGP route information.
connected—(Optional) Displays only the directly connected routes.
static—(Optional) Displays all static routes.
A::B/mask—(Optional) Enter the IPv6 destination address and mask.
summary—(Optional) Displays the IPv6 route summary.
Default Not congured
Command Mode EXEC
Usage Information None
Example (All)
OS10# show ipv6 route all
Codes: C - connected
S - static
B - BGP, IN - internal BGP, EX - external BGP
O - OSPF,IA - OSPF inter area, N1 - OSPF NSSA external type 1,
N2 - OSPF NSSA external type 2, E1 - OSPF external type 1,
E2 - OSPF external type 2, > - non-active route
Gateway of last resort is not set
Destination Gateway Dist/Metric Last Change
---------------------------------------------------------
Example
(Connected)
OS10# show ipv6 route connected
Codes: C - connected
S - static
B - BGP, IN - internal BGP, EX - external BGP
O - OSPF,IA - OSPF inter area, N1 - OSPF NSSA external type 1,
N2 - OSPF NSSA external type 2, E1 - OSPF external type 1,
E2 - OSPF external type 2, > - non-active route
Gateway of last resort is not set
Destination Gateway Dist/Metric Last Change
------------------------------------------------------------------
C 2001:db86::/32 via 2001:db86:fff::1 ethernet1/1/1 0/0 00:03:24
Example (Summary)
OS10# show ipv6 route summary
Route Source Active Routes Non-Active Routes
Ospf 0 0
Bgp 0 0
Connected 0 0
Static 0 0
Ospf Inter-area 0 0
NSSA External-1 0 0
NSSA External-2 0 0
Ospf External-1 0 0
Ospf External-2 0 0
Bgp Internal 0 0
Bgp External 0 0
Ospf Intra-area 0 0
Total 0 0
Supported Releases 10.2.0E or later
Open shortest path rst
OSPF routing is a link-state routing protocol that allows sending of link-state advertisements (LSAs) to all other routers within the same
autonomous system (AS) area. Information about attached interfaces, metrics used, and other attributes are included in OSPF LSAs. OSPF
routers accumulate link-state information, and use the shortest path rst (SPF) algorithm to calculate the shortest path to each node.
256
Layer 3