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.

(26)

(24)

(25)

(23)

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.

(21)

(20)

在面向对象分析过程中，用概念模型来详细描述系统的问题域，用(5)来表示概念模型。(6)关系用于表示类与类、接口与接口之间的继承关系；在Java中，用(7)关键字来直接表示这种关系。

(18)

对于不支持TCP/IP的设备(15)用SNMP进行管理。在SNMPV3中，以前称为管理站和代理的事物现在统一叫作(16)。