We consider a MAC protocol related to ALOHA but different in this question. Consider a network with four nodes, where each node has a dedicated channel to each other node so there will be no collision if A is sending to B and C is sending to D

We consider a MAC protocol related to ALOHA but different in this question. Consider a network with four nodes, where each node has a dedicated channel to each other node so there will be no collision if A is sending to B and C is sending to D. The probability that any node transmits is p. Each node can only receive one packet at a time which means there will be a collision when A is sending to B and C is also sending to B even different channels are used. However, each node can transmit and receive at the same time which means if A is sending to B, C can still send to A at the same time What is the utilization of the network? Utilization here is the expected number of packets that get through in each slot divided by the maximum (maximum here is 4, e.g. when A transmits to B, B transmits to A, C transmits to D and D transmits to C).Here Assume each packet takes 1 time slot. Assume each node has 3 queues--one for each other node - and each queue is always backlogged (they always have packets in the queue to be sent). We consider a MAC protocol related to ALOHA but different in this question. Consider a network with four nodes, where each node has a dedicated channel to each other node so there will be no collision if A is sending to B and C is sending to D. The probability that any node transmits is p. Each node can only receive one packet at a time which means there will be a collision when A is sending to B and C is also sending to B even different channels are used. However, each node can transmit and receive at the same time which means if A is sending to B, C can still send to A at the same time What is the utilization of the network? Utilization here is the expected number of packets that get through in each slot divided by the maximum (maximum here is 4, e.g. when A transmits to B, B transmits to A, C transmits to D and D transmits to C).Here Assume each packet takes 1 time slot. Assume each node has 3 queues--one for each other node - and each queue is always backlogged (they always have packets in the queue to be sent)