The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
98 views
Which of the following algorithm always guarantees that the transmitted packet is forwarded using minimum number of hops?
  1. Link state routing
  2. Distance vector routing
  3. Flooding
  4. Load shedding
asked in Computer Networks by Boss (17.2k points) | 98 views
0
in floodding shortest path is guaranteed
0
i think it should be link state algo which use flooding and dijisktra shortest path algo
0
I'm confused here
0
flooding is nothing but taking a packet which is coming from one interface and put it in all interfaces except the one from which it arrived on.

Since we are putting the packet all the interfaces, i don't care whatever path that packet has taken, at the destination the packet which takes minimum hops would reach first, by this shortest path is always guaranteed..
0
link state also do same .. right .. then?
0
What is the source for this?

Any references?

Please log in or register to answer this question.

Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,069 questions
53,206 answers
184,550 comments
70,420 users