A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First(STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputssharing a common output based on their reservation by assigning suitable finishing timestamps tocontending cells. STF can also provide isolation between flows that share a common output link.Misbehaving flows will be restricted to guarantee the behaving flows’ bandwidth. Simulationsprove the feasibility of our algorithm. A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputssharing a common output based on their reservation by assigning suitable finishing timestamps tocontending cells. provide isolation between flows that share a common output link.Misbehaving flows will be restricted to guarantee the behaving flows’ bandwidth. Simulationsprove the feasibility of our algorithm.