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

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
by

1 Answer

Answer :

link state
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

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

. 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

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

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

________ 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

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

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

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

_______ 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

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

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

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

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

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

In OSPF, a _______ link is a network with several routersattachedto it. A) point-to-point B) transient C) stub D) none of the above

Description : In OSPF, a _______ link is a network with several routersattachedto it. A) point-to-point B) transient C) stub D) none of the above

Last Answer : transient

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

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

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

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

In OSPF, when the link between two routers is broken, the administration may create a _________ link between them usinga longer paththat probably goes throughseveral routers. A) point-to-point B) transient C) stub D) none of the above

Description : In OSPF, when the link between two routers is broken, the administration may create a _________ link between them usinga longer paththat probably goes throughseveral routers. A) point-to-point B) transient C) stub D) none of the above

Last Answer : none of the above

In OSPF, a ________ link is a network is connectedto only one router. A) point-to-point B) transient C) stub D) none of the above

Description : In OSPF, a ________ link is a network is connectedto only one router. A) point-to-point B) transient C) stub D) none of the above

Last Answer : stub

In OSPF, a ________ link connects two routers without anyother host or router in between. A) point-to-point B) transient C) stub D) none of the above

Description : In OSPF, a ________ link connects two routers without anyother host or router in between. A) point-to-point B) transient C) stub D) none of the above

Last Answer : point-to-point

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

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 principle of ________ states that the routing table is sorted from the longest mask to the shortest mask. A) first mask matching B) shortest mask matching C) longest mask matching D) none of the above

Description : The principle of ________ states that the routing table is sorted from the longest mask to the shortest mask. A) first mask matching B) shortest mask matching C) longest mask matching D) none of the above

Last Answer : longest mask matching

A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Description : A station in a network forwards incoming packets byplacing them on its shortest output queue. Whatrouting algorithm is being used? A. hot potatorouting B. flooding C. static routing D. delta routing E. None of the above

Last Answer : hot potatorouting

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

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

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

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

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.

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

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

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

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

What is link state routing?

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.

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

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

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

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

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

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

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

The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling Salesman problem c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

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 is 128 kbps. What is the optimal window size that A should use? a. 20 b. 40 c. 160 d. 320

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

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

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)

In which OSI layers does the FDDI protocol operate? A) PhysicalB) Data link C) Network D) A and 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

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

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

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

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

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 Modems) b. Frame Relay protocol as LAPF (Link Access Procedure for Frame Relay) c. ISDN (Integrated Services Digital Network) protocol as LAPD (Link Access Procedure on D channel) d. All the above

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

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

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

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

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

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

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