Multiple Choice. Circle ALL that are true: II. The deterministic fluid model (a)

Question

Multiple Choice. Circle ALL that are true: II. The deterministic fluid model (a) approximates additive increase multiplicative decrease (AIMD) congestion control (b) illustrates the high cost of a retransmission time out (c) shows that queues never grow faster than linearly (d) shows that the source's peak rate scales linearly with RTT III. The go-back-N protocol (a) is an example of ARQ (b) will deadlock if more than one packet is dropped (c) can be considered as a sliding window with window size N (d) is vulnerable to counting to infinity IV. Max-min fairness (a) ensures that all flows obtains the same rate (b) always achieves the maximum aggregate throughput (c) ensures that at least one link is saturated (d) ensures that all links are saturated V. TCP congestion control (a) is window based (b) provides throughput inversely proportional to RTT (c) became obsolete with the invention of the web (d). employs AIMD VI. Link state routing (a) requires flooding of link state packets (b) enables a router to compute the entire path to each destination (c) is used today within some autonomous systems (d) was designed by and named after the russian mathematician, Kolmogorov

Explanation / Answer

2)c

3)a

4)b

5)c

6)d

Related Questions

Navigate

• Browse (All)
• Browse M
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.