0% found this document useful (0 votes)
137 views3 pages

Stop and Wait ARQ Protocol - Worksheet 2B

The document discusses stop and wait ARQ protocol. It provides problems related to throughput calculation, frame transmission diagrams, and algorithms for stop and wait ARQ at the sender and receiver. It also discusses using piggybacking to improve efficiency of the protocol.

Uploaded by

student -1
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
0% found this document useful (0 votes)
137 views3 pages

Stop and Wait ARQ Protocol - Worksheet 2B

The document discusses stop and wait ARQ protocol. It provides problems related to throughput calculation, frame transmission diagrams, and algorithms for stop and wait ARQ at the sender and receiver. It also discusses using piggybacking to improve efficiency of the protocol.

Uploaded by

student -1
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/ 3

THIAGARAJAR COLLEGE OF ENGINEERING

DEPARTMENT OF INFORMATION TECHNOLOGY


Worksheet- 2B

Flow Control – Stop and wait ARQ

1. The timer of a system using the Stop-and-Wait ARQ Protocol has a time-out of 6 ms. Draw
the flow diagram similar for four frames if the round trip delay is 4 ms. Assume no data
frame or control frame is lost or damaged.
 Repeat Problem 1 if the time-out is 4 ms and the round trip delay is 6.
 Repeat Problem 1 if the first frame (frame 0) is lost.

2. A system uses the Stop-and-Wait ARQ Protocol. If each packet carries 2000 bits of data,
how long does it take to send 2 million bits of data if the distance between the sender and
receiver is 5000 Km and the propagation speed is 3 x 108 m/s for the following cases:
 With transmission delay
 Without transmission delay
Assume no data or control frame is lost or damaged.

3. Assume that, in a Stop-and-Wait ARQ system, the bandwidth of the line is 1 Mbps, and 1 bit takes 20
ms to make a round trip. What is the bandwidth-delay product? If the system data frames are 1000 bits
in length, what is the utilization percentage of the link?

4. Write algorithms to represent the events at sender and receiver for Stop and wait ARQ.

5. A technique called piggybacking is used to improve the efficiency of the bidirectional


protocols. When a frame is carrying data from A to B, it can also carry control information
about arrived (or lost) frames from B; when a frame is carrying data from B to A, it can also
carry control information about the arrived (or lost) frames from A. The algorithm using
piggybacking for Stop and wait protocol ARQ is presented below:

Sn = 0; // Frame 0 should be sent first


Rn = 0; // Frame 0 expected to arrive first
canSend = true; // Allow the first request to go
while (true) // Repeat forever
{
WaitForEvent (); // Sleep until an event occurs
if (Event (RequestToSend) AND canSend) // Packet to send
{
GetData ();
MakeFrame (Sn , Rn); // The seqNo of frame is Sn
StoreFrame (Sn , Rn); //Keep copy for possible resending
SendFrame (Sn , Rn);
StartTimer ();
Sn = (Sn + 1) mod 2;
canSend = false;
}
if (Event (ArrivalNotification)) // Data frame arrives
{
ReceiveFrame ();
if (corrupted (frame)) sleep();
if (seqNo = = Rn) // Valid data frame
{
ExtractData ();
DeliverData (); // Deliver data
Rn = (Rn + 1) mod 2;
}
if (ackNo = = Sn) // Valid ACK
{
StopTimer ();
PurgeFrame (Sn−1 , Rn−1); //Copy is not needed
canSend = true;
}
}
if (Event(TimeOut)) // The timer expired
{
StartTimer ();
ResendFrame (Sn-1 , Rn-1); // Resend a copy
}
} // End Repeat forever

Trace the code and compare the efficiency of the protocols with and without piggybacking.

6. If the bandwidth of the line is 1.5 Mbps, RTT is 45 msec and packet size is 1 KB, then find
the link utilization in stop and wait.
7. A channel has a bit rate of 4 Kbps and one way propagation delay of 20 msec. The channel
uses stop and wait protocol. The transmission time of the acknowledgement frame is
negligible. To get a channel efficiency of at least 50%,What must be the minimum frame
size ?
8. Consider two hosts X and Y connected by a single direct link of rate 10 6 bits/sec. The
distance between the two hosts is 10,000 km and the propagation speed along the link is 2
x 108 m/sec. Host X sends a file of 50,000 bytes as one large message to host Y
continuously. Let the transmission and propagation delays be p milliseconds and q
milliseconds respectively. Compute p and q.
9. The values of parameters for the stop and wait ARQ protocol are as given below-
 Bit rate of the transmission channel = 1 Mbps
 Propagation delay from sender to receiver = 0.75 ms
 Time to process a frame = 0.25 ms
 Number of bytes in the information frame = 1980
 Number of bytes in the acknowledge frame = 20
 Number of overhead bytes in the information frame = 20
Assume that there are no transmission errors. Then the transmission efficiency (in %) of
the stop and wait ARQ protocol for the above parameters is ___________ . (correct to 2
decimal places) (GATE 2017)
10. A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames
are of size 1000 bytes and the transmission rate at the sender is 80 Kbps. Size of an
acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one
way propagation delay is 100 msec. Assuming no frame is lost, the sender throughput is
__________ bytes/sec. (GATE 2016)
11. Using stop and wait protocol, sender wants to transmit 10 data packets to the receiver. Out
of these 10 data packets, every 4th data packet is lost. How many packets sender will have
to send in total?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy