Routing 1: Flooding

preview_player
Показать описание
Describes how you can "route" a packet to any/every node on a network without knowing anything about the connectivity or topology of the network. Flooding is when a packet is repeatedly sent to all neighbors of a given node, as long as the total number of times the packet has been resent is not too high. The network is filled with many unnecessary copies of the packet, but it will reach its destination. Much of this material is based on content from the book Data and Computer Communications by William Stallings.
Рекомендации по теме
Комментарии
Автор

Thanks for this video. Was looking for this term online and couldn't understand it properly. You video helped me understand what flooding actually is :) Clear and concise. Keep it going.

powerik
Автор

You're a life savior, thank you!

Ammar-krkr
Автор

@Jacob Schrum: How did Node "S" come to know the initial hop count before it could send the first packet?

pramodsnarayan
Автор

Thanks!
Good, usefull video!

That wonderfull feeling when you know the alghorithm, but you don't the name of this alghorithm!

volodymyrdonets
Автор

Hello sir, this video helps me alot..🙏🏼 can u please tell me last answer how many packets sent al last.

suvidhasardar
Автор

does anyone have one for selective flooding

mooloongee
Автор

thank you, more comment is for benefit for you I guess

yavuzcangz
Автор

i thought it doesnt go back to the source, why do the upper middle Node resend it to the source?

ajlmu