Hierarchical fair-service curve explained

The hierarchical fair-service curve (HFSC) is a network scheduling algorithm for a network scheduler proposed by Ion Stoica, Hui Zhang and T. S. Eugene from Carnegie Mellon University at SIGCOMM 1997^{[1] [2]}

It is based on a QoS and CBQ. An implementation of HFSC is available in all operating systems based on the Linux kernel,^[3] such as e.g. OpenWrt,^[4] and also in DD-WRT, NetBSD 5.0, FreeBSD 8.0 and OpenBSD 4.6.

External links

• Hierarchical Packet Schedulers
• HFSC Scheduling with Linux
• HFSC Tutorial
• HFSC and VoIP « Maciej Bliziński

Notes and References

1. Web site: A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services . Ion Stoica, Hui Zhang and T. S. Eugene . 1997-09-18 . 2013-09-07.
2. Web site: ACM SIGCOMM '97 Conference, Preliminary Program.
3. Web site: HFSC Linux kernel network scheduler module . . 2013-09-07.
4. Web site: Usage of HFSC in OpenWrt . OpenWrt.