_______ 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

_______ 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
by

1 Answer

Answer :

DVMRP
by

Related questions

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

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

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

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

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

Description : 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

Last Answer : distancevector

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

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

MOSPF is a _______ protocol. A) data-driven B) command-driven C) both a and b D) none of the above

Description : MOSPF is a _______ protocol. A) data-driven B) command-driven C) both a and b D) none of the above

Last Answer : data-driven

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

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

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

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

Last Answer : BGP

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

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

CBT isa ________ protocol that usesa core as the root of the tree. A) source-based B) group-shared C) a or b D) none of the above

Description : CBT isa ________ protocol that usesa core as the root of the tree. A) source-based B) group-shared C) a or b D) none of the above

Last Answer : group-shared

. 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

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

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

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

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

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

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

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

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

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

Explain distance vector routing and link state 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

Define Routing. What is distance vector routing?

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.

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

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

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

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

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

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

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

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

In IPv6,_______ address defines asingle computer. A) aunicast B) a multicast C) an anycast D) none of the above

Description : In IPv6,_______ address defines asingle computer. A) aunicast B) a multicast C) an anycast D) none of the above

Last Answer : aunicast

A multicast message is sent from _______ to _______. A) onesource; one destination B) onesource; multiple destinations C) multiple sources; onedestination D) noneof the above

Description : A multicast message is sent from _______ to _______. A) onesource; one destination B) onesource; multiple destinations C) multiple sources; onedestination D) noneof the above

Last Answer : onesource; multiple destinations

An ARP request is normally _______. A) broadcast B) multicast C) unicast D) noneof the above

Description : An ARP request is normally _______. A) broadcast B) multicast C) unicast D) noneof the above

Last Answer : broadcast

PIM-DM is used in a _______ multicast environment, suchas a LAN. A) dense B) sparse C) a or b D) none of the above

Description : PIM-DM is used in a _______ multicast environment, suchas a LAN. A) dense B) sparse C) a or b D) none of the above

Last Answer : dense

A _______ message tells an upstream router to start sending multicast messages for a specific groupthrough aspecific router. A) weed B) graftC)pruneD)none of the above

Description : A _______ message tells an upstream router to start sending multicast messages for a specific groupthrough aspecific router. A) weed B) graft C) prune D) none of the above

Last Answer : graft

A _______ message tells an upstream router to stop sending multicast messages for a specific group through aspecific router. A) weed B) graft C) prune D) none of the above

Description : A _______ message tells an upstream router to stop sending multicast messages for a specific group through aspecific router. A) weed B) graft C) prune D) none of the above

Last Answer : prune

RPB creates a shortest path _______ tree from thesourceto each destination. A) unicast B) multicast C) broadcast D) none of the above

Description : RPB creates a shortest path _______ tree from thesourceto each destination. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : broadcast

A one-to-one communication betweenone source and one destination is classified as a _______ communication. A) unicast B) multicast C) broadcastD)none of the above

Description : A one-to-one communication betweenone source and one destination is classified as a _______ communication. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : unicast

A one-to-many communication between one sourceand a specific group of hosts is classifiedas a _______ communication. A) unicast B) multicast C) broadcast D) none of the above

Description : A one-to-many communication between one sourceand a specific group of hosts is classifiedas a _______ communication. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : multicast

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

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

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 destination can take different routes in the network c. IP ensures that a packet is discarded if it is unable to reach its destination within a given number of hops 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 : 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

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

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

A… ................is an implementation of the same protocol in the equivalent layer on aremote system. a. Physical layer b. peer c. protocol stack d. layer

Description : A… ................is an implementation of the same protocol in the equivalent layer on aremote system. a. Physical layer b. peer c. protocol stack d. layer

Last Answer : b. peer

The metric usedby _______ is the hopcount. A) OSPF B) RIP C) BGP D) none of the above

Description : The metric usedby _______ is the hopcount. A) OSPF B) RIP C) BGP D) none of the above

Last Answer : RIP

