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

View solution

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

View solution

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

View solution

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

View solution

Q. 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.

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. 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.

View solution

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

View solution

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

View solution