1
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever get lost), then what is the number of packets that A will transmit for sending the message to B?
A
12
B
14
C
16
D
18
2
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Station A uses 32 byte packets to transmit messages to Station B using a sliding 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 optimal window size that A should use?
A
20
B
40
C
160
D
320
3
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is 24 bytes and each packet contains a header of 3 bytes, then the optimum packet size is:
A
4
B
6
C
7
D
9
4
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 5 packets each. Data packets (sent only from A to B) are all 1000 bytes long and the transmission time for such a packet is 50 $$\mu $$s Acknowledgement packets (sent only from B to A) are very small and require negligible transmission time. The propagation delay over the link is 200 $$\mu $$s. What is the maximum achievable throughput in this communication?
A
7.69 × 106 bps
B
11.11 × 106 bps
C
12.33 × 106 bps
D
15.00 × 106 bps
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12