ESE/CSE 346 Computer Networks, Spring 2013, Prof. T.G.Robertazzi Project TA: Kai Wang (firstname.lastname@example.org) Project #1: Switching Element Problem To be submitted: Wednesday, March 5, 2013 Project Description In this project you will write a program to produce a discrete event simulation of a switching element with 10 inputs and 3 outputs as shown in Fig. 1. Time is slotted on all inputs and outputs. Each input packet 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 a switching element if three or less packets arrives to some inputs, they are forwarded to the switching element outputs without a loss. If more than three packets arrive to the inputs of the switching element, only three packets are randomly chosen to be forwarded to the switching element outputs and the remaining ones are discarded. p p p p p p p p p p In your discrete event simulation the program will mimic the operation of the switch and collect statistics. That is, in each time slot the program randomly generates packets for all
inputs of switching element and count how many packets can be passed to the output of the switching element (causing throughput) and, alternatively count how many packets are dropped (when the switching element has more than three input packets at a given time slot) .
Fig. 1. Switching Element
Your task is to collect throughput statistics for different values of p (p = 0.01,
0.02 up to 1.0 in steps of 0.01), by running the procedure described above for each value of p and for many slots (at least a thousand slots per value of p). The more simulated slots, the more accurate the results will be. Based on this statistics, plot two graphs: 1) the
average number of busy outputs versus p, and 2) the average number of dropped packets versus p. Note that you ARE NOT allowed to implement the model...
Please join StudyMode to read the full document