2 votes 2 votes Flooding always guaranteed to send packet from source to destination with minimum number of hops. (True / False) Computer Networks computer-networks + – VS asked Dec 31, 2017 VS 1.2k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments joshi_nitish commented Jan 1, 2018 reply Follow Share suppose the path with shortest hops is broken,then how can it guarantee ? in this case, now broken path is not eligible to be called as a shortest path, and next shortest path will be new actual shortest path 1 votes 1 votes Anu007 commented Jan 1, 2018 reply Follow Share path means there is connection , but if link is broken then it will not be called as path , second smallest path becomes new smallest path, 2 votes 2 votes Kiran Karwa commented Jan 2, 2018 reply Follow Share Is such a scenario not possible where LSP from a shorter path gets delayed and LSP of a longer path reaches first to a node ? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Answer :-TRUE ....here it's been discussed https://gateoverflow.in/79753/gatebook-cn-grand-test-q3 https://www.geeksforgeeks.org/computer-network-fixed-flooding-routing-algorithms/ https://books.google.co.in/books?id=ohDoDQAAQBAJ&pg=PT178&lpg=PT178&dq=flooding+always+select+shortest+path&source=bl&ots=iUHKV2pjik&sig=WUCECldPMhwZFkftaB0QNNqPh5w&hl=en&sa=X&ved=0ahUKEwiLmMmsubvYAhXKtI8KHRTBC-MQ6AEIRjAF#v=onepage&q=flooding%20always%20select%20shortest%20path&f=false Prateek kumar answered Jan 3, 2018 Prateek kumar comment Share Follow See all 0 reply Please log in or register to add a comment.