write a program to produce a discrete event simulation of a network of 2 input (A and B) and 1 output (C) switching elements as shown in Fig. P1. Time is slotted on all inputs and outputs. Each input packet to A and B follows a Bernoulli process. In a given slot the independent probability that a packet arrives in a slot is p and the probability that a slot is empty is 1-p. One packet fills one slot.

For each switching element if only one packet arrives to the two inputs, it is forwarded to the switching element output. If two packets arrive to the inputs of a switching element, one is randomly chosen to be discarded and the remaining one is forwarded to the switching element output. In a slot, the order of events is first possible arrivals to A and B, and then possible arrivals to C.

In your discrete event simulation the program will mimic the operation of the network and collect statistics. That is, in each slot randomly generate packets for the inputs of each input switching element A and B. Next check if there is a packet at the A and B outputs. Then check if one or more than one packet attempts to transit switching element C, producing an output packet. Record the total number of times, for switching elements A and C, that there is an output packet (causing throughput).

As a function of p (p=.02, .04 up to 1.0 in steps of 0.02), plot the fraction of time spent in a useful (normalized) throughput both element A and C switching element outputs. Normalized throughput is the total number of output packets for a switching element divided by the total number of slots. The program outer loop should involve p, the next inner loop should involve the number of slots simulated for each value of p (do at least a thousand slots). The more simulated slots, the more accurate the results and the smoother the curves will be.