单选题 Open Shortest Path First(OSPF)is a{{U}} (58) {{/U}}routing algorithm that{{U}} (59) {{/U}}work done on the OSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing, requires{{U}} (60) {{/U}}processing power. The Dijkstra algorithm is used to calculate{{U}} (61) {{/U}}OSPF routing table updates only take place when necessary,{{U}} (62) {{/U}}at regular intervals.

单选题 A. distance-vector B. link-state
C. flow-based D. selective flooding
【正确答案】 B
【答案解析】
单选题 A. derived from B. deviated from
C. was derived from D. was deviated from
【正确答案】 C
【答案解析】
单选题 A. more B. less C. same D. most
【正确答案】 A
【答案解析】
单选题 A. routes B. road C. distance D. cost
【正确答案】 C
【答案解析】
单选题 A. but rather B. rather too C. rather than D. rather that
【正确答案】 D
【答案解析】[解析]
OSPF(Open Shortest Path First)是一个内部网关协议(Interior Gateway Protocol，IGP)，用于在单一自治系统(Autonomous System，AS)内决策路由。与RIP相对，OSPF是链路状态路由协议，而RIP是距离矢量路由协议。
链路是路由器接口的另一种说法，因此OSPF也称为接口状态路由协议。OSPF通过在路由器之间通告网络接口的状态来建立链路状态数据库，生成最短路径树，每个OSPF路由器使用这些最短路径构造路由表。