摘要
A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservation by assigning suitable finishing tiniest-amps 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 flows' bandwidth. Simulations prove 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 inputs 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 flows' bandwidth. Simulatious prove the feasibility of our algorithm.
基金
Supported by National Natural Science Foundation of China under Grant No.69896246
