Ospf routing protocol typically runs over ()A.IP B.TCP C.UDP D
Ospf routing protocol typically runs over ()
A.IP
B.TCP
C.UDP
D.ARP
Ospf routing protocol typically runs over ()
A.IP
B.TCP
C.UDP
D.ARP
A. Accept all OSPF routes and install them into the inet.3 routing table.
B. Accept all OSPF routes and install them into the inet7.0 routing table.
C. Accept all OSPF routes and install them into the inet4.0 routing table.
D. Accept all OSPF routes and install them into the inet.0 routing table.
Ospf routing protocol typically runs over (72)
A.IP
B.TCP
C.UDP
D.ARP
OSPF is a link-state routing protocol。It is designed to be run internal to a single __(71__system。Each OSPF router maintains an identical __(72)__ describing the autonomous system’s topology。From this database,a routing table is calculated by constructing a shortest-path __(73)__。OSPF recalculates routes quickly in the face of topological changes,utilizing a minimum of routing __(74)__ traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided,enabling an additional level of routing protection and a reduction in routing protocol __(75)__。
A.autonomous
B.network
C.computer
D.server
A、distance vector routing (DVR)
B、link state routing (LSR)
C、path vector routing
D、DVR and LSR
A.isplay ospf peer
B.isplay ospf interface
C.isplay ospf Isdb
D._ display ospf routing
Open Shortest Path First(OSPF)is a(71)routing algorithm that(72)work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires(73)processing power. The Dijkstra algorithm is used to calculate(74)OSPF routing table updates only take place when necessary,(75)at regular intervals.
A.distance-vector
B.link-state
C.flow-based
D.selective flooding
A. OSPF area ID
B. prefix list
C. port
D. time-to-live (TTL)
A.distance-vector
B.link-state
C.flow-based
D.selective flooding
Open Shortest Path First(OSPF)is a(71)routing algorithm that(72)work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires(73)processing power. The(74)algorithm is used to calculate routes. OSPF routing table updates only take place when necessary,(75)at regular intervals.
A.distance-vector
B.link-state
C.flow-based
D.selective flooding
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!