One important issue in the provision of QoS guarantees is the study of the scheduling disciplines to be employed at network switches.In this paper

we strive to combine the simplicity of frame-based schedulers with the performance characteristics of generalized processor sharing(GPS) disciplines

and propose a new scheduling mechanism named Hierarchical Frame-based Fair Queueing(HFFQ).HFFQ can support both real time traffic and non-real time traffic at the same time.In addition

it tremendously decrease the implement complexity by using counters to substitute the computing of system virtual time of other mechanism.At last

we evaluate some performance metrics of the HFFQ

such as fairness

service rate etc

using both analysis and simulation

and the results show that HFFQ has a better performance than that of PGPS.