Question: In the diagram below, from Ethernet Learning Algorithm, suppose node D is connected to S5. Now, with the tables as shown by the labels in
In the diagram below, from Ethernet Learning Algorithm, suppose node D is connected to S5. Now, with the tables as shown by the labels in the diagram (that is, S5 knows about A and C, etc), D sends to B.
Which switches will see this DB packet, and thus learn about D? Of these switches, which do not already know where B is and will use fallback-to-flooding?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
