更多"Open Shortest Path First(OSPF)is a "的相关试题:
[单项选择]
Open Shortest Path First(OSPF)is a (29) routing algorithm that (30) work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (31) processing power. The Dijkstra algorithm is used to calculate (32) OSPF routing table updates only take place when necessary, (33) at regular intervals.
29()
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 theOSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing,requires (73) processing power. The (74) algorithm is used to calculate mutes. OSPFrouting table updates only take place when necessary, (75) at regular intervals.
A. distance-vector
B. link-state
C. flow-based
D. selective flooding
[单项选择]
Open Shortest Path First(OSPF)is a () routing algorithm that () work done on theOSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing,requires () processing power. The () algorithm is used to calculate mutes. OSPFrouting table updates only take place when necessary, () at regular intervals.
Open Shortest Path First(OSPF)is a ()
A. distance-vector
B. link-state
C. flow-based
D. selective flooding
[单项选择]Open Shortest Path First (OSPF) is a (66) routing algorithm that (67) work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (68) processing power. The (69) algorithm is used to calculate routes. OSPF routing table updates only take place when necessary, (70) at regular intervals.
A. distance-vector
B. link-state
C. flow-based
D. selective flooding