3Com 4007, Руководство по внедрению, Страница: 482 / 684

482 C
HAPTER
19: O
PEN
S
HORTEST
P
ATH
F
IRST
(OSPF) R
OUTING
■
Loading — The router is sending requests for link state
advertisements (LSAs) that were discovered in the exchange state
but not yet received.
■
Full — The neighbor is now fully adjacent. This adjacency is now
advertised in router LSAs and network LSAs.
■
Priority — The priority of this neighbor in terms of designated router
election. A value of 0 indicates that the neighbor is not eligible to
become a designated router.
■
RxQ (Retransmit Queue) — The number of LSAs in the local
retransmit queue to the neighbor. These LSAs have been flooded but
not acknowledged on this adjacency. The LSAs in the queue are
flooded until they are acknowledged by the neighbor or until the
adjacency is destroyed.
■
SumQ (Summary Queue) — The number of LSAs that make up the
area link state database at the moment that the neighbor goes into
the database exchange state. These LSAs are sent to the neighbor in
database description packets.
■
ReqQ (Request Queue) — The number of LSAs that are required
from the neighbor in order to synchronize the neighboring routers’
link state databases. The router requests these LSAs by sending link
state request packets to the neighbor. The neighbor then responds
with link state update packets containing the requested LSAs. As the
appropriate LSAs are received from the neighbor, they are removed
from the request queue.
■
Flags — The type of neighbor. Possible values:
■
D — The neighbor was dynamically discovered.
■
S — The neighbor was statically defined.
■
BDR — The neighbor is the backup designated router for the area.
■
DR — The neighbor is the designated router for the area.
■
Examples
■
S+BDR
indicates that the neighbor was statically defined and serves
as the backup designated router for the area.
■
D+DR
indicates that the neighbor was dynamically discovered and
serves as the designated router for the area.