- Suppose Three Active Nodes N1 N2 And N3 Are Competing For Access To A Channel Using Slotted Aloha The Channel Is Ca 1 (36.17 KiB) Viewed 18 times
- Suppose Three Active Nodes N1 N2 And N3 Are Competing For Access To A Channel Using Slotted Aloha The Channel Is Ca 2 (35.52 KiB) Viewed 18 times
Suppose three active nodes (n1, n2, and n3) are competing for access to a channel using slotted ALOHA. The channel is capable of transmitting a given frame at the full channel rate of R Mbps (R = 27Mbps). Assume each node has an infinite number of packets to send, and attempts to transmit in each slot with a probability p = 1/3. The probability that the first success occurs in the second time slot is: O a. 0.444 O b. 0.126 O c. None of the above O d. 0.247
Suppose TCP uses AIMD for its congestion control and ignore the slow start. Assume MSS = 1500Bytes and a round trip delay of 100ms. The sender and receiver are connected by a 100Mbps link and that the sender has a large file to send. We assume the receive window buffer is much larger than the congestion window. The average throughput of this TCP connection is: a. 75Mbps O b. 0.75Mbps O c. 100Mbps O d. 7.5Mbps