A new scheduling algorithm is proposed to improve on existing algorith
ms designed for input-queued ATM switches. By assigning a session weig
ht according to its queue length normalised by its rate and using maxi
mum weight matching to obtain a match, the proposed algorithm can avoi
d starvation of slow sessions, thus providing good delay properties as
well as fair services, and at the same time reducing traffic burstine
ss.