[单项选择]

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.

routing algorithm that （） work done on theOSI IS-IS intradomain routing protocol.
A. derived from
B. deviated from
C. was derived from
D. was deviated from

[单项选择]

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 (71) routing algorithm that (72) workdone on the OSI IS-IS intradomain routing protocol．This routing，as compared todistance—vector routing，requires (73) processing power．The Dijkstra algorithm is usedto calculate (74) OSPF routing table updates only take place when necessary， (75) atregular intervals．

A. derivedfrom
B. deviatedfrom
C. was derived from
D. was deviated from

[单项选择]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

[单项选择]

Open Shortest Path First(OSPF)is a (8) routing algorithm that (9) work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires (10) processing power. The Dijkstra algorithm is used to calculate (11) OSPF routing table updates only take place when necessary, (12) at regular intervals.

8（）
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 (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.

33（）
A. but rather
B. rather too
C. rather than
D. rather that