Hierarchical fair-service curve

From Wikipedia, the free encyclopedia
  (Redirected from Hierarchical Fair Service Curve)
Jump to navigation Jump to search

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.

References[edit]

  1. ^ "A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services" (PDF). Ion Stoica, Hui Zhang and T. S. Eugene. 1997-09-18. Retrieved 2013-09-07.
  2. ^ http://conferences.sigcomm.org/sigcomm/1997/program.html#ab011
  3. ^ "HFSC Linux kernel network scheduler module". kernel.org. Retrieved 2013-09-07.
  4. ^ "Usage of HFSC in OpenWrt". OpenWrt.

External links[edit]