网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
●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
参考答案
更多 “ ●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. routingB. switchingC. transmittingD. receiving(72)A. pathB. hop `C. routeD. packet(73）A. connectionB. windowC. sourceD. destination(74)A. statusB. searchC. stateD. research(75）A. tableB. stateC. metricD. cost ” 相关考题
考题
● The Border Gateway Protocol (BGP) is an interautonomous system （71） protocol. The primary function of a BGP speaking system is to exchange network （72） information with other BGP system. This network reachability information includes information on the list of Autonomous System (ASs) that reachability information traverses. BGP-4 provides a new set of mechanisms for supporting （73） interdomain routing. These mechanisms include support for advertising an IP （74） and eliminate the concept of network class within BGP. BGP-4 also introduces mechanisms that allow aggregation of routes, including （75） of AS paths. These changes provide support for the proposed supernettting scheme.（71）A. connectingB. resolvingC. routingD. supernettting（72）A. secubilityB. reachabilityC. capabilityD. reliability（73）A. answerlessB. connectionlessC. confirmlessD. classless（74）A. prefixB. suffixC. infixD. reflex（75）A. reservationB. relationC. aggregationD. connection
考题
OSPF is a link-state routing protocol。It is designed to be run internal to a single __（71）__system。Each OSPF router maintains an identical __（72）__ describing the autonomous system’s topology。From this database，a routing table is calculated by constructing a shortest-path __（73）__。OSPF recalculates routes quickly in the face of topological changes，utilizing a minimum of routing __（74）__ traffic。OSPF provides support for equal-cost multipath。An area routing capability is provided，enabling an additional level of routing protection and a reduction in routing protocol__（75）__。71A.autonomousB.networkC.computerD.server
考题
Intermediate system to intermediate system (IS - IS), is a protocol used by network devices (routers) to determine the best way to forward datagrams through a packet - switched network, a process called routing. Which three attributes are of the IS - IS routing protocol? （）A. supports VLSMB. link - state routing protocolC. operati on is similar to BGPD. supports two routing levels within an autonomous system
考题
Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?()
A. RIPB. IPX RIPC. IGRPD. OSPFE. IS-IS
考题
The statements below compare and contrast link state and distance vector routing protocols. Which of these are true?()
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.
考题
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 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.
考题
Which two statements are characteristics of a distance vector routing protocol?()
A.RIP is an example of distance vector routing protocolsB.Updates are periodic and include the entire routing tableC.Routing updates are sent only after topology changesD.The protocol can be useful in hub-and-spoke and hierarchical networksE.Convergence is usually faster than with link state protocolsF.Each router has its own view of the topology
考题
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.OSPF
B.RIP
C.IS-IS
D.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.RIP
B.IGRP
C.OSPF
D.BGP
考题
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.exterior
B.interior
C.border
D.routing
考题
The Border Gateway Protocol（BGP）is an interautonomous system（71）protocol.The primary function of a BGP speaking system is to exchange network（72）information with other BGP system.This network reachability information includes information on the list of Autonomous System（ASs）that reachability information traverses.BGP-4 provides a new set of mechanisms for supporting（在此空作答）interdomain routing.These mechanisms include support for dvertising an IP（74）and eliminate the concept of network class within BGP.BGP-4 also introduces mechanisms that allow aggregation of routes,including（75）of AS paths.These changes provide support for the proposed supernetting scheme.A.answerless
B.connectionless
C.confirmless
D.classless
考题
The Border Gateway Protocol（BGP）is an interautonomous system（在此空作答）protocol.The primary function of a BGP speaking system is to exchange network（72）information with other BGP system.This network reachability information includes information on the list of Autonomous System（ASs）that reachability information traverses.BGP-4 provides a new set of mechanisms for supporting（73）interdomain routing.These mechanisms include support for advertising an IP（74）and eliminate the concept of network class within BGP.BGP-4 also introduces mechanisms that allow aggregation of routes,including（75）of AS paths.These changes provide support for the proposed supernetting scheme.A.connecting
B.resolving
C.routing
D.supernetting
考题
Which of the following technologies can be used in distance vector routing protocols to prevent routing loops?（）A、Spanning Tree ProtocolB、Shortest path first treeC、Link-state advertisements (LSA)D、Hold-down timersE、Split horizonF、VRP
考题
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 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.
考题
Which two statements are characteristics of a distance vector routing protocol?（）A、RIP is an example of distance vector routing protocolsB、Updates are periodic and include the entire routing tableC、Routing updates are sent only after topology changesD、The protocol can be useful in hub-and-spoke and hierarchical networksE、Convergence is usually faster than with link state protocolsF、Each router has its own view of the topology
考题
Which one of the routing protocol below does NOT use a distance vector algorithm to calculate a route to a given destination?（）A、RIPB、IPX RIPC、IGRPD、OSPFE、IS-IS
考题
What is true regarding Autonomous Systems （AS ）？（）A、AS numbers are assigned by the IANAB、AS numbers are used by BGP （Border Gateway protocol ） to exchange IP routing information with neighboring ASC、In the internet， an Autonomous System （AS） is a collection of IP networks and routers under the controlD、All of the Above
考题
Intermediate system to intermediate system (IS - IS), is a protocol used by network devices (routers) to determine the best way to forward datagrams through a packet - switched network, a process called routing. Which three attributes are of the IS - IS routing protocol? （） A、supports VLSMB、link - state routing protocolC、operati on is similar to BGPD、supports two routing levels within an autonomous system
考题
What are the different characteristics of distance vector and link state routing protocols?（）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
考题
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.
考题
Which of the following routing protocols is strictly a distance vector protocol?（）A、IS-ISB、BGPC、EIGRPD、OSPF
考题
多选题Which of the following technologies can be used in distance vector routing protocols to prevent routing loops?（）ASpanning Tree ProtocolBShortest path first treeCLink-state advertisements (LSA)DHold-down timersESplit horizonFVRP
考题
多选题Which two statements are characteristics of a distance vector routing protocol？（）ARIP is an example of distance vector routing protocols.BUpdates are periodic and include the entire routing table.CRouting updates are sent only after topology changesDThe protocol can be useful in hub-and-spoke and hierarchical networks.EConvergence is usually faster than with link state protocolsFEach router has its own view of the topology
考题
单选题Which of the following routing protocols is strictly a distance vector protocol?（）A
IS-ISB
BGPC
EIGRPD
OSPF
考题
多选题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 two statements are characteristics of a distance vector routing protocol?（）ARIP is an example of distance vector routing protocolsBUpdates are periodic and include the entire routing tableCRouting updates are sent only after topology changesDThe protocol can be useful in hub-and-spoke and hierarchical networksEConvergence is usually faster than with link state protocolsFEach router has its own view of the topology
考题
单选题What is true regarding Autonomous Systems （AS ）？（）A
AS numbers are assigned by the IANAB
AS numbers are used by BGP （Border Gateway protocol ） to exchange IP routing information with neighboring ASC
In the internet， an Autonomous System （AS） is a collection of IP networks and routers under the controlD
All of the Above
热门标签
最新试卷