<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Hierarchical fair-service curve - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Hierarchical_fair-service_curve&amp;p=2">3.Next</a>
</p>
<p>The <b>hierarchical fair-service curve</b> (<b>HFSC</b>) is a network scheduling <a href="page.php?w=algorithm">algorithm</a> for a <a href="page.php?w=network_scheduler">network scheduler</a> proposed by <a href="page.php?w=Ion_Stoica">Ion Stoica</a>, <a href="page.php?w=Hui_Zhang_%28computer_scientist%29">Hui Zhang</a>, and T. S. Eugene from <a href="page.php?w=Carnegie_Mellon_University">Carnegie Mellon University</a> at <a href="page.php?w=SIGCOMM">SIGCOMM</a> 1997</p>

<p>It is based on a <a href="page.php?w=Quality_of_service">QoS</a> and</p><p>
<a accesskey="3" href="page.php?w=Hierarchical_fair-service_curve&amp;p=2">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
