Due: See class webpage.
Prove that the StopandWait protocol will operate correctly using only 2 different sequence number
I.e.: you only need to label the frame in StopandWait using sequence numbers:

Your proof should focus only on why using 2 seequence numbers will not cause ambiguity
The transmission data rate on the link is 1 Gbps.
Each data frame consists of 10000 bits and each ACK frame is 100 bits long.
The sender needs to transfer a file of 1,000,000 bytes.
There are no transmission errors.
Show your derivation to get full credit.
Suppose you are designing a GobackN sliding window protocol for a 1 Mbps pointtopoint link to the moon.
The a oneway propagation delay between earth and moon is 1 sec.
Assume that the frame size is fixed and is equal to 1 KBytes, you can assume that 1 KBytes = 8000 bits.
You can assume the ACK frame is negligible.

Hint: find the smallest send window size that will will allow the node to transmit continuously (without stopping)
A sliding window protocol uses the cumulative ACK scheme (where ACK n means reception of all frames upto and including frame n).
The number of bits in the sequence number field is 3 (8 different sequence numbers).
A receive windows size and send window size is 5.
The initial send and receiver windows are {0,1,2,3,4}.
The following events occurs at the receiver in the given sequence:

Messages have the same length and it takes 0.1 sec to transmit a message.

The maximum network diameter in Ethernet is 2500 m, i.e., the distance between any two nodes on an Ethernet is 2500 m. The speed of electrical signals in copper is 2x10^{8} m/sec.
At time t = 0, an Ethernet host senses that the channel is idle and immediately begin to transmit. As you know, the Ethernet host will sense the channel (while it is transmitting) for possible collision.
(This question is adapted from Question 37 in the text book on page 164.  from an old edition :))
Let A and B be two Ethernet hosts attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A's frames will be numbered as A_{1}, A_{2} and so on, and B's frames will be numbered as B_{1}, B_{2} and so on. The backoff time unit is T = 50 micro seconds.
Suppose A and B simultaneously attempt to send frame 1, collide and A chooses backoff time 0xT and B chooses backoff time 1xT. So A wins the race and transmits A_{1} while B waits for A to finish its transmission.

