csma+wireless(2)

csma+wireless(2) - CS 118 Spring 2008 : Problems Problem 1...

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

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

Unformatted text preview: CS 118 Spring 2008 : Problems Problem 1 Problem 1 Suppose nodes A and B are on the same 10Mbps Ethernet bus, and the propagation delay between the two nodes is 255 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? Why or why not? If the answer is yes, then A incorrectly believes that its frame was successfully transmitted without a collision. Hint: Suppose at time t = 0 bit time, A begins transmitting a frame. In the worst case, A transmits a minimum-sized frame of 512+64 bit times. So A would finish transmitting the frame at t = 512 + 64 bit times. Thus, the answer is no, if Bs signal reaches A before bit time t = 512 + 64 bits. In the worst case, when does Bs signal reach A? Problem 2 Consider a 100 Mbps 100BASE-T Ethernet with all nodes directly connected to a hub. To have an efficiency of 0.50, what should be the maximum distance between a node and the hub? Assume a frame length of 64of 0....
View Full Document

This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.

Ask a homework question - tutors are online