# tutorial6 - K × 512 bit times after a collision, where K...

This preview shows page 1. Sign up to view the full content.

EE3015 Tutorial 6 (Ethernet and Ethernet Switch) Problems 1. Suppose nodes A and B are on the same 10 Mbps Ethernet segment, and the propagation delay between the two nodes is 225 bit times. Suppose node A begins transmitting a frame and before it finishes, node B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted? 2. Consider a 100 Mbps 100BaseT Ethernet. a) In order to have an efficiency of 0.50, what should be the maximum distance between a node and the hub? Assume a frame length of 72 bytes and a propagation speed of 1.8 × 10 8 ms -1 . b) Does this maximum distance also ensure that a transmitting node A will be able to detect whether any other node transmitted while A was transmitting? Why or why not? 3. Recall that with the CSMA/CD protocol, the adapter waits
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: K × 512 bit times after a collision, where K is drawn randomly. For K = 100, how long does the adapter wait until returning to Step 2 for a 10 Mbps Ethernet? For a 100 Mbps Ethernet? 4. Consider a network in which there are four hosts, A, B, C and D, connected to a switch in a star topology. Host A is connected to interface 1 of the switch, host B to interface 2, host C to interface 3 and host D to interface 4. Suppose that (i) A sends a frame to D and (ii) D replies with a frame to A. The switch table is initially empty. Show the state of the switch table after each of these two events. For each of these events, identify the link(s) on which the transmitted frame will be forwarded....
View Full Document

## This note was uploaded on 05/01/2011 for the course ELECTRICAL EE3015 taught by Professor Albertsun during the Spring '11 term at City University of Hong Kong.

Ask a homework question - tutors are online