Which mechanism in the Stop-and-Wait protocol guarantees that data is reliably received by the receiver?
Think about how the sender knows the receiver got the data correctly.
In Stop-and-Wait, the sender sends one packet and waits for an acknowledgment (ACK) from the receiver before sending the next. This ensures that each packet is received correctly before moving on.
Which of the following best describes the main drawback of the Go-Back-N reliable data transfer protocol?
Consider what happens when a packet is lost in the middle of a sequence.
Go-Back-N retransmits the lost packet and all subsequent packets, even if some were received correctly, which can waste bandwidth.
Which statement correctly compares Selective Repeat and Go-Back-N protocols in terms of efficiency and complexity?
Think about how each protocol handles lost or corrupted packets and buffering.
Selective Repeat retransmits only the packets that are lost or corrupted and buffers out-of-order packets, making it more efficient but also more complex than Go-Back-N, which retransmits all packets after a loss and does not require buffering.
What is the primary reason reliable data transfer protocols use sequence numbers for packets?
Consider what happens if packets arrive out of order or are repeated.
Sequence numbers help the receiver identify duplicates and place packets in the correct order, which is essential for reliable data transfer.
Assume a Stop-and-Wait protocol is used over a link with a bandwidth of 1 Mbps and a round-trip time (RTT) of 100 ms. Each data packet is 1000 bits. What is the approximate throughput of this protocol?
Throughput = Packet size / (RTT + Transmission time). Calculate transmission time as packet size divided by bandwidth.
Transmission time = 1000 bits / 1,000,000 bps = 0.001 seconds (1 ms). RTT = 0.1 seconds (100 ms). Total time per packet = 0.101 seconds. Throughput = 1000 bits / 0.101 s ≈ 9,900 bits per second, approximately 10,000 bps.