Give short answers to the following questions.
Q1. In Data Link Control briefly explain the procedure known as byte stuffing. If data from an upper layer consists
of the data given in Figure 4.1, explain how byte stuffing would be implemented to ensure that the data is not
Q2. How the inefficiency of Stop-and-Wait protocol is overcome in sliding window protocol?
Q3. What is piggybacking? What is its advantage?
Q4. The timer of a system using the Stop-and-Wait ARQ Protocol has a time-out of 4 ms. Draw the flow diagram
similar to Figure 11.11 in lecture notes for four data frames if the round trip delay is 3 ms. Assume that the first
data frame is damaged and fourth one is lost, but all other data and control frames are not lost or damaged.
Q5. Define random access and list three protocols in this category.
Q6. A network with one primary and four secondary stations uses polling. The size of a data frame is 50 bytes. The
size of the poll, ACK, and NAK frames are 5 bytes each. Each station has 3 frames to send. How many total
bytes are exchanged if there is no limitation on the number of frames a station can send in response to a poll?
Q7. In Figure 4.2, the date rate is 100 Mbps, the distance between station A and C is 4,000 m, and the propagation
speed is 2 × 10°m/s. Station A starts sending a long frame at time t, = 0; station C starts sending a long frame
at time ty = 4 us. The size of the frame is long enough to guarantee the detection of collision by both stations.
Do You Know That our Professional Writers are on Stand-by to Provide you with the Most Authentic Custom Paper. Order with us Today and Enjoy an Irresistible Discount!