EE450_HW6

# EE450_HW6 - Consider the following Bridged LAN comprising...

This preview shows pages 1–2. Sign up to view the full content.

EE450 Fall 2006 Homework #6 Due: Tuesday, November 14 th Reading Assignment: Read Chapter 4, Sections 4.1, 4.4, 4.5 and 4.6 Text book Problems from Chapter 4: Problems 7, 8, 10, 11, 13, 15, 16, 18, 21 and 23 Supplementary Problems: 1. Construct a Spanning-tree topology computed by the spanning tree algorithm for the interconnected LAN shown below. Assume B 1 is the Root Bridge . Go through the process in detail (I am not interested in the final answer). Use the symbol “R” to indicate a “Root Port” and the Symbol “D” to indicate a “Designated Port”. B 1 B 2 B 4 B 3 B 5 LAN 1 LAN 2 LAN 4 LAN 3 (1) (2) (1) (2) (2) (2) (1) (2) (1) (1) (3) 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2.
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Consider the following Bridged LAN comprising of three LANs. Assume the forwarding Tables are initially empty. Suppose the following stations transmits frames (in the following order): S 1 to S 5 , S 3 to S 2 , S 4 to S 3 , S 2 to S 1 . Clearly explain, step by step (I am not interested in final answer !!) how the forwarding tables for B 1 and B 2 are filled up with appropriate entries after the frames have been completely transmitted. Indicate the mode of operation of each bridge during each step of transmissions. S 2 B 1 B 2 S 4 LAN 1 LAN 2 S 3 S 5 LAN 3 S 1 (1) (2) (1) (2) Port Station Port Station 2...
View Full Document

## This note was uploaded on 02/27/2008 for the course EE 450 taught by Professor Zahid during the Fall '06 term at USC.

### Page1 / 2

EE450_HW6 - Consider the following Bridged LAN comprising...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online