Scribd
Upload
189 views6 pages

Tutorial 2

1. The document discusses the sliding window algorithm and proves that if DATA[6] is in the receive window, DATA[0] or older data cannot arrive at the receiver. It also proves that if ACK[6] may be sent, ACK[2] or earlier cannot be received. 2. It asks to express the available bandwidth of an Ethernet network with N stations trying to transmit simultaneously as a function of N, given the packet size is 5 slot times on average. 3. It asks to calculate the time required for an 802.11b station configured for RTS/CTS to transmit a 1,000 byte frame and receive the acknowledgement as a function of SIFS and D

Uploaded by

Firas Alsamaraai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
189 views6 pages

Tutorial 2

1. The document discusses the sliding window algorithm and proves that if DATA[6] is in the receive window, DATA[0] or older data cannot arrive at the receiver. It also proves that if ACK[6] may be sent, ACK[2] or earlier cannot be received. 2. It asks to express the available bandwidth of an Ethernet network with N stations trying to transmit simultaneously as a function of N, given the packet size is 5 slot times on average. 3. It asks to calculate the time required for an 802.11b station configured for RTS/CTS to transmit a 1,000 byte frame and receive the acknowledgement as a function of SIFS and D

Uploaded by

Firas Alsamaraai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Name 邓锐

ID 201820263

1. (Sliding window) Consider the sliding window algorithm with SWS = RWS = 3,
with no out-of-order arrivals and with infinite-precision sequence numbers.
(a) Show that if DATA[6] is in the receive window, then DATA[0] (or in general
any older data) cannot arrive at the receiver (and hence that MaxSeqNum = 6
would have sufficed).
(b) Show that if ACK[6] may be sent (or, more literally, that DATA[5] is in the
sending window), then ACK[2] (or earlier) cannot be received.
These amount to a proof of the formula given in Section 2.5.2, particularized to
the case SWS = 3. Note that part (b) implies that the scenario of the previous
problem cannot be reversed to involve a failure to distinguish ACK[0] and ACK[5]
.

2. (Ethernet) Suppose that N Ethernet stations, all trying to send at the same time,
require N/2 slot times to sort out who transmits next. Assuming the average
packet size is 5 slot times, express the available bandwidth as a function of N
3. (802.11 WLAN) Suppose an 802.11b station is configured to always reserve the
channel with the RTS/CTS sequence. Suppose this station suddenly wants to
transmit 1,000 bytes of data, and all other stations are idle at this time. Assume a
transmission rate of 12 Mbps. As a function of SIFS and DIFS, and ignoring
propagation delay and assuming no bit errors, calculate the time required to
transmit the frame and receive the acknowledgement.

You might also like