Native simulation of different scheduling policies Bo Liu 3402829 Fei Peng 3428641

Background FIFO Priority queue

Simulation ideas FIFO EVENT LIST 1 2 3 4 . . . n 1 arrival time 2 service interval 3 waiting time 4 leaving time 5 flag

Simulation ideas Queue length simulation member 1 2 3 1 2 3 i … Service time simulation First customer : events(3,i)=0; events(4,i)=events(1,i)+events(2,i); i-th customer : events(3,i)=events(4,member(len_mem))-events(1,i); events(4,i)=events(4,member(len_mem))+events(2,i);

Simulation ideas Priority queue events(6,:) rand(1,arr_num)<alpha Both FIFO and Priority queue K=100; N=5:4:50; Lambda=4; mu=3 customer loss: 1-sum(events(5,:))/arr_num; waiting time: sum(events(3,:))/sum(events(5,:));

Performance Analysis Factors affecting the performance and the efficiency of the bank queuing system Customer loss( packet loss)

Performance Analysis Average waiting time

Performance Analysis Optimal buffer size Optimal buffer size ranges from 13 to 25

In conclusion

Thank You