Areas introduce a boundary on the link - state updates.
Areas are logical definitions specific to any given router.
All routers within an area have the exact link - state database.
The calculation of the Dijkstra algorithm on a router is limited to changes within an area.
The area designated router will always have a priority of 0.
第1题:
A. Areas introduce a boundary on the link - state updates.
B. Areas are logical definitions specific to any given router.
C. All routers within an area have the exact link - state database.
D. The calculation of the Dijkstra algorithm on a router is limited to changes within an area.
E. The area designated router will always have a priority of 0.
第2题:
Which two statements are true about IS -IS routing?()
第3题:
A.A
B.B
C.C
D.D
第4题:
Which three statements about Label-Switched Paths (LSPs) are true? ()
第5题:
Which of the following are true statements regarding the characteristics of OSPF areas? Select all that apply.()
第6题:
Which three statements about OSPF areas are true?()
第7题:
Which one of these statements is true of OSPF type 5 LSAs? ()
第8题:
A. IS - IS is more CPU - intensive than is OSPF
B. For greater fine tuning there are more IS - IS timers
C. IS - IS LSP con tains TLV fields and OSPF LSU contains the LSAs
D. New additions to the protocol are easily implemented in OSPF but not with IS - IS
E. OSPF has more area types than does IS - IS
第9题:
Which two statements about route redistribution when implementing OSPF are true?()
第10题:
Which three statements are true about terms in a policy?()