Question: 27suppose we have the ethernet switches s1 through s4 arranged...
2.7.♢Suppose we have the Ethernet switches S1 through S4 arranged as below. All forwarding tables are empty; each switch uses the learning algorithm of 2.4 Ethernet Switches.
B │ S4 │ A───S1────────S2────────S3───C │ D
Now suppose the following packet transmissions take place:
- A sends to D
- D sends to A
- A sends to B
- B sends to D