1 votes 1 votes True / False ) LSR uses dijkstra algorithm ? ) LSR working is similar to dijkstra algorithm ? ) DVR uses bellman algorithm for finding the shortest distance to other routers/hops? Computer Networks computer-networks routing link-state-routing + – Gurdeep Saini asked Jan 2, 2019 Gurdeep Saini 1.7k views answer comment Share Follow See 1 comment See all 1 1 comment reply Naveen Kumar 3 commented Jan 2, 2019 reply Follow Share all true 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes 1.) LSR uses the Dijkstra Algorithm whereas DVR uses Algorithm similar to Bellman-Ford (Not Exactly) Therefore the ANSWER: TRUE 2.) ANSWER: TRUE (obviously) 3.) ANSWER: TRUE faisal_sayyed answered Dec 6, 2019 faisal_sayyed comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes yes all TRUE raju paul answered Jun 19, 2019 raju paul comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes LSR is based on flooding, therefore, for finding out the single-source shortest path, it uses Diskstra's Algorithm with time complexity O(ElogV). Whereas, DVR is based on routing so it used the Bellman-Ford algorithm. Paras Nath answered May 24, 2020 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.