Accton Technology ES4626 - Manual (Page 483)

483
Routing Protocol is "bgp 0"
Outgoing update filter list for all interfaces is
Incoming update filter list for all interfaces is
IGP synchronization is disabled
Automatic route summarization is disabled
Neighbor(s):
Address FiltIn FiltOut DistIn DistOut Weight RouteMap
Incoming Route Filter:
13.7 OSPFv3
13.7.1 Introduction to OSPFv3
OSPFv3（Open Shortest Path First） is the third version for Open Shortest Path First,
and it is the IPv6 version of OSPF Protocol. It is an interior dynamic routing protocol for
autonomous system based on link-state. The protocol creates a link-state database by
exchanging link-states among layer3 switches, then uses the Shortest Path First
algorithm to generate a route table basing on that database.
Autonomous system (AS) is a self-managed interconnected network. In large
networks, such as the Internet, a giant interconnected network is broken down to
autonomous systems. Big enterprise networks connecting to the Internet are independent
AS, since the other host on the Internet are not managed by those AS and they don’t
share interior routing information with the layer3 switches on the Internet.
Each link-state layer3 switch can provide information about the topology with its
neighboring layer3 switches.
• The network segment (link) connecting to the layer3 switch
• State of the connecting link
Link-state information is flooded throughout the network so that all layer3 switches
can get first hand information. Link-state layer3 switches will not broadcast all information
contained in their route tables; instead, they only send changed link-state information.
Link-state layer3 switches establish neighborhood by sending “HELLO” to their neighbors,
then link-state advertisements (LSA) will be sent among neighboring layer3 switches.
Neighboring layer3 switch copy the LSA to their routing table and transfer the information
to the rest part of the network. This process is referred to as “flooding”. In this way,
firsthand information is sent throughout the network to provide accurate map for creating
and updating routes in the network. Link-state routing protocols use cost instead of hops
to decide the route. Cost is assigned automatically or manually. According to the
algorithm in link-state protocol, cost can be used to calculate the hop number for