其他
What two things will a router do when running a distance vector routing protocol?()A. Send periodic updates regardless of topology changes.B. Send entire routing table to all routers in the routing domain.C. Use the shortest-path algorithm to the determin
题目
A. Send periodic updates regardless of topology changes.
B. Send entire routing table to all routers in the routing domain.
C. Use the shortest-path algorithm to the determine best path.
D. Update the routing table based on updates from their neighbors.
E. Maintain the topology of the entire network in its database.
相似问题和答案
第1题：
You have implemented mutual route redistribution between OSPF and EIGRP on a border router. When checking the routing table on one o f the OSPF routers within the OSPF routing domain, you are seeing some, but not all of the expected routes.Which two things should you verify to troubleshoot this problem?（）
A. The border router is using a proper seed metric for OSPF
B. The border ro uter is using a proper seed metric for EIGRP
C. The administrative distance is set for OSPF and EIGRP
D. The missing EIGRP routes are present in the routing table of the border router
E. The subnet keyword on the border router in the redistribute EIG RP command
第2题：
A. RIP
B. IPX RIP
C. IGRP
D. OSPF
E. IS-IS
第3题：
●Border Gateway Protocol(BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) ．A router that recevives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an Internet is usually too big for this routing method. To use link state routing for the whole internet would require each routex to have a huge link state database. It would also take a long time for each router to calculate its rousting (75) using the Dijkstra algorism.
（71）
A. routing
B. switching
C. transmitting
D. receiving
(72)
A. path
B. hop `
C. route
D. packet
(73）
A. connection
B. window
C. source
D. destination
(74)
A. status
B. search
C. state
D. research
(75）
A. table
B. state
C. metric
D. cost
第4题：
it is belong a family of ip routing protocols，each router have a partial map of network，what is the routing protocol？
正确答案: Class A： 10.0.0.0 --- 10.255.255.255
Class B： 172.16.0.0 --- 172.31.255.255
Class C:// 192.168.0.0 --- 192.168.255.255
第5题：
Refer to the exhibit. When running EIGRP, What is required for RouterA to exchange routing updates with RouterC?（）
- A、As numbers must be changed to match on all the routers.
- B、Loopback interface must be configured so a DR is elected.
- C、The no auto-summary command is needed on Router A and Router C.
- D、Router B needs to have two network statements, one for each connected network.
正确答案:A
第6题：
A. Distance vector protocols send the entire routing table to directly connected neighbors.
B. Distance vector protocols are responsible for sending updates to all networks listed in the routing table.
C. Link state protocols are responsible for sending the entire routing table to the whole network.
D. Link state protocols send updates regarding their own links status to all other routers on the network.
E. None of the above
第7题：
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.
It is possible to use a range of different metrics or costs for the links in a routing protocol.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（ ）。This also limits RIP to running on fairly small networks.
B.link state
C.flooding
D.minimum spanning tree
IP网络中广泛使用的路由协议之一是路由信息协议（RIP）。RIP是基于路由算法的路由协议。网络中的路由协议与理想的图算法存在少量的差异。在互联网中，路由器的目的是将数据包转发给不同的。
运行RIP协议的路由器每秒广播一次路由信息，另外，每当路由器收到其他路由器的更新消息而导致其路由表变化时，就会发送更新消息。
路由协议使用不同的度量或成本来建立连接是可能的。RIP采用了最简单的方法，所有链路的成本都等于。这样，它总是试图寻找跳数最少的路径。有效的距离范围是从1到。这也限制了RIP只能在相当小规模的网络上运行。
第8题：
Border Gateway Protocol(BGP) is inter-autonomous system (71) protocol. BGP is based on a routing method called path vector routing. Distance vector routing is not a good candidate for inter-autonomous system routing because there are occasions on which the route with the smallest (72) count is not the preferred route. For example, we may not want a packet through an not secure even though it is the shortest route. Also, distance vector routing is unstable due to the fact that the routers announce only the number of hop counts to the destination without actually defining the path that leads to that (73) ．A router that receives a distance vector advertisement packet may be fooled if the shortest path is actually calculated through the receiving router itself. Link (74) routing is also not a good candidate for inter-autonomous system routing because an Internet is usually too big for this routing method. To use link state routing for the whole internet would require each router to have a huge link state database. It would also take a long time for each router to calculate its rousting (75) using the Dijkstra algorism.
（71）
A. routing
B. switching
C. transmitting
D. receiving
（72）
A. path
B. hop
C. route
D. packet
（73）
A. connection
B. window
C. source
D. destination
（74）
A. status
B. search
C. state
D. research
（75）
A. table
B. state
C. metric
D. cost
边界网关协议(BGP)是自治系统间的路由协议。BGP是基于路径选择的向量路由方法。距离向量路由作为自治系统间的路由不是一个好的选择,因为具有最小跳数的路由并不一定是最合适的路由。例如，我们不想一个数据包通过即使路径最短但不安全的路线，距离向量路由具有不确定性,因为它只告知了到达目的地路径的跳数，而没有真正定义具体的路径。如果接收路由器接收到了一个通过它本身来计算得到的距离向量广播包，那么显然它是被愚弄的。链路状态路由作为自治系统间的路由也不是一个好的选择，因为在使用链路状态路由时，整个互联网将要求每个路由器有一个庞大的链路状态资料库，这就需要花费大量的时间去为路由器计算其路由表。
第9题：
Which two statements are characteristics of a distance vector routing protocol?（）
- A、RIP is an example of distance vector routing protocols
- B、Updates are periodic and include the entire routing table
- C、Routing updates are sent only after topology changes
- D、The protocol can be useful in hub-and-spoke and hierarchical networks
- E、Convergence is usually faster than with link state protocols
- F、Each router has its own view of the topology
正确答案:A,B
第10题：
You have implemented mutual route redistribution between OSPF and EIGRP on a border router. When checking the routing table on one o f the OSPF routers within the OSPF routing domain, you are seeing some, but not all of the expected routes. Which two things should you verify to troubleshoot this problem?（）
- A、The border router is using a proper seed metric for OSPF
- B、The border ro uter is using a proper seed metric for EIGRP
- C、The administrative distance is set for OSPF and EIGRP
- D、The missing EIGRP routes are present in the routing table of the border router
- E、The subnet keyword on the border router in the redistribute EIG RP command
正确答案:D,E