Hierarchical fair-service curve

From Wikipedia, the free encyclopedia
  (Redirected from Hierarchical Fair Service Curve)
Jump to: navigation, 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]

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

References[edit]

External links[edit]