FQLP:a New Scheduling Algorithm for Real time Services in ATM Networks
Li Huang · Dianzi xuebao · 2000
In this paper a novel scheduling algorithm called FQLP(Fair Queuing with Loss Priority) is proposed.Theoretical analysis and simulation results show that the allocated bandwidth for real time services can be guaranteed and a delay bound for real time services can be provided.Using priority mechanism FQLP increases the network throughput while guaranteeing the QoS of real time services.