86.

In a router implementing the Leaky Bucket algorithm, a burst of 10 Mbps traffic occurs
over a time period of 0.1 sec. The constant output rate is 1 Mbps. Show the shaped
traffic output.
87. Describe briefly the process of TCP Connection establishment. Why is it a 3-way
handshaking process whereas connection teardown is a 2-way one?
88. A TCP connection has a Threshold set to 32 KB. The congestion window starts from the
initial size of 1 KB. Describe the behavior of the congestion window under the following
conditions: (i) Timeout occurs at the 8th transmission. (ii) After that, 4 more
transmissions are performed.
89. In a router implementing the Token Bucket algorithm, the total token capacity is x1 Mb.
Traffic is input at bursts of x2 Mbps. Token generation rate is x3 Mbps. How long can
the route sustain the burst before losing packets?
90. How does TCP manage its congestion window? Explain with a suitable diagram.
91. What is the significance of open-loop congestion control policies? Describe any two
policies.
92. Compare and Contrast TCP and UDP Protocols.
93. What do you mean by closed-loop congestion control techniques? Briefly explain any
two closed-loop techniques.
94. Name any two timers used in TCP. Describe the calculation of the retransmission timer.
95. What do you mean by traffic shaping? Explain the token bucket algorithm.
96. Port numbers are divided into broad categories. What are these categories and what is
the underlying principle of these categories?
97. Differentiate between stream sockets and datagram sockets.
98. A computer on a 10 Mbps network is regulated by a token bucket. The token bucket is
filled at a rate of 2 Mbps. It is initially filled to capacity with 16 Megabits. What is the
maximum duration for which the computer can transmit at the full 10 Mbps?
99. Define congestion. What is the difference between flow control and congestion control?
100. Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD)
algorithm where the window size at the start of the slow start phase is 2 MSS and the
threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs
 during the fifth transmission. Find the congestion window size at the end of the tenth
