Abstract: According to the characteristics of the token-routing switches, the author put forward the token-queuing algorithm based on FCFS, the token fixed priority and the switch ports dynamic priority. The requests received by the switch at different time are queued based on FCFS, and the requests received by the switch at the same time is queued by the token fixed priority and the switch ports dynamic priority. So, this algorithm is called as the hwo Dimensional Dynamic Priority-based First Come First Serve Algorithm, abbreviation for TDDP-FCFS. Then, the author used the seizing M/M/1/∞ queue to model the hDDP-FCFS system, and discussed its performance indexes, gave the calculation method and the actual results of the performance indexes. Results showed that the algorithm TDDP-FCFS took both the token priority and the switch ports priority into account, and could meet the scheduling rectuirements of the token-routing switch. hDDP-FCFS has higher operation efficiency of scheduling.

Key words: FCFS,Rotary priority,Two dimensional dynamic priority,Seizing M/M/1/∞queue