This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: These transmissions will reach the neighbor ports and be buffered so that comparisons can be made. Go through the process of resolving the topology using the spanning tree algorithm and eliminate the loops. When you have completed the exercise indicate the following: a. Which bridge will become root? i. Bridge 2 b. Which ports will be root ports? i. Bridge 1, port 1 ii. Bridge 3, port 1 iii. Bridge 4, port 1 c. Which ports will be designated i. Bridge 2, port 1 ii. Bridge 2, port 2 iii. Bridge 1, port 1 iv. Bridge 1, port 3 v. Bridge 3, port 2 vi. Bridge 3, port 3 vii. Bridge 4, port 1 d. Which ports will be blocked? i. Bridge 1, port 2 ii. Bridge 4, port 2 e. Which bridges will be designated? i. Bridge 1, 3, 4...
View Full Document
- Spring '08