Day 18
Day 18
Day 18
ASCII
• The header, which normally carries the source and destination addresses
and other control information, and the trailer, which carries error
Now let us see how the data link layer can combine
framing, flow control, and error control to achieve the
delivery of data from one node to another. The
protocols are normally implemented in software by
using one of the common programming languages. To
make our discussions language-free, we have written
in pseudocode a version of each protocol that
concentrates mostly on the procedure instead of
delving into the details of language rules.
Taxonomy of protocols
NOISELESS CHANNELS
to our data frame. When the frame arrives at the receiver site, it is
receiver receives a data frame that is out of order, this means that frames
(continued)
Algorithm: Sender-site algorithm for Stop-and-Wait ARQ
(continued)
Algorithm: Receiver-site algorithm for Stop-and-Wait ARQ Protocol
Example
Solution
The bandwidth-delay product is
Example (continued)
The system can send 20,000 bits during the time it takes
for the data to go from the sender to the receiver and then
back again. However, the system sends only 1000 bits. We
can say that the link utilization is only 1000/20,000, or 5
percent. For this reason, for a link with a high bandwidth
or long delay, the use of Stop-and-Wait ARQ wastes the
capacity of the link.
Example
Solution
The bandwidth-delay product is still 20,000 bits. The
system can send up to 15 frames or 15,000 bits during a
round trip. This means the utilization is 15,000/20,000, or
75 percent. Of course, if there are damaged frames, the
utilization percentage is much less because frames have
to be resent.
Link Utilization / Efficiency of Stop and Wait ARQ
where,
a = T p / Tt
is 22.5 ms and packet size is 1 KB, then find the link utilization in stop
and wait.
Solution:
Link Utilization / Efficiency of Stop and WaitARQ
a = Tp / Tt
Efficiency, η = 1 / (1+2a)