4.set-2 Answers
4.set-2 Answers
SOLUTIONS
1. At which layer, the trailer usually contains bits used for error detection?
Explanation:
3. Consider the following message M=1010001011. The cyclic redundancy check(CRC) for this
message using the divisor polynomial x5 + x3 + x2 + 1 is:
Explanation:
1
4. What could be the network mask if direct broadcast address of a network is 168.17.07.255?
(a) 255.255.248.0
(b) 255.255.252.0
(c) 255.255.254.0
(d) 255.255.255.0
(e) All the above
5. A broadcast channel has 10 nodes and total capacity of 16Mbps. It uses polling for medium
access. Once a node finishes transmission, there is a polling delay of 100 µseconds to poll the
next node. Whenever a node is polled, it is allowed to transmit a maximum of 1500 Bytes. The
maximum throughput of broadcast channel is:
Explanation:
B = 16 Mbps
Tpoll = 100μsec
L = 1500 bytes = 12000 bits
L 12000bits 3
Ttrans = B = 16×106 b/sec = 4 × 10−3 sec = 0.75 = 750μsec
2
Throughput = 0.8823 × 16 Mbps = 14.1176 Mbps
Explanation:
Protocols like HTTP, FTP, Telnet, SMTP, HTTPS, etc uses TCP at transport layer.
Protocols like DNS, RIP, SNMP, RTP, BOOTP, TFTP, NIP etc uses UDP at transport layer.
(a) Half the Baud Rate (b) Twice the Baud Rate
(c) Same as Baud Rate (d) None of the above
8. Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window
(window size 4) and go-back-N error control strategy. All packets are ready and immediately
available for transmission. If every 6th packet that ‘A’ transmits gets lost (but no Acks from ‘B’
ever gets lost), then what is the number of packets that ‘A’ will transmit for sending the message
to ‘B’ ?
(a) 29 (b) 33
(c) 27 (d) 25
9. A is sending data to host B over a full duplex link. A and B are using the sliding window
protocol for few control. The send and receive window size are four(4) packets each. Data
packets (sent only from A to B) are all 1500 Bytes long and the transmission time for such a
packet is 60 µseconds. Acknowledgement packets are very small(sent from B to A) and require
very negligible time. The propagation delay over the link is 170 µseconds. What is the maximum
achievable throughput in the communication?
3
(a) 3.75 x 106 Bps (b) 7.5 x 106 Bps
(c) 15 x 106 Bps (d) 12.75 x 106 Bps
Explanation:
1500 bytes
Transmission rate = = 200 × 10 + 5 = 200Mbps
60 μsec
4×60
Efficiency = 60+340 = 0.6
Max achievable throughput = 0.6 × 200 Mbps = 120 Mbps = 15 Mbytes per sec.
10. Suppose a CSMA/CD network is operating at 1 Gbps, and suppose there are no repeaters and
the length of cable is 1Km. Determine the minimum frame size is the signal propagation speed is
200 Km/ms.
Explanation:
1 msec → 200 km
1 sec → ?
200 km
V= = 200 × 103 km/sec
1 msec
Tx = 2Tp
L d 2 × 1km × 1 × 109 bps
=2∙ ⇒L= = 104 bits
B v 100 × 103 kmps
L = 10000 bits
11. Station ‘A’ uses 64 Byte packets to transmit messages to station ‘B’ using a sling window
protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth
on the path between ‘A’ and ‘B’ is 128 Kbps. What is the sender window size for maximum
efficiency?
Solution: 21
Explanation:
L 64 bytes 64 ∗ 8b
Tx = = = = 2 ∗ 10−3 sec = 4 msec
B 128 Kbitsps 128 ∗ Kbps
4
Round trip delay = 80 msec
2Tp = 80 msec
Tp = 40 msec
12. In a sliding window ARQ scheme, the transmitter’s window size is ‘N’ and the receiver’s
window size is ‘M’. The minimum number of sequence numbers (distinct) required to ensure
correct operation of the ARQ scheme is:
13. A 25 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs
“Selective Repeat” scheme with N set to 8. Assume each frame is 100 Bytes long, what is
maximum bandwidth utilization? (where N is window size)
(a) 5Kbps (b) 7.7Kbps
(c) 15 Kbps (d) 10 Kbps
Explanation:
Tx=100*8 bits/25Kbps=32 ms
Tp = 400ms, a=Tp/Tx = 400/32 = 12.5
Efficiency of GBN = W/(1+2a), where w= window size = 8
= 8/(1+25) = 8/26
BW utilization or throughput or max data rate = efficiency * BW
= (8/26) * 25 = 7.69Kbps
14. A channel has a bit rate of 4Kbps and one –way propagation delay of 20ms. The channel uses
stop-&-wait protocol. The transmission time of acknowledgement frame is negligible. To get a
channel efficiency of at least 75%, the minimum frame size should be:
5
Explanation:
1
Efficiency of Stop & Wait protocol = 1+2a
1
0.75 =
1 + 2a
3 1
=
4 1 + 2a
3(1 + 2a) = 4
6a = 1
a = 1/6
Tp 1
=
Tx 6
Tx = 6Tp
L
= 6Tp ⇒ L = 6 × B × Tp = 6 × 4Kbps × 20ms = 480bits
B
Explanation:
Remote login – Telnet,
mail service – SMTP,
File transfer and access – FTP are application layer protocols
16. In TDM medium access control bus LAN, each station is assigned one time slot per cycle for
transmission. Assume that the length of each time slot is time to transmit 100 bits plus end-to-
end propagation delay. Let propagation speed is 2 * 108 m/sec. Length of LAN is 1Km with a
6
bandwidth of 10 Mbps. Maximum number of stations that can be allowed in a LAN, so that the
throughput of each station can be 2/3 Mbps is
(a) 3 (b) 5
(c) 10 (d) 20
Explanation:
1 km
Propagation delay = 2×108 m/sec = 5μsec
L 1000bits
Tx = = = 10−5 sec = 10μsec
B 10 × 106 bits/sec
2 10
Mbps = ∗ 10Mbps
3 15N
N = 10
(a) Both (A) and (R) are true and (R) is the correct reason for (A)
(b) Both (A) and (R) are true but (R) is not the correct reason for (A)
(c) Both are false
(d) (A) is true but (R) is false
7
18. In Go-Back-N protocol, if the maximum window size is 127, what is the range of the
sequence number?