Routing in network | Link state routing | Dijkastra algorithm

preview_player
Показать описание
questions
1. what is routing ?

2. how dijkastra algorithm works

4. flow chart for link state routing

5. what is premanant list

6. what is tantative list

#computer #networks #routing
Рекомендации по теме
Комментарии
Автор

Can any node be left in tentative list at the end ?

iqrafayyaz
Автор

Is there any case when all nodes are not in the permanent list at the end ?

iqrafayyaz