A Priority Supporting Adaptive Routing Algorithm in Direct Interconnection Networks

Direct Interconnection Networks (DIN) are considered to build scalable switching fabrics for Internet routers/switches, clue to its easy scalability. Furthermore, QoS (Quality of Service) guarantee is very important in switching systems. In this paper, fair bandwidth allocation and priority traffic supporting adaptive algorithm in the DIN is presented. In the switching fabric, there are tight relationships between the schedule scheme and the routing strategy. In order to supporting QoS in the DIN, a new Priority Supporting Adaptive Routing Algorithm (PSAR) is presented, which considers the scheduling strategy and routing scheme at the same time. Simulation results show the algorithm can fairly allocate the output port bandwidth to each input port, and support priority traffic.