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 internetwork,the goal of the routers to forward packets to various（ ）.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.A.6B.10C.15D.16
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 internetwork,the goal of the routers to forward packets to various（ ）.
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.
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.
A.6
B.10
C.15
D.16
B.10
C.15
D.16
参考解析
解析：IP网络中广泛使用的路由协议之一是路由信息协议（RIP）。RIP是基于路由算法的路由协议。网络中的路由协议与理想的图算法存在少量的差异。在互联网中，路由器的目的是将数据包转发给不同的。
运行RIP协议的路由器每秒广播一次路由信息，另外，每当路由器收到其他路由器的更新消息而导致其路由表变化时，就会发送更新消息。
路由协议使用不同的度量或成本来建立连接是可能的。RIP采用了最简单的方法，所有链路的成本都等于。这样，它总是试图寻找跳数最少的路径。有效的距离范围是从1到。这也限制了RIP只能在相当小规模的网络上运行。
运行RIP协议的路由器每秒广播一次路由信息，另外，每当路由器收到其他路由器的更新消息而导致其路由表变化时，就会发送更新消息。
路由协议使用不同的度量或成本来建立连接是可能的。RIP采用了最简单的方法，所有链路的成本都等于。这样，它总是试图寻找跳数最少的路径。有效的距离范围是从1到。这也限制了RIP只能在相当小规模的网络上运行。
相关考题：
Which of the following statements are correct in regard to classless routing protocols?() A. Discontiguous subnets are not allowed.B. Variable length subnet masks are allowed.C. RIP v1 is a classless routing protocol.D. IGRP supports classless routing within the same autonomous system.E. RIP v2 supports classless routing.
Which IOS commands can a network technician use to verify all RIP, IGRP,EIGRP, and OSPF routing protocol configurations?() A. debug ip routingB. show running-configC. show ip route protocolsD. show ip protocolsE. show protocols al
Which of the following routing protocols are less likely prone routing loops and network reachability problems when used in discontiguous networks?() A. IGRPB. CDPC. OSPFD. RIP v1E. RIP v2F. EIGRP
You need to choose a routing protocol for a new Testking network. This network will be running IP, IPX, and Appletalk, and you wish to utilize only one routing protocol. Which one would be the best choice?（）A. OSPFB. EIGRPC. RIP v2D. IGRPE. RIP v1
● 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 （71）algorithm. Routing protocols in internetworks differ slightly from the idealized graph model. In an internetwork, the goal of the routers to forward packets to various （72）.Routers running RIP send their advertisement about cost every （73） 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 （74）. Thus it always tries to find the minimum hop route. Valid distances are 1 through （75）.This also limits RIP to running on fairly small networks.（71）A. distance vectorB. link stateC. floodingD. minimum spanning tree（72）A. computersB. routersC. switchesD. networks（73）A. 10B. 30C. 60D. 180（74）A. 1B. 15C. 16D. length of the link（75）A. 6B. 10C. 15D. 16
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 (71) algorithm．Routing protocols in internetworks differ slightly from the idealized graph model．In aninternetwork，the goal of the routers to forward packets to various (72) ．Routers running RIP send their advertisement about cost every (73) seconds．A router also sends an update message whenever an update from another router causes it to change itsrouting 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 (74) Thus it always tries tofind the minimum hop route．Valid distances are 1 through (75) ．This also limits RIP torunning on fairly small networks．（71）A．distance vectorB．link stateC．floodingD．minimum spanning tree
Open Shortest Path First (OSPF) was designed as an （ ） gateway protocol, for use in an autonomous system such as a local area network (LAN). It implements Dijkstra's algorithm, also known as the （ ） path first algorithm. As a link-state routing protocol it was based on the link-state algorithm developed for the ARPANET in 1980 and the IS-IS routing protocol. OSPF was first standardised in 1989 as RFC 1131, which is now known as OSPF version 1.Routing protocols like OSPF calculate the shortest route to a destination through the network based on an algorithm. The first routing protocol that was widely implemented, the （请作答此空）, calculated the shortest route based on hops, that is the number of routers that an IP packet had to traverse to reach the destination host. RIP successfully implemented dynamic routing, where routing tables change if the network topology changes. But RIP did not adapt its routing according to changing network conditions, such as data-transfer rate. Demand grew for a dynamic routing protocol that could calculate the fastest route to a destination. （ ） was developed so that the shortest path through a network was calculated based on the cost of the route, taking into account bandwidth, delay and load. Therefore OSPF undertakes route cost calculation on the basis of link-cost parameters, which can be weighted by the administrator. OSPF was quickly adopted because it became known for reliably calculating routes through large and complex local area networks.As a link state routing protocol, OSPF maintains link state （ ）, which are really network topology maps, on every router on which it is implemented. The state of a given route in the network is the cost, and OSPF algorithm allows every router to calculate the cost of the routes to any given reachable destination. Unless the administrator has made a configuration, the link cost of a path connected to a router is determined by the bit rate (1 Gbit/s, 10 Gbit/s, etc) of the interface. A router interface with OSPF will then advertise its link cost to neighbouring routers through multicast, known as the hello procedure. All routers with OSPF implementation keep sending hello packets, and thus changes in the cost of their links become known to neighbouring routers. The information about the cost of a link, that is the speed of a point to point connection between two routers, is then cascaded through the network because OSPF routers advertise the information they receive from one neighbouring router to all other neighbouring routers. This process of flooding link state information through the network is known as synchronisation. Based on this information, all routers with OSPF implementation continuously update their link state databases with information about the network topology and adjust their routing tables.OSPF has become a popular dynamic routing protocol. Other commonly used dynamic routing protocols are the RIP and the Border Gateway Protocol (BGP). Today routers support at least one interior gateway protocol to advertise their routing tables within a local area network. Frequently implemented interior gateway protocols besides OSPF are RIP, IS-IS, and the proprietary Interior Gateway Routing Protocol (IGRP) by Cisco.A.OSPFB.RIPC.IS-ISD.EIGRP
Open Shortest Path First (OSPF) was designed as an （请作答此空） gateway protocol, for use in an autonomous system such as a local area network (LAN). It implements Dijkstra's algorithm, also known as the （ ） path first algorithm. As a link-state routing protocol it was based on the link-state algorithm developed for the ARPANET in 1980 and the IS-IS routing protocol. OSPF was first standardised in 1989 as RFC 1131, which is now known as OSPF version 1.Routing protocols like OSPF calculate the shortest route to a destination through the network based on an algorithm. The first routing protocol that was widely implemented, the （ ）, calculated the shortest route based on hops, that is the number of routers that an IP packet had to traverse to reach the destination host. RIP successfully implemented dynamic routing, where routing tables change if the network topology changes. But RIP did not adapt its routing according to changing network conditions, such as data-transfer rate. Demand grew for a dynamic routing protocol that could calculate the fastest route to a destination. （ ） was developed so that the shortest path through a network was calculated based on the cost of the route, taking into account bandwidth, delay and load. Therefore OSPF undertakes route cost calculation on the basis of link-cost parameters, which can be weighted by the administrator. OSPF was quickly adopted because it became known for reliably calculating routes through large and complex local area networks.As a link state routing protocol, OSPF maintains link state （ ）, which are really network topology maps, on every router on which it is implemented. The state of a given route in the network is the cost, and OSPF algorithm allows every router to calculate the cost of the routes to any given reachable destination. Unless the administrator has made a configuration, the link cost of a path connected to a router is determined by the bit rate (1 Gbit/s, 10 Gbit/s, etc) of the interface. A router interface with OSPF will then advertise its link cost to neighbouring routers through multicast, known as the hello procedure. All routers with OSPF implementation keep sending hello packets, and thus changes in the cost of their links become known to neighbouring routers. The information about the cost of a link, that is the speed of a point to point connection between two routers, is then cascaded through the network because OSPF routers advertise the information they receive from one neighbouring router to all other neighbouring routers. This process of flooding link state information through the network is known as synchronisation. Based on this information, all routers with OSPF implementation continuously update their link state databases with information about the network topology and adjust their routing tables.OSPF has become a popular dynamic routing protocol. Other commonly used dynamic routing protocols are the RIP and the Border Gateway Protocol (BGP). Today routers support at least one interior gateway protocol to advertise their routing tables within a local area network. Frequently implemented interior gateway protocols besides OSPF are RIP, IS-IS, and the proprietary Interior Gateway Routing Protocol (IGRP) by Cisco.A.exteriorB.interiorC.borderD.routing
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 internetwork,the goal of the routers to forward packets to various（请作答此空）.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.A.computersB.routersC.switchesD.networks
RIP version 2 is being used as the routing protocol within the Testking network.What does RIP version 2 use to prevent routing loops?（）A、CIDRB、Split horizonC、AuthenticationD、Classless maskingE、Hold-down timersF、Multicast routing updatesG、Path Vectoring
Which of the following routing protocols are less likely prone routing loops and network reachability problems when used in discontiguous networks?（）A、IGRPB、CDPC、OSPFD、RIP v1E、RIP v2F、EIGRP
Which three statements describe the differences between RIP version 1 and RIP version 2? (Choose three.)（）A、RIP version 1 broadcasts updates whereas RIP version 2 uses multicasts.B、RIP version 1 multicasts updates while RIP version 2 uses broadcasts.C、Both RIP version 1 and RIP version 2 are classless routing protocols.D、RIP Version 2 is a classless routing protocol whereas RIP version 1 is a classful routing protocol.E、Both RIP version 1 and version 2 support authentication.F、RIP version 2 sends the subnet mask in updates and RIP version 1 does not.
it is belong a family of ip routing protocols，each router have a partial map of network，what is the routing protocol？
You need to choose a routing protocol for a new Testking network. This network will be running IP, IPX, and Appletalk, and you wish to utilize only one routing protocol. Which one would be the best choice?（）A、OSPFB、EIGRPC、RIP v2D、IGRPE、RIP v1
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 changesD、The protocol can be useful in hub-and-spoke and hierarchical networks.E、Convergence is usually faster than with link state protocolsF、Each router has its own view of the topology
Which three factors have the biggest influence on OSPF scalability？（）A、Flooding paths and redundancyB、Amount of routing information in the OSPF area or routing domainC、Number of routers with Cisco Express Forwarding enabledD、Number of neighbor adjacenciesE、Other routing protocols in useF、OSPF timer reconstruction negotiationG、Redistribution with BGP neighborsH、Redistribution with other IGP routing protocols， such as RIP or EIGRP
Which IOS commands can a network technician use to verify all RIP, IGRP,EIGRP, and OSPF routing protocol configurations?（）A、debug ip routingB、show running-configC、show ip route protocolsD、show ip protocolsE、show protocols al
Which of the following statements are correct in regard to classless routing protocols?（）A、Discontiguous subnets are not allowed.B、Variable length subnet masks are allowed.C、RIP v1 is a classless routing protocol.D、IGRP supports classless routing within the same autonomous system.E、RIP v2 supports classless routing.
Which IOS features are used to avoid Routing loops when dynamic Routing protocols are used betweenPE and CE in MPLS-VPN networks？（）A、Site Of Origin SOO.B、SHAM links with OSPFC、BGP cost communityD、BGP feature allow-as inE、RPF Reverse Path forwarding.F、Access-list Control in Distance Vector protocol like RIP and EIGRP.
You are a network administrator for your company. The network consists of a single Active Directory domain. All servers run Windows Server 2003. The company’s main office is in Barcelona， and it has branch offices in Paris and London. The company has no immediate plans to expand or relocate the offices. The company wants to connect the office networks by using a frame relay WAN connection and Routing and Remote Access servers that are configured with frame relay WAN adapters. Computers in each office will be configured to use the local Routing and Remote Access server as a default gateway. You are planning the routing configuration for the Routing and Remote Access servers. You need to allow computers in Barcelona， Paris， and London to connect to computers in any office. You want to minimize routing traffic on the WAN connection. What should you do？ （）A、 At each office， add the OSPF routing protocol to Routing and Remote Access， add the WAN adapter to the OSPF routing protocol， and deploy OSPF as a single-area internetwork.B、 At each office， add the RIP version 2 routing protocol to Routing and Remote Access， and configure the WAN adapter to use RIP version 2. Configure the outgoing packet protocol as RIP version 2 broadcast and the incoming packet protocol as RIP version 1 and 2.C、 At each office， add the RIP version 2 routing protocol to Routing and Remote Access， and configure the WAN adapter to use RIP version 2. Configure the outgoing packet protocol as RIP version 2 multicast and the incoming packet protocol as RIP version 2 only.D、 At each office， configure the Routing and Remote Access server with static routes to the local networks at the other two offices.
单选题You are a network administrator for your company. The network consists of a single Active Directory domain. All servers run Windows Server 2003. The company’s main office is in Barcelona， and it has branch offices in Paris and London. The company has no immediate plans to expand or relocate the offices. The company wants to connect the office networks by using a frame relay WAN connection and Routing and Remote Access servers that are configured with frame relay WAN adapters. Computers in each office will be configured to use the local Routing and Remote Access server as a default gateway. You are planning the routing configuration for the Routing and Remote Access servers. You need to allow computers in Barcelona， Paris， and London to connect to computers in any office. You want to minimize routing traffic on the WAN connection. What should you do？ （）A At each office， add the OSPF routing protocol to Routing and Remote Access， add the WAN adapter to the OSPF routing protocol， and deploy OSPF as a single-area internetwork.B At each office， add the RIP version 2 routing protocol to Routing and Remote Access， and configure the WAN adapter to use RIP version 2. Configure the outgoing packet protocol as RIP version 2 broadcast and the incoming packet protocol as RIP version 1 and 2.C At each office， add the RIP version 2 routing protocol to Routing and Remote Access， and configure the WAN adapter to use RIP version 2. Configure the outgoing packet protocol as RIP version 2 multicast and the incoming packet protocol as RIP version 2 only.D At each office， configure the Routing and Remote Access server with static routes to the local networks at the other two offices.
多选题RIP version 2 is being used as the routing protocol within the Testking network.What does RIP version 2 use to prevent routing loops?（）ACIDRBSplit horizonCAuthenticationDClassless maskingEHold-down timersFMulticast routing updatesGPath Vectoring
多选题Which three factors have the biggest influence on OSPF scalability？（）AFlooding paths and redundancyBAmount of routing information in the OSPF area or routing domainCNumber of routers with Cisco Express Forwarding enabledDNumber of neighbor adjacenciesEOther routing protocols in useFOSPF timer reconstruction negotiationGRedistribution with BGP neighborsHRedistribution with other IGP routing protocols， such as RIP or EIGRP
问答题it is belong a family of ip routing protocols，each router have a partial map of network，what is the routing protocol？
多选题Which three statements describe the differences between RIP version 1 and RIP version 2? (Choose three.)（）ARIP version 1 broadcasts updates whereas RIP version 2 uses multicasts.BRIP version 1 multicasts updates while RIP version 2 uses broadcasts.CBoth RIP version 1 and RIP version 2 are classless routing protocols.DRIP Version 2 is a classless routing protocol whereas RIP version 1 is a classful routing protocol.EBoth RIP version 1 and version 2 support authentication.FRIP version 2 sends the subnet mask in updates and RIP version 1 does not.
多选题Which IOS features are used to avoid Routing loops when dynamic Routing protocols are used betweenPE and CE in MPLS-VPN networks？（）ASite Of Origin SOO.BSHAM links with OSPFCBGP cost communityDBGP feature allow-as inERPF Reverse Path forwarding.FAccess-list Control in Distance Vector protocol like RIP and EIGRP.
多选题Which IOS commands can a network technician use to verify all RIP, IGRP,EIGRP, and OSPF routing protocol configurations?（）Adebug ip routingBshow running-configCshow ip route protocolsDshow ip protocolsEshow protocols al