Abstract: An algorithm which computes integrated priority for the packet in the input memory switch is proposed. In this algorithm both the packet delay and packet loss rate are considered to compute packet priority. The length of the packet queue is turned into discrete values and weighted nonlinearly with packet delay priority. So the priority that combines packet delay and dynamic queue length is obtained. A packet scheduling algorithm based on this priority scheme is proposed for the input memory switch. The scheduling algorithm supports both packet delay and packet queue length. The application of this scheduling algorithm in Crossbar and Clos networks is presented. A new routing algorithm for balancing the load of high priority traffic is also proposed. Simulation results show these two algorithms can lower the packet loss rate and guarantee packet delay.

Key words: input memory, delay, loss rate, priority, routing algorithm