Hi, On Fri, Jan 23, 2009 at 11:12:42PM +0800, Pui Edylie wrote: > From the website > > http://www.openbsd.org/faq/pf/queueing.html > > It says it only supports FIFO, CBQ and PRIOQ
Yes, pf supports HFSC (Hierarchical Fair Service Curve) for queuing. Extract from man pf.conf (http://www.openbsd.org/cgi-bin/man.cgi?query=pf.conf) : Hierarchical Fair Service Curve. Queues attached to an interface build a tree, thus each queue can have further child queues. Each queue can have a priority and a bandwidth assigned. Priority mainly controls the time packets take to get sent out, while bandwidth primarily affects throughput. hfsc supports both link-sharing and guaranteed real-time services. It employs a service curve based QoS model, and its unique feature is an ability to decouple delay and bandwidth allocation. See this use-case for VoIP : http://my.opera.com/blu3c4t/blog/2008/01/18/openbsd-firewall-packet-sceheduling-analysis-for-ip-telephony-qos-part-2-desig regards, Laurent
