Tugas Data Link Control Protocols

Questions
7.1 List and briefly define some of the requirements for effective communications over a
data link.
7.2 Define flow control.
7.3 Describe stop-and-wait flow control.
7.4 What are reasons for breaking up a long data transmission into a number of frames?
7.5 Describe sliding-window flow control.
7.6 What is the advantage of sliding-window flow control compared to stop-and-wait
flow control?
7.7 What is piggybacking?
7.8 Define error control.
7.9 List common ingredients for error control for a link control protocol.
7.10 Describe automatic repeat request (ARQ).
7.11 List and briefly define three versions of ARQ.
7.12 What are the station types supported by HDLC? Describe each.
7.13 What are the transfer modes supported by HDLC? Describe each.
7.14 What is the purpose of the flag field?
7.15 Define data transparency.
7.16 What are the three frame types supported by HDLC? Describe each.
Problems
7.1 Consider a half-duplex point-to-point link using a stop-and-wait scheme, in which
a series of messages is sent, with each message segmented into a number of frames.
Ignore errors and frame overhead.
a. What is the effect on line utilization of increasing the message size so that fewer
messages will be required? Other factors remain constant.
b. What is the effect on line utilization of increasing the number of frames for a con-
stant message size?
c. What is the effect on line utilization of increasing frame size?
7.2 The number of bits on a transmission line that are in the process of actively being
transmitted (i.e., the number of bits that have been transmitted but have not yet been
received) is referred to as the bit length of the line. Plot the line distance versus the
transmission speed for a bit length of 1000 bits. Assume a propagation velocity of
2 * 108 m/s.
7.3 In Figure 7.10 frames are generated at node A and sent to node C through node
B. Determine the minimum data rate required between nodes B and C so that the
buffers of node B are not flooded, based on the following:
r The data rate between A and B is 100 kbps.
r The propagation delay is 5 ms/km for both lines.
r There are full-duplex lines between the nodes.
r All data frames are 1000 bits long; ACK frames are separate frames of negligible
length.
r Between A and B, a sliding-window protocol with a window size of 3 is used.
r Between B and C, stop-and-wait is used.
r There are no errors.
Hint: In order not to flood the buffers of B, the average number of frames entering
and leaving B must be the same over a long interval.
7.4 A channel has a data rate of R bps and a propagation delay of t s/km. The distance
between the sending and receiving nodes is L kilometers. Nodes exchange fixed-size
frames of B bits. Find a formula that gives the minimum sequence field size of the
frame as a function of R, t, B, and L (considering maximum utilization). Assume that
ACK frames are negligible in size and the processing at the nodes is instantaneous.
4000 km 1000 km
A B C
Figure 7.10 Configuration for Problem 7.3

7.5 No mention was made of reject (REJ) frames in the stop-and-wait ARQ discussion.
Why is it not necessary to have REJ0 and REJ1 for stop-and-wait ARQ?
7.6 Suppose that a selective-reject ARQ is used where W = 4. Show, by example, that a
3-bit sequence number is needed.
7.7 Two neighboring nodes (A and B) use a sliding-window protocol with a 3-bit
sequence number. As the ARQ mechanism, go-back-N is used with a window size
of 4. Assuming A is transmitting and B is receiving, show the window positions for
the following succession of events:
a. Before A sends any frames
b. After A sends frames 0, 1, 2 and receives acknowledgment from B for 0 and 1
c. After A sends frames 3, 4, and 5 and B acknowledges 4 and the ACK is received by A
7.8 Out-of-sequence acknowledgment cannot be used for selective-reject ARQ. That is,
if frame i is rejected by station X, all subsequent I-frames and RR frames sent by X
must have N1R2 = i until frame i is successfully received, even if other frames with
N1S2 7 i are successfully received in the meantime. One possible refinement is the
following: N1R2 = j in an I-frame or an RR frame is interpreted to mean that frame
j - 1 and all preceding frames are accepted except for those that have been explicitly
rejected using an SREJ frame. Comment on any possible drawback to this scheme.
7.9 The ISO standard for HDLC procedures (ISO 4335) includes the following defini-
tions: (1) an REJ condition is considered cleared upon the receipt of an incoming
I-frame with an N(S) equal to the N(R) of the outgoing REJ frame; and (2) a SREJ
condition is considered cleared upon the receipt of an I-frame with an N(S) equal to
the N(R) of the SREJ frame. The standard includes rules concerning the relationship
between REJ and SREJ frames. These rules indicate what is allowable (in terms of
transmitting REJ and SREJ frames) if an REJ condition has not yet been cleared and
what is allowable if an SREJ condition has not yet been cleared. Deduce the rules
and justify your answer.
7.10 Two stations communicate via a 1-Mbps satellite link with a propagation delay of
270 ms. The satellite serves merely to retransmit data received from one station to
another, with negligible switching delay. Using HDLC frames of 1024 bits with 3-bit
sequence numbers, what is the maximum possible data throughput; that is, what is the
throughput of data bits carried in HDLC frames?
7.11 It is clear that bit stuffing is needed for the address, data, and FCS fields of an HDLC
frame. Is it needed for the control field?
7.12 Because of the provision that a single flag can be used as both an ending and a start-
ing flag, a single-bit error can cause problems.
a. Explain how a single-bit error can merge two frames into one.
b. Explain how a single-bit error can split a single frame into two frames.
7.13 Suggest improvements to the bit stuffing-algorithm to overcome the problems of sin-
gle-bit errors described in the preceding problem.
7.14 Using the example bit string of Figure 7.8, show the signal pattern on the line using
NRZ-L coding. Does this suggest a side benefit of bit stuffing?
7.15 Assume that the primary HDLC station in NRM has sent six I-frames to a secondary.
The primary’s N(S) count was three (011 binary) prior to sending the six frames. If
the poll bit is on in the sixth frame, what will be the N(R) count back from the sec-
ondary after the last frame? Assume error-free operation.
7.16 Consider that several physical links connect two stations. We would like to use a
“multilink HDLC” that makes efficient use of these links by sending frames on a
FIFO basis on the next available link. What enhancements to HDLC are needed?
7.17 A World Wide Web server is usually set up to receive relatively small messages from
its clients but to transmit potentially very large messages to them. Explain, then,
which type of ARQ protocol (selective reject, go-back-N) would provide less of a
burden to a particularly popular WWW server.

Tugas Data Link Control Protocols

Uploaded by

Copyright:

Available Formats

Tugas Data Link Control Protocols

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Tugas Data Link Control Protocols

Uploaded by

Copyright:

Available Formats

Questions

Figure 7.10 Configuration for Problem 7.3

You might also like