What are the two basic approaches used to perform a distributed route computation, and how does each work?
What will be an ideal response?
There are two basic approaches used to perform distributed route computation:
? Link-State Routing (LSR), which uses Dijkstra’s algorithm: In LSR routing, packet switches
periodically send messages across the network that carry the status of a link between two
packet switches. Each status message is broadcast to all switches. Every switch runs software
that collects incoming status messages and uses them to build a graph of the network.
? Distance-Vector Routing (DVR), which uses another approach: Each link in the network is
assigned a weight, and the distance to a destination between two packet switches is defined to
be the sum of weights along the path between the two. In DVR scheme, a router send a
complete list of destinations and the current cost of reaching each network that can be
reached.
In both LSR and DVR schemes packet switches to exchange messages periodically.
You might also like to view...
Describe the value of quantitative analysis.
What will be an ideal response?
What are the row and column input cells in this table?
A. B5 and B4 B. B9 C. B6 and B2 D. E5 and E4
In the weighted point product evaluation method, if more than one support person evaluates competing products, the score a product receives is usually ____.
A. the lowest score the product received from any evaluator B. the highest score the product received from any evaluator C. the average score of all evaluators D. not calculated when there is disagreement between evaluators
You decide to use recursion in your implementation. Consider method getIndexOf. You use a variablesearchIndex to work your way through the array. What would be the two base cases?
What will be an ideal response?