Congestion Control and Quality of Service MCQs

In this section of Data Communication and Networking – Congestion Control and Quality of Service MCQ (Multiple Choice) Based Questions and Answers,it cover the below lists of topics.All the Multiple Choice Questions and Answers (MCQs) have been compiled from the book of Data Communication and Networking by The well known author behrouz forouzan.

This Section covers below lists of topics.

Stream socket MCQs.
Datagram socket MCQs.
Raw socket MCQs.
Client-server model MCQs.

PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE

1. Congestion in a network or internetwork occurs because routers and switches have _______.

tables
queues
crosspoints
none of the above

2. In a network, when the load is much less than the capacity of the network, the delay is _________

at a maximum
at a minimum
constant
none of the above

3. In a network, when the load reaches the network capacity, the delay _______

increases sharply
decreases sharply
remains constant
cannot be predicted

4. In a network, when the load is below the capacity of the network, the throughput ______________

increases sharply
increases proportionally with the load
declines sharply
declines proportionally with the load

5. In a network, after the load reaches the capacity, throughput _______

increases sharply
increases proportionally with the load
declines sharply
declines proportionally with the load

6. In ________ congestion control, policies are applied to prevent congestion before it happens

open-loop
closed-loop
either (a) or (b)
neither (a) nor (b)

7. In _______ congestion control, mechanisms are used to alleviate congestion after it happens

open-loop
closed-loop
either (a) or (b)
neither (a) nor (b)

8. The technique of ________refers to a congestion control mechanism in which a congested node stops receiving data from the immediate upstream node or nodes

backpressure
choke packet
implicit signaling
explicit signaling

9. A ___________ is a packet sent by a node to the source to inform it of congestion

backpressure
choke packet
implicit signaling
explicit signaling

10. In __________, there is no communication between the congested node or nodes and the source. The source guesses that there is a congestion somewhere in the network from other symptoms

backpressure
choke packet
implicit signaling
explicit signaling

11. In the __________ method, the signal is included in the packets that carry data.

backpressure
choke packet
implicit signaling
explicit signaling

12. In the ________ algorithm of TCP, the size of the congestion window increases exponentially until it reaches a threshold

slow-start
congestion avoidance
congestion detection
none of the above

13. In the _________ algorithm of TCP, the size of the congestion window increases additively until congestion is detected

slow-start
congestion avoidance
congestion detection
none of the above

14. In the ___________ algorithm of TCP, the size of the threshold is dropped to one-half, a multiplicative decrease

slow-start
congestion avoidance
congestion detection
none of the above

15. In Frame Relay, the ________ bit warns the sender of congestion in the network

BECN
FECN
either (a) or (b)
neither (a) nor (b)

16. In Frame Relay, the ________ bit is used to warn the receiver of congestion in the network

BECN
FECN
either (a) or (b)
neither (a) nor (b)

17. Traditionally, ________types of characteristics are attributed to a flow

two
three
four
five

18. _________ is a characteristic that a flow needs. Lack of it means losing a packet or acknowledgment, which entails retransmission.

Reliability
Delay
Jitter
Bandwidth

19. _______ is a flow characteristic that applications can tolerate in different degrees.

Reliability
Delay
Jitter
Bandwidth

20. ________ is the variation in delay for packets belonging to the same flow.

Reliability
Delay
Jitter
Bandwidth

21. In ________, queuing packets wait in a buffer (queue) until the node (router or switch) is ready to process them.

FIFO
priority
weighted fair
none of the above

22. In ________ queuing, packets are first assigned to a priority class. Each class has its own queue.

FIFO
priority
weighted fair
none of the above

23. In ________ we try to avoid traffic congestion.

congestion control
quality of service
either (a) or (b)
both (a) and (b)

24. In _________ queuing, the packets are assigned to different classes and admitted to different queues. The queues, however, are weighted based on the priority of the queues; higher priority means a higher weight. The system processes packets in each queue in a round-robin fashion with the number of packets selected from each queue based on the corresponding weight

FIFO
priority
weighted fair
none of the above

25. In _________, we try to create an appropriate environment for the traffic

congestion control
quality of service
either (a) or (b)
both (a) and (b)

26. In the ______ bucket algorithm, bursty chunks are stored in the bucket and sent out at an average rate.

leaky
token
either (a) or (b)
neither (a) nor (b)

27. Traffic ______ are qualitative values that represent a data flow.

controls
descriptors
values
none of the above

28. The _______ bucket algorithm allows idle hosts to accumulate credit for the future in the form of tokens

leaky
token
either (a) or (b)
neither (a) nor (b)

29. The _______ defines the maximum data rate of the traffic

peak data rate
maximum burst size
effective bandwidth
none of the above

30. In _________, when a source makes a reservation, it needs to define a flow specification

Integrated Services
Differentiated Services
Connectionless
Connection-Oriented

31. The________ normally refers to the maximum length of time the traffic is generated at the peak rate.

peak data rate
maximum burst size
effective bandwidth
none of the above

32. ___ is a class-based QoS model designed for IP

Integrated Services
Differentiated Services
Connectionless
Connection-Oriented

33. The ________ is a function of three values: average data rate, peak data rate, and maximum burst size.

peak data rate
maximum burst size
effective bandwidth
none of the above

34. In Frame Relay, the user can never exceed the_________

access rate
committed burst size
committed information rate
excess burst size

35. A _________ traffic model has a data rate that does not change.

constant bit rate
variable bit rate
bursty
none of the above

36. In Frame Relay, a ___________ is the maximum number of bits in a predefined time that the network is committed to transfer without discarding any frame or setting the DE bit.

access rate
committed burst size
committed information rate
excess burst size

37. In the ________ traffic model, the rate of the data flow changes in time, with the changes smooth instead of sudden and sharp.

constant bit rate
variable bit rate
bursty
none of the above

38. In Frame Relay, the _____________ defines an average rate in bits per second

access rate
committed burst size
committed information rate
excess burst size

39. In the ______ traffic model, the data rate changes suddenly in a very short time.

constant bit rate
variable bit rate
bursty
none of the above

40. _______ happens in any system that involves waiting.

Congestion
Jamming
Error
none of the above

Data Communication and Networking – Congestion Control and Quality of Service MCQs