The Routing Information Protocol (RIP) is an intradomain routing based on _________ routing.
A)
distancevector
B)
link state
C)
path vector
D)
none of the above

1 Answer

Answer :

distancevector

Related questions

Description : The Open Shortest Path First (OSPF)protocol is an intradomain routing protocolbased on _______ routing. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

Description : The Multicast Open Shortest Path First (MOSPF)protocol is an extension of the OSPF protocol that uses multicast routing to create source-based trees. The protocol is basedon _______ routing. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

Description : The _________ routing uses the Dijkstra algorithm to build aroutingtable. A) distancevector B) link state C) path vector D) none of the above

Last Answer : link state

Description : . In _______ routing, the least cost routebetween any two nodes is theroute with the minimum distance. A) path vector B) distancevector C) link state D) none of the above

Last Answer : distancevector

Description : _______ is an implementation of multicast distance vector routing. It is asource-based routing protocol, based on RIP. A) MOSPF B) DVMRP C) CBT D) none of the above

Last Answer : DVMRP

Description : In ________, eachnode maintains avector (table)of minimum distances to every node. A) path vector B) distancevector C) link state D) none of the above

Last Answer : distancevector

Description : ________ is an interdomain routingprotocol using path vector routing. A) BGP B) RIP C) OSPF D) none of the above

Last Answer : BGP

Description : RIP stands for ________ a. Reduced Information Protocol b. Routing Internet Protocol c. Routing Information Protocol d. Reduced Internet Protocol

Last Answer : c. Routing Information Protocol

Description : In ________ routing, we assume that there is one node (or more) ineach autonomous system that acts on behalf of the entire autonomous system. A) distant vector B) path vector C) link state D) none of the above

Last Answer : path vector

Description : Which of the following routing algorithms can be used for network layer design? a. shortest path algorithm b. distance vector routing c. link state routing d. all of the mentioned

Last Answer : d. all of the mentioned

Description : The examples of Interior Gateway Protocols (IGP) are. i) Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii

Last Answer : B) i, and ii only

Description : Open Short Path First (OSPF) ii) Routing Information Protocol (RIP) iii) Border Gateway Protocol (BGP) A) i only B) i, and ii only C) i and iii only D) All i, ii and iii

Last Answer : B) i, and ii only

Description : Routing between autonomous systems is referredto as ____________. A) interdomain routing B) intradomain routing C) both a and b D) none of the above

Last Answer : interdomain routing

Description : Routing inside an autonomous system is referred to as _______________. A) interdomain routing B) intradomain routing C) both a and b D) none of the above

Last Answer : intradomain routing

Description : Explain distance vector routing and link state routing

Last Answer : Distance vector routing _ Sharing information _ Routing table _ Creating the table _ Updating the table _ Updating algorithm

Description : DVMRP is a ________routing protocol,based on RIP. A) source-based B) group-shared C) both a and b D) none of the above

Last Answer : source-based

Description : Multicast link state routing uses the _______ tree approach. A) source-based B) group-shared C) a or b D) none of the above

Last Answer : source-based

Description : Which one of the following algorithm is not used for congestion control? a. traffic aware routing b. admission control c. load shedding d. routing information protocol

Last Answer : d. routing information protocol

Description : In distance vector routing,each node periodically shares its routing table with_________ and whenever there is achange. A) every other node B) its immediate neighbors C) one neighbor D) none of the above

Last Answer : its immediate neighbors

Description : Distance Vector Routing is a……... routing algorithm, it consists of a data structure called a ……… A. Static , routing table B. Dynamic, look-up table C. Dynamic, routing table D. Static, look-up table

Last Answer : C. Dynamic, routing table

Description : Define Routing. What is distance vector routing?

Last Answer : The process by which nodes exchange topological information to build correct forwarding tables. A lowest cost path algorithm used in routing. Each node advertises reachability information and associated costs ... , uses the updates it receives to construct its forwarding table. RIP uses it.

Description : Dynamic routing protocol enable routers to a. Dynamically discover and maintain routes b. Distribute routing updates to other routers c. Reach agreement with other routers about the network topology d. All of the above

Last Answer : d. All of the above

Description : Which of the following assertions is FALSE about the Internet Protocol (IP)? a. It is possible for a computer to have multiple IP addresses b. IP packets from the same source to the same ... outgoing packets; the route is determined only by the routing tables in the routers on the way

Last Answer : d. The packet source cannot set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way

Description : Explain difference between distance vector and link state routing. 

Last Answer : Distance Vector Routing Link State Routing Routing tables are updated by exchanging information with the neighbours.  Complete topology is distributed to every router to update a routing table. ... Harder to configure Count to infinity problem No count to infinity problem

Description : What is link state routing?

