Question 16 (1 point) In a distance-vector routing algorithm, each node has a map of the entire network and determines the shortest path from itself to all other nodes in the network

Subject:Computer SciencePrice:4.86 Bought9

Share With

Question 16 (1 point)

In a distance-vector routing algorithm, each node has a map of the entire network and determines the shortest path from itself to all other nodes in the network.

Question 16 options:

TrueFalse

Question 17 (1 point)

In the BGP routing algorithm, each AS advertises to its neighbors its estimates of the shortest distances from the AS to all possible destination ASs.

Question 17 options:

TrueFalse

Question 18 (1 point)

CRC error detection, as used in Ethernet, is always able to detect whether there is an error in a frame.

Question 18 options:

TrueFalse

Question 19 (1 point)

A gateway router must run both an intra-AS routing algorithm and an inter-AS routing algorithm.

Question 19 options:

TrueFalse