One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the ______ algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an intemetwork, the goal of the routers to forward ______ to various networks.Routers running RIP send their advertisement about cost every ______ seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.Routing protocols use different techniques for assigning ______ to individual networks. Further, each routing protocol forms a metric aggregation in a different way. RIP takes the simplest approach, with all link costs being equal ______. Thus it always tries to find the minimum hop route.Valid distances are 1 through 15. This also limits RIP to running on fairly small networks.
A. respond time
B. utilization
C. links
D. metrics
查看答案
One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the ______ algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an intemetwork, the goal of the routers to forward ______ to various networks.Routers running RIP send their advertisement about cost every ______ seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.Routing protocols use different techniques for assigning ______ to individual networks. Further, each routing protocol forms a metric aggregation in a different way. RIP takes the simplest approach, with all link costs being equal ______. Thus it always tries to find the minimum hop route.Valid distances are 1 through 15. This also limits RIP to running on fairly small networks.
A. Dijkstra
B. path-vector
C. link-state
D. distance-vector
One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the ______ algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an intemetwork, the goal of the routers to forward ______ to various networks.Routers running RIP send their advertisement about cost every ______ seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.Routing protocols use different techniques for assigning ______ to individual networks. Further, each routing protocol forms a metric aggregation in a different way. RIP takes the simplest approach, with all link costs being equal ______. Thus it always tries to find the minimum hop route.Valid distances are 1 through 15. This also limits RIP to running on fairly small networks.
A. 1
B. 15
C. 16
D. length of the link
目前,某城市大学城内共有4所综合性大学,高校1和高校4的校园网约有14500个信息点,高校2和高校3约有16300个信息点。PH系统集成公司承接了该大学城各高校网络互连互通及数据中心建设的网络工程项目。PH公司的设计师老郭在进行逻辑网络设计时,提出了本阶段的工作内容是:网络拓扑结构设计;局域网技术选择;广域网技术选择;IP地址和域名设计;路由协议选择;网络安全设计;网络管理模式与工具选择;撰写逻辑设计文档。对设计师老郭确定的逻辑设计内容的评价,恰当的是______。在进行IP地址设计时,设计师老郭可能______。
A. 应去掉“广域网技术选择”这一部分
B. 应补充“物理层技术选择”部分
C. 应补充“网络设各选型”部分
D. 内容全面,符合逻辑设计的工作准则
One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the ______ algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an intemetwork, the goal of the routers to forward ______ to various networks.Routers running RIP send their advertisement about cost every ______ seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.Routing protocols use different techniques for assigning ______ to individual networks. Further, each routing protocol forms a metric aggregation in a different way. RIP takes the simplest approach, with all link costs being equal ______. Thus it always tries to find the minimum hop route.Valid distances are 1 through 15. This also limits RIP to running on fairly small networks.
A. data frames
B. segments
C. packets
D. messages