单选题 Open Shortest Path First(OSPF)is a{{U}} (72) {{/U}}routing algorithm that{{U}} (73) {{/U}}work done on theOSI IS-IS intradomain routing protocol. This routing, as compared to distance-vector routing,requires{{U}} (74) {{/U}}processing power. The{{U}} (75) {{/U}}algorithm is used to calculate mutes. OSPFrouting table updates only take place when necessary, {{U}}(76) {{/U}}at regular intervals.

单选题 A．distance-vector B．link-state C．flow-based D．selective flooding

A
B
C
D

【正确答案】 B

【答案解析】

单选题 A．derived from B．deviated from
C．was derived from D．was deviated from

A
B
C
D

【正确答案】 C

【答案解析】

单选题 A．more B．less C．same D．most

A
B
C
D

【正确答案】 A

【答案解析】

单选题 A．Bellman-Ford B．Ford-Fulkerson C．Dijkstra D．RIP

A
B
C
D

【正确答案】 C

【答案解析】

单选题 A．but rather B．rather too C．rather than D．rather that

A
B
C
D

【正确答案】 D

【答案解析】开放的最短路径优先(OSPF)是一种链路状态(link-state)路由算法，它是源于(was derived from)OSI IS-IS域内路由协议。与距离矢量路由相比，它需要更强(more)的处理能力。Dijkstra算法是用来计算路由的。OSPF只在必要的情况才会更新，而不是(rather that)有规律地隔一段时间就更新一次。