The Dynamic routing table is one _______ A. with manual entries B. which is updated automatically C. MAC entries D. none of the above

Description : The Dynamic routing table is one _______ A. with manual entries B. which is updated automatically C. MAC entries D. none of the above

Last Answer : B. which is updated automatically

The static routing table is one _______ A. with manual entries B. which is updated automatically C. MAC entries D. none of the above

Description : The static routing table is one _______ A. with manual entries B. which is updated automatically C. MAC entries D. none of the above

Last Answer : A. with manual entries

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

Explain difference between distance vector and link state routing.

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

Computer Based Training (CBT) is a type of ……….. . -Technology

Description : Computer Based Training (CBT) is a type of ……….. . -Technology

Last Answer : Computer Based Training (CBT) is a type ofE-learning

In Ethernet addressing, ifall the bits are 1s, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, ifall the bits are 1s, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : broadcast

In Ethernet addressing, if the least significant bit of the firstbyte is 1, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, if the least significant bit of the firstbyte is 1, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : multicast

In Ethernet addressing, if the least significant bit of the firstbyte is 0, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, if the least significant bit of the firstbyte is 0, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : unicast

Which of the following couldnot be an Ethernet multicast destination? A) B7:7B:6C:DE:10:00 B) 7B:AA:C1:23:45:32 C) 7C:56:21:1A:DE:F4 D) 83:32:21:21:4D:34

Description : Which of the following couldnot be an Ethernet multicast destination? A) B7:7B:6C:DE:10:00 B) 7B:AA:C1:23:45:32 C) 7C:56:21:1A:DE:F4 D) 83:32:21:21:4D:34

Last Answer : 7C:56:21:1A:DE:F4

If an Ethernet destination address is08:07:06:05:44:33, then this is a ______ address. A) unicast B) multicast C) broadcast D) any of theabove

Description : If an Ethernet destination address is08:07:06:05:44:33, then this is a ______ address. A) unicast B) multicast C) broadcast D) any of theabove

Last Answer : unicast

f an Ethernet destination address is07:01:02:03:04:05, then this is a ______ address. A) unicast B) multicast C) broadcast D) any of theabove

Description : f an Ethernet destination address is07:01:02:03:04:05, then this is a ______ address. A) unicast B) multicast C) broadcast D) any of theabove

Last Answer : multicast

In IPv6,_________addressdefinesagroup of computers. A) aunicast B) a multicast C) an anycast D) none of the above

Description : In IPv6,_________addressdefinesagroup of computers. A) aunicast B) a multicast C) an anycast D) none of the above

Last Answer : a multicast

In IPv6,____ address defines a groupof computers with addresses that have thesame prefix. A) aunicast B) a multicast C) an anycast D) none of the above

Description : In IPv6,____ address defines a groupof computers with addresses that have thesame prefix. A) aunicast B) a multicast C) an anycast D) none of the above

Last Answer : an anycast

The least significant 23 bits in a 48-bit Ethernet address identify a ________. A) multicast router B) host C) multicast group D) noneof the above

Description : The least significant 23 bits in a 48-bit Ethernet address identify a ________. A) multicast router B) host C) multicast group D) noneof the above

Last Answer : multicast group

IGMP helps a ________ router createand update a list of loyal members relatedto each router interface. A) broadcast B) unicast C) multicast D) noneof the above

Description : IGMP helps a ________ router createand update a list of loyal members relatedto each router interface. A) broadcast B) unicast C) multicast D) noneof the above

Last Answer : multicast

Which of the following is true about ICMP messages? A) An ICMP error message may be generated for an ICMP error message. B) An ICMP error message may be generated only for the first fragment. C) An ICMP error message may be generated for a multicast datagram. D) noneis true

Description : Which of the following is true about ICMP messages? A) An ICMP error message may be generated for an ICMP error message. B) An ICMP error message may be generated only for the first fragment. C) An ICMP error message may be generated for a multicast datagram. D) noneis true

Last Answer : An ICMP error message may be generated only for the first fragmen