Last Answer : A lowest cost path algorithm used in routing. Information on directly connected neighbors and current link costs are flooded to all routers; each router uses this information to build a view of the ... routing information sent by a router to all other router by a packet called link state packet.

Description : In multicast routing, eachinvolvedrouter needs toconstructa ________ path tree for each group. A) average B) longest C) shortest D) none of the above

Last Answer : shortest

Description : In unicast routing,each router in the domain has a table thatdefines a______ path tree to possible destinations. A) average B) longest C) shortest D) none of the above

Last Answer : shortest

Description : In OSI network architecture, the routing is performed by a. network layer b. data link layer c. transport layer d. session layer e. none of above

Last Answer : network layer

Description : The routing processor of arouter performs the ________ layer functions of therouter. A) physical and data link B) network C) transport D) none of the above

Last Answer : network

Description : In OSI network architecture, the routing is performed by a. network layer b. data link layer c. transport layer d. session layer

Last Answer : a. network layer

Description : Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B ... What is the optimal window size that A should use? a. 20 b. 40 c. 160 d. 320

Last Answer : b. 40

Description : High-level Data Link Control (HDLC) is a _______ protocol for communication over point-to-pointand multipoint links. A) bit-oriented B) byte-oriented C) character-oriented D) none of the above

Last Answer : bit-oriented

Description : At the data link layer, Frame Relayusesa protocol that supports _____control. A) flow B) error C) either (a) or (b D) neither (a) nor (b)

Last Answer : neither (a) nor (b)

Description : In which OSI layers does the FDDI protocol operate? A) Physical B) Data link C) Network D) A and B

Last Answer : D) A and B

Description : Consider a link with packet loss probability of 0.2. What is the expected number of transmissions it would take to transfer 200 packets given that the stop and wait protocol is used? a. 125 b. 250 c. 225

Last Answer : b. 250

Description : Which of the following is a data link protocol? a. ethernet b. point to point protocol c. hdlc d. all of the mentioned

Last Answer : d. all of the mentioned

Description : Which protocols adopted the standards of HDLC (High Level Link Control) protocol? a. X.25 protocol as LAPB (Link Access Procedure Balanced, V.42 protocol as LAPM (Link Access Procedure for ... Services Digital Network) protocol as LAPD (Link Access Procedure on D channel) d. All the above

Last Answer : d. All the above

Description : Choose the Protocols working in the Data Link Control Layer of OSI model below. a. ATM (Asynchronous Transfer Mode), Frame Relay b. HDLC (High Level Data Link Control), SDLC (Synchronous Data Link Control) c. ARP (Address Resolution Protocol), IEEE802.3 d. All the above

Last Answer : d. All the above

Description : In the TCP/IP protocol architecture, the Network Access Layer includes ………………………………...layers of the OSI Reference Model. A. presentation, session, application B. physical, data link, network C. data link, network D. physical, data link

Last Answer : B. physical, data link, network

Description : ………………...is a minimal protocol that allows isolated hosts to link via TCP/IP over the telephone network and ………………..uses a proposed international standard for transmitting HDLC over asynchronous lines. A. LCP, PPP B. PPP, LCP C. SLIP, PPP D. PPP, SLIP

Last Answer : C. SLIP, PPP

Description : The IP Control Protocol (IPCP) is the NCP for IP and is responsible for ………., …………., and disabling the IP protocol on both ends of the point-to-point link. A. Reframing , enabling B. Deleting, reframing C. configuring, enabling, D. configuring, reframing

Last Answer : C. configuring, enabling,

Description : Data Link Control Protocol (HDLC) is implemented at the ……… A. Data link layer B. Network layer C. transport layer D. Physical layer

Last Answer : A. receive sliding window.

Description : HTTP is ________ protocol. a) application layer b) transport layer c) network layer d) data link layer

Last Answer : a) application layer

Description : Inthe _________ protocol weavoid unnecessary transmissionby sending only frames that are corrupted. A) Stop-and-Wait ARQ B) Go-Back-N ARQ C) Selective-Repeat ARQ D) none of the above

Last Answer : Selective-Repeat ARQ

Description : IP is _________ datagram protocol. A) an unreliable B) a connectionless C) botha and b D) noneof the above

Last Answer : botha and b

Description : ICMP is a _________ layer protocol. A) datalink B) transport C) network D) noneof the above

Last Answer : network

Description : FCP stands for _________ a. Fiber Channel Protocol b. Field Channel Protocol c. Fast Channel Protocol d. Fiber Carrying Protocol

Last Answer : a. Fiber Channel Protocol

Description : DDP stands for _________ a. Datagram Delivery Protocol b. Device Delivery Protocol c. Datagram Device Protocol d. Device Datagram Protocol

Last Answer : a. Datagram Delivery Protocol

Description : Network layer protocol exits in _________ a. Host b. Switches c. Packets d. Bridges

Last Answer : a. Host