Scribd
Upload
32 views

I Tutorial Sheet

questions on communication network

Uploaded by

Tony Stark
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

I Tutorial Sheet

questions on communication network

Uploaded by

Tony Stark
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

I Tutorial Sheet 2024

Communication Networks (ELC 4410)

1. Two musicians located in different cities want to have a jam session over a communication network. Find the
maximum possible distance between the musicians if they are to interact in real-time, in the sense of experiencing
the same delay in hearing each other as if they were 10 meters apart. The speed of sound is approximately 330
meters/second, and assume that the network transmits the sound at the speed of light in cable, 2.3×108
meters/second.
2. Suppose transmission channels become virtually error free. Is the data link layer still needed?
3. An internet path between two hosts involves a hop across network A, a packet-switching network, to a router
and then another hop across packet-switching network B. Suppose that packet-switching network A carries
the packet between the first host and the router over a two-hop path involving one intermediate packet switch.
Suppose also that the second network is an Ethernet LAN. Sketch the sequence of IP and non-IP packets and
frames that are generated as an IP packet goes from host 1 to host 2.
4. Suppose that two check bits are added to a group of 2n information bits. The first check bit is the parity check
of the first n bits, and the second check bit is the parity check of the second n bits.
(a) Characterize the error patterns that can be detected by this code.
(b) Find the error-detection failure probability in terms of the error-detection probability of the single
parity check code.
(c) Does it help to add a third parity check bit that is the sum of all the information bits?
5. Suppose that a frequency band W Hz wide is divided into M channels of equal bandwidth.
(a) What bit rate is achievable in each channel? Assume all channels have the same SNR.
(b) What bit rate is available to each of M users if the entire frequency band is used as a single channel and
TDM is applied?
(c) How does the comparison of (a) and (b) change if we suppose that FDM requires a guard band between
adjacent channels? Assume the guard band is 10% of the channel bandwidth.
6. Consider the Go-Back-N ARQ protocol.
(a) What can go wrong if the ACK timer is not used?
(b) Show how the frame timers can be maintained as an ordered list where the time-out instant of each frame is
stated relative to the time-out value of the previous frame.
(c) What changes if each frame is acknowledged individually instead of by using a cumulative acknowledgment?
7. Compare the operation of Stop-and-Wait ARQ and bidirectional Go-Back-N ARQ with a window size of 1. Sketch
out a sequence of frame exchanges using each of these protocols and observe how the protocols react to the loss
of an information frame and to the loss of an acknowledgment frame.
8. Three possible strategies for sending ACK frames in a Go-Back-N setting are as follows: send an ACK frame
immediately after each frame is received, send an ACK frame after every other frame is received, and send an
ACK frame when the next piggyback opportunity arises. Which of these strategies are appropriate for the following
situations?
(a) An interactive application produces a packet to send each keystroke from the client; the server echoes each
keystroke that it receives from the client.
(b) A bulk data transfer application where a server sends a large file that is segmented in a number of full-size
packets that are to be transferred to the client.
9. Two computers are connected by an intercontinental link with a one-way propagation delay of 100 ms. The
computers exchange 1-Megabyte files that they need delivered in 250 ms or less. The transmission lines have a
speed of R Mbps, and the bit error rate is 10−8. Design a transmission system by selecting the bit rate R, the ARQ
protocol, and the frame size.
10. Perform the bit stuffing procedure for the following binary sequence: 1101111111011111110101.

You might also like