STF：PROVIDE RATE GUARANTEES IN INPUT—QUEUED SWITCH

A QoS-aware input-queued scheduling algorithm,called Smallest Timestamp First (stf),is propsed,which is improved upon is LIP and can allocate bandwidth among imputs sharing a common output based on their reservation by assigning suitable finishing timestamps to contending cells .STF can also provide isolation between flows that share a common output link.Misbehaving flows will be restricted to guarantee the behaving flow^s bandwidth .Simulations prove the feasibility of our algorithm.