单选题How are RIP routing contexts implemented in MPLS VPN? ()ARIP does not support routing contextsBrouting contexts are implemented in a single routing processCrouting contexts are implemented using multiple routing processesDrouting contexts are implemented as several instances of a single routing processErouting contexts are implemented as a single instance of several routing processes

单选题
How are RIP routing contexts implemented in MPLS VPN? ()
A

RIP does not support routing contexts

B

routing contexts are implemented in a single routing process

C

routing contexts are implemented using multiple routing processes

D

routing contexts are implemented as several instances of a single routing process

E

routing contexts are implemented as a single instance of several routing processes


参考解析

解析: 暂无解析

相关考题:

Which three contexts can be used as matching conditions in a source NAT configuration? ()(Choose three.) A. routing-instanceB. zoneC. interfaceD. policyE. rule-set

How are RIP routing contexts implemented in MPLS VPN? () A. RIP does not support routing contextsB. routing contexts are implemented in a single routing processC. routing contexts are implemented using multiple routing processesD. routing contexts are implemented as several instances of a single routing processE. routing contexts are implemented as a single instance of several routing processes

Which statements are true regarding classless routing protocols?() A. The use of discontiguous subnets is not allowedB. The use of variable length subnet masks is permittedC. RIP v1 is a classless routing protocolD. IGRP supports classless routing within the same autonomous systemE. RIP v2 supports classless routing

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.

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

You are a network administrator and you need to implement a routing protocol onyour network that provides:* Scalability* VLSM support* Minimal overhead* Support for connecting networks using routers of multiple vendorsWhich of the following routing protocol would best serve your needs?()A. VTPB. RIP version 1C. EIGRPD. OSPFE. IGRPF. CDP

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

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 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.

What does RPL stand for?()A、routing primary languageB、routing policy languageC、routing police languageD、routing program languageE、routing protocol language

As an experienced technician, you are responsible forT echnical Support in your company. One of the trainee implement RIP routing contests in MPLS VPN. How to respond?()A、Routing contexts are implemented in a single routing process.B、Routing contexts are implemented using multiple roubng processes.C、Routing contexts are implemented as a single instance of several routing processes.D、Routing contexts are implemented as several instances of a single routing process.

You are a network administrator and you need to implement a routing protocol on your network that provides: * Scalability * VLSM support * Minimal overhead * Support for connecting networks using routers of multiple vendors Which of the following routing protocol would best serve your needs?()A、VTPB、RIP version 1C、EIGRPD、OSPFE、IGRPF、CDP

How are RIP routing contexts implemented in MPLS VPN? ()A、RIP does not support routing contextsB、routing contexts are implemented in a single routing processC、routing contexts are implemented using multiple routing processesD、routing contexts are implemented as several instances of a single routing processE、routing contexts are implemented as a single instance of several routing processes

Which statements are true regarding classless routing protocols?()A、The use of discontiguous subnets is not allowedB、The use of variable length subnet masks is permittedC、RIP v1 is a classless routing protocolD、IGRP supports classless routing within the same autonomous systemE、RIP v2 supports classless routing

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 of the following is a TRUE statement about static routing vs. dynamic routing?()A、Dynamic routing is created adhoc and static routing cannot be changed once implemented.B、Static routing is hard-coded and requires significant administrative overhead for large networks.C、Static routing requires little administrative overhead and dynamic routing requires significant administrative overhead.D、Dynamic routing is the best solution for small networks and static routing is the best solution for large scale networks.

Which three contexts can be used as matching conditions in a source NAT configuration? ()(Choose three.)A、routing-instanceB、zoneC、interfaceD、policyE、rule-set

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

单选题As an experienced technician, you are responsible forT echnical Support in your company. One of the trainee implement RIP routing contests in MPLS VPN. How to respond?()ARouting contexts are implemented in a single routing process.BRouting contexts are implemented using multiple roubng processes.CRouting contexts are implemented as a single instance of several routing processes.DRouting contexts are implemented as several instances of a single routing process.

单选题What is an advantage of dynamic routing?()AUnlike static routing, dynamic routing provides redundant IP addresses for end-user devices.BUnlike static routing, dynamic routing requires no initial user configuration.CDynamic routing can provide increased network availability when compared to static routing.DDynamic routing provides DNS services along with IP connectivity; static routing does not.

单选题What is an advantage of dynamic routing?()AUnlike static routing, dynamic routing provides redundant IP addresses for end-user devicesBUnlike static routing, dynamic routing requires no initial user configurationCDynamic routing can provide increased network availability when compared to static routingDDynamic routing provides DNS services along with IP connectivity; static routing does not

单选题Cisco IOS XR has implemented a nonstop routing feature so that when RP failover occurs, the routinginformation can be recovered locally. Which protocol does not support the NSR feature?()AOSPFBLDPCBGPDIS-ISERSVP

单选题Which of the following is a TRUE statement about static routing vs. dynamic routing?()ADynamic routing is created adhoc and static routing cannot be changed once implemented.BStatic routing is hard-coded and requires significant administrative overhead for large networks.CStatic routing requires little administrative overhead and dynamic routing requires significant administrative overhead.DDynamic routing is the best solution for small networks and static routing is the best solution for large scale networks.

多选题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