transmission.
101. Explain how the silly window syndrome is handled by Clark's algorithm. How does
the receiver site address the issue of out-of-order segments?
102. How does TCP handle congestion using the slow start method? Explain it with a
suitable diagram.
103. Explain how TCP manages zero window size deadlock situations and long idle
connections between two devices.
104. What is baseline wandering and how does Manchester encoding help in solving
this problem? Explain by drawing the Manchester encoding for the data: 1011001.
105. Four 1-kbps connections are multiplexed together. A unit is 1 bit. Find (1) the
duration of 1 bit before multiplexing, (2) the transmission rate of the link, (3) the
duration of a time slot, and (4) the duration of a frame.
106. Name the steps of PCM and state very briefly (with diagram) the activity of each
step.
107. A telephone line normally has a bandwidth of 3000 Hz assigned for data
communication. The signal-to-noise ratio is usually 3162. Find the channel capacity.
108. Bit rate can be increased as much as wanted by increasing the number of signal
levels as per the calculations given by Nyquist theorem for a noiseless channel.
Comment.
109. We want to digitize a human voice. What is the bit rate, assuming 8 bits per
sample?
110. Compare and contrast a circuit-switched network and a packet-switched network.
111. Explain what is the purpose of multiplexing (FDM is for analog signals and TDM is
for digital signals).
112. Twisted pair offers better bandwidth than untwisted pair. How?
113. We have a channel with 1 MHz bandwidth. The SNR for this channel is 63. What
are the appropriate bit rate and signal level?
114. Compare the OSI and TCP/IP model.
115. What are the antennas used for microwave communication? Name the antennas,
draw them, and write briefly how they work.
116. With the help of a diagram, calculate the delay in a packet-switched datagram
network.
117. Design a three-stage, 15 × 15 switch (N=15), with n=5, k=2. What will be the
total number of cross-points? Explain.
118. A 7-bit dataword 1101010 is to be sent by using Hamming code error detection
and correction method. Show how the receiver corrects an error which occurs in the 6th
bit position from the right.
119. In Go-back-N ARQ, sender window size < 2^m. Is it correct? Justify.
120. Explain in detail about the state transition diagram of PPP.
121. Of x + 1, x^3, which g(x) value guarantees that a single-bit error will be caught?
Explain your answer with relevant analysis (preferably using polynomial expression).
122. Taking 1100, 1110, 1010 as data (3 blocks each of 4 bits), show the steps that
happen at the sender and the receiver side if Checksum is used as the method of error
detection.
123. To increase reliability, redundant links can be used between bridges. However,
that poses a problem as well. What is the problem and how does the spanning tree
bridge solve the problem?
124. Consider a 50-kbps satellite channel with a 500-msec round-trip propagation
delay. Frame size is 1000 bits. Find the following: (a) If the stop-and-wait protocol is
used in the above channel, calculate for what percentage of time will the sender be idle.
(b) If the sliding window protocol is used, what should be the ideal window size of the
sender?
125. With a diagram, show the frame exchange in CSMA/CA and mention in brief the
utility of RTS, CTS frames, and NAV.
126. What is the use of a supervisory frame in HDLC?
127. Explain the working principle of CDMA with a suitable example.
128. Explain CSMA/CD with the help of a flowchart. In CSMA/CD, to detect a collision,
what should be the minimum frame size?
146. Explain the use of the Retransmission timer and Keep-alive timer in TCP.
147. Does the sender maintain a window in TCP? If yes, then what is the sender
window size?
148. Write short notes on any 3 of the following: (a) TCP segment, (b) Open Loop
Congestion control method (any 2), (c) Leaky bucket, (d) Bluetooth.
149. What is TCP silly window syndrome? How do Clark's and Nagle's algorithms help
in minimizing the syndrome?
150. With a suitable diagram, explain the slow start phase used by TCP to handle
congestion.
151. Differentiate between backpressure and choke packet congestion control
methods.
152. Write down the differences between TCP and UDP protocol.
153. Explain with a diagram how TCP terminates a connection using a three-way
handshake.
154. Discuss with a suitable diagram about the addressing mechanisms used by IEEE
802.11.
155. Find the expressions for average delay and throughput for both pure ALOHA and
slotted ALOHA. Compare their performances as well.
156. "In Selective-Repeat ARQ, sender window size > 2^(m-1)." Is it correct? Justify.
157. The sender has a sliding window size = 3. Go-back-N protocol is used. Discuss
the behavior of the receiving sliding window under the following cases: Case 1: Frame 2
is lost in transition. Case 2: Frame no. 2 is received by the receiver correctly but ACK is
lost.
158. What are the problems of providing a redundant path in a bridged network? How
does a transparent bridge provide a solution to this problem?
159. What do you mean by piggybacking?
160. A router with IP address [Link] and Ethernet physical address
23:45:AB:4F:67:CD has received a packet for a destination with IP address [Link]
and Ethernet physical address AA:BB:A2:4F:67:CD. Show the entries in the ARP request
 packet sent by the router. Encapsulate the ARP request packet in a data link frame. Fill in
all the fields.
161. S opens a TCP connection with an initial sequence number (ISN) of 14535. The
other party R opens the connection with an ISN of 21732. Show the three TCP segments
during the connection establishment.
162. How can you get twice the efficiency in Slotted ALOHA protocol compared to the
Pure ALOHA protocol? Show your analysis.
163. What is the necessity of the Padding field in an Ethernet frame?
164. How can you prove that CRC catches all single and almost all double-bit errors?
165. What is the difference between a shared Ethernet network versus a switched
Ethernet network? Why is Ethernet called a CSMA/CD protocol?
166. In the calculation of the Minimum Frame length for Ethernet, only 2 bytes are
taken as address lengths (source or destination). But this address is of length 6 bytes.
Why then do we take 2 bytes only in the case of minimum frame length consideration?
167. A router uses the following routing table: Destination: [Link], Mask:
[Link], Interface: eth0; Destination: [Link], Mask: [Link], Interface:
eth1; Destination: [Link], Mask: [Link], Interface: eth2; Destination:
[Link], Mask: [Link], Interface: eth3. A packet bearing a destination
address [Link] arrives at the router. On which interface will it be forwarded?
168. The Internet is a two-level hierarchy—Host & Subnet. Please explain. Why is the
Internet said to be a Three-level hierarchy nowadays?
169. What is the difference between Virtual Circuit and Circuit Switching? Is Virtual
Circuit a type of Packet Switching technique?
170. What is the difference between a hub and a switch?
171. What is the main strategy followed behind designing high-speed modems?
172. Why is Longest Prefix matching required in CIDR?
173. Write down the differences between UDP and TCP.
174. An error-correcting code has the following code words: 00000000, 00001111,
01010101, 10101010, 11110000. What is the maximum number of bit errors that can be
corrected?