Due date: see class webpage
We observed the interactions of the two nodes for a long time and found that:
|
Based on these observations, we will assume that:
|
Questions:
|
Messages have the same length and it takes 0.1 sec to transmit a message.
|
I.e.:
|
Question:
|
At time t = 0, an Ethernet host senses that the Ether channel is idle and transmits.
As you know, the Ethernet uses CSMS/CD and Ethernet hosts will sense the channel (while it is transmitting) for possible collision.
Question:
|
Let A and B be two Ethernet hosts attempting to transmit on an Ethernet network. Each host has a steady queue of frames ready to send.
A's frames will be numbered as A1, A2 and so on, and B's frames will be numbered as B1, B2 and so on.
The backoff time unit T = 50 micro seconds.
Suppose A and B simultaneously (= at the same time) attempt to send frame 1 and the transmissions collide. Then A chooses backoff time 0×T (i.e., A picked the random number 0) and B chooses backoff time 1×T. So A wins the race and transmits its first frame A1 successfully (in the mean time, when B retries at time 1×T, B will sense A's transmission; so B will wait for A to finish its transmission.)
Fact:
|
Questions:
|
Suppose A wins the second backoff race.
A will now attempt to transmit frame A3 while B is still attempting to transmit frame B1.
B will now pick a back-off time from 0×T, 1×T, 2×T, 3×T 4×T, 5×T, 6×T, and 7×T - each outcome is equally likely.
Question:
|