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

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

1 Answer

Answer :

link state
by

Related questions

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

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

. 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

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

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

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

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

________ 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

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

An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Description : An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra' algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm

Last Answer : (D) Floyd-Warshall algorithm

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

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

Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm

Description : Which of the following is not a congestion policy at network layer? a. Flow Control Policy b. Packet Discard Policy c. Packet Lifetime Management Policy d. Routing Algorithm

Last Answer : a. Flow Control Policy

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

In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets

Description : In link state routing algorithm after construction of link state packets, new routes are computed using: (1) DES algorithm (2) Dijkstra's algorithm (3) RSA algorithm (4) Packets 

Last Answer : Answer: 2

Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Description : Which of the following algorithms is not a broadcast routing algorithm ? (A) Flooding (B) Multidestination routing (C) Reverse path forwarding (D) All of the above

Last Answer : (D) All of the above

Which algorithm is used to decide the path to transfer the packets from source to destination? (1) Routing (2) Pathing (3) Selecting (4) Directing

Description : Which algorithm is used to decide the path to transfer the packets from source to destination? (1) Routing (2) Pathing (3) Selecting (4) Directing

Last Answer : Routing

_______ 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

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

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.

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

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

LBG algorithm is used to design a _________. a. Quantizer b. Vector c. Codebook d. Index table

Description : LBG algorithm is used to design a _________. a. Quantizer b. Vector c. Codebook d. Index table

Last Answer : c. Codebook

A _______is the optical link connecting two neighbor devices. A) section B) line C) path D) none of the above

Description : A _______is the optical link connecting two neighbor devices. A) section B) line C) path D) none of the above

Last Answer : line

The _________ product defines the number ofbits that can fill the link. A) bandwidth-period B) frequency-amplitude C) bandwidth-delay D) delay-amplitude

Description : The _________ product defines the number ofbits that can fill the link. A) bandwidth-period B) frequency-amplitude C) bandwidth-delay D) delay-amplitude

Last Answer : bandwidth-delay

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 OSI model, when data is sent from device A to device B, the 5th layer to receive data at B is _________ a. Application layer b. Transport layer c. Link layer d. Session layer

Description : In OSI model, when data is sent from device A to device B, the 5th layer to receive data at B is _________ a. Application layer b. Transport layer c. Link layer d. Session layer

Last Answer : d. Session layer

In OSI model, when data is sent from device A to device B, the 5th layer to receive data at B is _________ a. Application layer b. Transport layer c. Link layer d. Session layer

Description : In OSI model, when data is sent from device A to device B, the 5th layer to receive data at B is _________ a. Application layer b. Transport layer c. Link layer d. Session layer

Last Answer : d. Session layer

The data link layer takes the packets from _________ and encapsulates them into frames for transmission. a) network layer b) physical layer c) transport layer d) application layer

Description : The data link layer takes the packets from _________ and encapsulates them into frames for transmission. a) network layer b) physical layer c) transport layer d) application layer

Last Answer : a) network layer

In OSI model, when data is sent from device A to device B, the 5th layer to receive data at B is _________ a) Application layerb) Transport layer c) Link layer d) Session layer

Description : In OSI model, when data is sent from device A to device B, the 5th layer to receive data at B is _________ a) Application layer b) Transport layer c) Link layer d) Session layer

Last Answer : d) Session layer

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

Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm

Description : Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm

Last Answer : (A) Flow Control Policy

State weather the following statement is true or false for Hierarchical Routing 1). In hierarchical routing, the routers are divided into regions. 2) Each router is having the idea about internal structure of other regions 3). Two level hierarchies may be insufficient hence it may be necessary to group the regions into clusters. A. 1. True, 2. true, 3. true B. 1. true, 2. false, 3. false C. 1. false, 2. false, 3. false D. 1. true, 2. false, 3. true

Description : State weather the following statement is true or false for Hierarchical Routing 1). In hierarchical routing, the routers are divided into regions. 2) Each router is having the idea about internal structure of other regions 3). ... C. 1. false, 2. false, 3. false D. 1. true, 2. false, 3. true

Last Answer : D. 1. true, 2. false, 3. true

In IPv6,a ______address is used ifa site with several networks uses the Internetprotocols but is not connectedto the Internet for security reasons. A) link local B) site local C) mapped D) none of the abov

Description : In IPv6,a ______address is used ifa site with several networks uses the Internetprotocols but is not connectedto the Internet for security reasons. A) link local B) site local C) mapped D) none of the abov

Last Answer : site local

In IPv6,a _______address is usedif aLAN uses the Internet protocols but isnot connected tothe Internet for security reasons. A) link local B) site local C) mapped D) none of the above

Description : In IPv6,a _______address is usedif aLAN uses the Internet protocols but isnot connected tothe Internet for security reasons. A) link local B) site local C) mapped D) none of the above

Last Answer : link local

The _____ layer uses data compression to reduce the number of bits to be transmitted. a. presentation b. network c. data link d. application

Description : The _____ layer uses data compression to reduce the number of bits to be transmitted. a. presentation b. network c. data link d. application

Last Answer : a. presentation

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

The IEEE 802.11g, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The IEEE 802.11g, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : OFDM

The IEEE 802.11b, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The IEEE 802.11b, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : DSSS

The IEEE 802.11a, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The IEEE 802.11a, uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : OFDM

The original IEEE 802.11,uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Description : The original IEEE 802.11,uses _________. A) FHSS B) DSSS C) OFDM D) either (a)or (b)

Last Answer : either (a)or (b)

_________ uses four twisted pairs. A) 1000Base-SX B) 1000Base-LX C) 1000Base-T D) none of the above

Description : _________ uses four twisted pairs. A) 1000Base-SX B) 1000Base-LX C) 1000Base-T D) none of the above

Last Answer : 1000Base-T