Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture

In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.