JT(IT) 2018 PART-B Computer Science
August 2, 2024Higher-Education-and-Politics
August 3, 2024JT(IT) 2016 PART-B Computer Science
| Question 6 |
One of the ad-hoc solutions to count to infinity problem in network routing is:
| The split horizon hack
| |
| Flow based routing | |
| Flooding
| |
| Shortest path routing
|
Question 6 Explanation:
There are 2 possible solutions are:
1. Route Poison
2. The split horizon hack
1. Route Poison
2. The split horizon hack
Correct Answer: A
Question 6 Explanation:
There are 2 possible solutions are:
1. Route Poison
2. The split horizon hack
1. Route Poison
2. The split horizon hack
Subscribe
Login
0 Comments