Exchange Scheduling Algorithm Simulation Software Design And Implementation

Nowadays, the network equipments such as routers and switches are required to workfaster to achieve a high throughput. Hardware upgrading sounds like a good idea, but italso makes these equipments more expensive. Input-queuing scheduling algorithms canachieve 100% throughput even if the speedup of switching fabric is low, so thesealgorithms are studied a lot. Although output-queuing scheduling algorithms can alsoachieve 100% throughput with a very low delay, but they require the speedup to be N (N isthe number of interfaces of a switch or router).The purpose of this paper is to design a general scheduling algor.ithm simulator, so wecan simulate some of the most studied input-queuing and output-queuing algorithms,especially RR scheduling algorithms, such as PIM, RRM, iSLIP, DRRM, iLQF, iOCF,WRR and DRR. All of the algorithms are designed as independent modules, and thenanalyze their performances in some kinds of traffic models. From the result of simulation,we see that output-queuing scheduling algorithms have advantages of low transmissiondelay and high throughput when the speedup of switch fabric is high, and an input-queuingscheduling algorithm can work with a high performance if it is designed well. From theresults of simulation, we can see simulator that this paper implemented is well designedbecause the performances of simulated algorithms are similar with performance of them inreal network.